#include "shoes.h"
using namespace std;
long long count_swaps(vector<int> a) {
int n = a.size()/2;n--;
long long ans = 0;
ans = (long long)n*(n+1ll)/2ll;
/*for(int i=0;i<n;i++){
if(a[i*2]+a[i*2+1] == 0){
if(a[i*2] > 0){
ans ++;
swap(a[i*2], a[i*2+1]);
}
continue;
}
int j;
for(j=i*2+1; j < n*2; j++){
if(a[j] == -a[i*2]){ // found
break;
}
}
if(a[i*2] < 0){
while(j-1 > i*2){
j--;
swap(a[j], a[j+1]);
ans ++ ;
}
}else {
while(j-1 >= i*2){
j--;
swap(a[j], a[j+1]);
ans ++ ;
}
}
}*/
return ans;
}
/*
3
-2 2 2 -2 -2 2
2
2 1 -1 -2
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
256 KB |
Output is correct |
2 |
Incorrect |
0 ms |
256 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
256 KB |
Output is correct |
2 |
Incorrect |
0 ms |
256 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
256 KB |
Output is correct |
2 |
Incorrect |
0 ms |
256 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
1 ms |
256 KB |
Output is correct |
3 |
Correct |
1 ms |
256 KB |
Output is correct |
4 |
Correct |
0 ms |
256 KB |
Output is correct |
5 |
Correct |
33 ms |
1912 KB |
Output is correct |
6 |
Correct |
33 ms |
1912 KB |
Output is correct |
7 |
Correct |
32 ms |
1912 KB |
Output is correct |
8 |
Correct |
29 ms |
1912 KB |
Output is correct |
9 |
Correct |
32 ms |
1912 KB |
Output is correct |
10 |
Correct |
32 ms |
1912 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
256 KB |
Output is correct |
2 |
Incorrect |
0 ms |
256 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
256 KB |
Output is correct |
2 |
Incorrect |
0 ms |
256 KB |
Output isn't correct |