이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "shoes.h"
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID ((l+r)/2)
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<ll, ll> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef map<int, int> mii;
#define EPS 1e-6
#define FOR(i,n) for(int i=0;i<((int)(n));i++)
#define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++)
#define FOA(v, a) for(auto v : a)
long long count_swaps(std::vector<int> s) {
map<int, set<int> > left, right;
int n = s.size()/2;
FOR(i,s.size()){
if(s[i]>0) right[s[i]].insert(i);
else left[-s[i]].insert(i);
}
int ans=0;
FOR(i,n){
int ind = 0;
FOR(j,2*n){
if(s[j]==-s[0]){
ind = j;
break;
}
}
//cout<<"i "<<ind<<endl;
if(s[0]>0){
ans+=ind;
}
else{
ans+=ind-1;
}
s.erase(s.begin()+ind);
s.erase(s.begin());
//cout<<ans<<endl;
//FOA(v, s) cout<<v<<" ";
//cout<<endl;
}
return ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |