#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define lint long long
using namespace std;
lint count_swaps(vector<int> s){
int n = s.size()/2;
vector<set<int>>set(2*n+1);
vector<bool>ignore(2*n);
rep(i,2*n){
set[s[i]+n].insert(i);
}
int sum=0;
vector<int>add(2*n);
int curAdd=0;
rep(i,2*n){
curAdd+=add[i];
sum+=curAdd;
if(ignore[i]){continue;}
int nearest=*set[-s[i]+n].begin();
set[-s[i]+n].erase(set[-s[i]+n].begin());
ignore[nearest]=true;
curAdd--;
add[nearest]++;
if(s[i]>0){sum++;}
sum+=nearest-i-1;
}
return sum;
}
/*
signed main(){
int n;
cin >> n;
n*=2;
vector<int>s(n);
rep(i,n){cin>>s[i];}
cout << count_swaps(s);
}
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
3 |
Incorrect |
0 ms |
256 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
3 |
Incorrect |
1 ms |
288 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Incorrect |
1 ms |
256 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
3 |
Incorrect |
0 ms |
256 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
3 |
Incorrect |
0 ms |
256 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |