#include <bits/stdc++.h>
using namespace std;
#define ll long long
queue<pair<int,int>> pos[200004];
ll count_swaps(vector<int> S){
ll n=S.size(),open=0,odp=0;
for (int i = 0; i<n; i++){
if (S[i]>0){
if (pos[S[i]+100000].empty()){
pos[S[i]].push({i,open});
open++;
}
else{
odp+=i-pos[S[i]+100000].front().first-1;
open--;
odp-=open-pos[S[i]+100000].front().second;
pos[S[i]+100000].pop();
}
}
else{
if (pos[-S[i]].empty()){
pos[100000-S[i]].push({i,open});
open++;
}
else{
odp+=i-pos[-S[i]].front().first;
open--;
odp-=open-pos[-S[i]].front().second;
pos[-S[i]].pop();
}
}
}
return odp;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
66 ms |
134996 KB |
Output is correct |
2 |
Correct |
66 ms |
134920 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
66 ms |
134996 KB |
Output is correct |
2 |
Correct |
66 ms |
134920 KB |
Output is correct |
3 |
Correct |
67 ms |
134996 KB |
Output is correct |
4 |
Correct |
65 ms |
134932 KB |
Output is correct |
5 |
Correct |
68 ms |
134992 KB |
Output is correct |
6 |
Correct |
68 ms |
134924 KB |
Output is correct |
7 |
Incorrect |
71 ms |
134944 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
66 ms |
134996 KB |
Output is correct |
2 |
Correct |
66 ms |
134920 KB |
Output is correct |
3 |
Incorrect |
66 ms |
134996 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
65 ms |
134996 KB |
Output is correct |
2 |
Incorrect |
66 ms |
134992 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
66 ms |
134996 KB |
Output is correct |
2 |
Correct |
66 ms |
134920 KB |
Output is correct |
3 |
Correct |
67 ms |
134996 KB |
Output is correct |
4 |
Correct |
65 ms |
134932 KB |
Output is correct |
5 |
Correct |
68 ms |
134992 KB |
Output is correct |
6 |
Correct |
68 ms |
134924 KB |
Output is correct |
7 |
Incorrect |
71 ms |
134944 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
66 ms |
134996 KB |
Output is correct |
2 |
Correct |
66 ms |
134920 KB |
Output is correct |
3 |
Correct |
67 ms |
134996 KB |
Output is correct |
4 |
Correct |
65 ms |
134932 KB |
Output is correct |
5 |
Correct |
68 ms |
134992 KB |
Output is correct |
6 |
Correct |
68 ms |
134924 KB |
Output is correct |
7 |
Incorrect |
71 ms |
134944 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |