#include "shoes.h"
#include <bits/stdc++.h>
long long count_swaps(std::vector<int> s)
{
int n=s.size();
if(n==2)
{
if(s[0]>0)
return 1;
return 0;
}
int p=abs(s[0]);
int t=1;
for(int i=1;i<n;i++)
{
if(abs(s[i])!=p)
t=0;
}
int arr[101010];
int idx=0;
if(t)
{
long long answer=0;
for(int i=0;i<n;i++)
{
if(s[i]==p)
{
arr[idx]=i;
idx++;
}
}
for(int i=0;i<idx;i++)
answer+=abs(arr[i]-2*i-1);
return answer;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
588 KB |
Output is correct |
2 |
Correct |
1 ms |
588 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
588 KB |
Output is correct |
2 |
Correct |
1 ms |
588 KB |
Output is correct |
3 |
Incorrect |
1 ms |
588 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
588 KB |
Output is correct |
2 |
Correct |
1 ms |
588 KB |
Output is correct |
3 |
Correct |
1 ms |
676 KB |
Output is correct |
4 |
Correct |
1 ms |
588 KB |
Output is correct |
5 |
Correct |
1 ms |
588 KB |
Output is correct |
6 |
Correct |
1 ms |
676 KB |
Output is correct |
7 |
Correct |
1 ms |
588 KB |
Output is correct |
8 |
Correct |
1 ms |
588 KB |
Output is correct |
9 |
Correct |
1 ms |
588 KB |
Output is correct |
10 |
Correct |
1 ms |
620 KB |
Output is correct |
11 |
Correct |
1 ms |
588 KB |
Output is correct |
12 |
Correct |
1 ms |
588 KB |
Output is correct |
13 |
Correct |
1 ms |
588 KB |
Output is correct |
14 |
Correct |
1 ms |
588 KB |
Output is correct |
15 |
Correct |
1 ms |
588 KB |
Output is correct |
16 |
Correct |
1 ms |
588 KB |
Output is correct |
17 |
Correct |
1 ms |
672 KB |
Output is correct |
18 |
Correct |
1 ms |
684 KB |
Output is correct |
19 |
Correct |
1 ms |
588 KB |
Output is correct |
20 |
Correct |
3 ms |
844 KB |
Output is correct |
21 |
Correct |
3 ms |
844 KB |
Output is correct |
22 |
Correct |
20 ms |
2432 KB |
Output is correct |
23 |
Correct |
34 ms |
2508 KB |
Output is correct |
24 |
Correct |
22 ms |
2632 KB |
Output is correct |
25 |
Correct |
19 ms |
2532 KB |
Output is correct |
26 |
Correct |
34 ms |
3480 KB |
Output is correct |
27 |
Correct |
22 ms |
3224 KB |
Output is correct |
28 |
Correct |
20 ms |
3500 KB |
Output is correct |
29 |
Correct |
19 ms |
3480 KB |
Output is correct |
30 |
Correct |
20 ms |
3488 KB |
Output is correct |
31 |
Correct |
22 ms |
3504 KB |
Output is correct |
32 |
Correct |
20 ms |
3480 KB |
Output is correct |
33 |
Correct |
27 ms |
3268 KB |
Output is correct |
34 |
Correct |
27 ms |
3488 KB |
Output is correct |
35 |
Correct |
1 ms |
588 KB |
Output is correct |
36 |
Correct |
1 ms |
588 KB |
Output is correct |
37 |
Correct |
22 ms |
3484 KB |
Output is correct |
38 |
Correct |
18 ms |
3480 KB |
Output is correct |
39 |
Correct |
19 ms |
3476 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
536 KB |
Output is correct |
2 |
Incorrect |
1 ms |
588 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
588 KB |
Output is correct |
2 |
Correct |
1 ms |
588 KB |
Output is correct |
3 |
Incorrect |
1 ms |
588 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
588 KB |
Output is correct |
2 |
Correct |
1 ms |
588 KB |
Output is correct |
3 |
Incorrect |
1 ms |
588 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |