#include "shoes.h"
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
using lint = long long;
lint count_swaps(std::vector<int> s) {
lint ret = 0;
int ptr = 0;
for(int i=0; i<sz(s); i++){
if(s[i] < 0) ret += abs(i - 2 * (ptr++));
}
return ret;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Correct |
2 ms |
256 KB |
Output is correct |
4 |
Correct |
2 ms |
256 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
256 KB |
Output is correct |
7 |
Correct |
2 ms |
256 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
256 KB |
Output is correct |
10 |
Correct |
0 ms |
256 KB |
Output is correct |
11 |
Correct |
2 ms |
376 KB |
Output is correct |
12 |
Correct |
2 ms |
256 KB |
Output is correct |
13 |
Correct |
2 ms |
296 KB |
Output is correct |
14 |
Correct |
2 ms |
256 KB |
Output is correct |
15 |
Correct |
2 ms |
256 KB |
Output is correct |
16 |
Correct |
2 ms |
256 KB |
Output is correct |
17 |
Correct |
2 ms |
256 KB |
Output is correct |
18 |
Correct |
2 ms |
376 KB |
Output is correct |
19 |
Correct |
2 ms |
256 KB |
Output is correct |
20 |
Correct |
5 ms |
504 KB |
Output is correct |
21 |
Correct |
4 ms |
504 KB |
Output is correct |
22 |
Correct |
28 ms |
1912 KB |
Output is correct |
23 |
Correct |
28 ms |
1884 KB |
Output is correct |
24 |
Correct |
28 ms |
1912 KB |
Output is correct |
25 |
Correct |
24 ms |
1912 KB |
Output is correct |
26 |
Correct |
28 ms |
1912 KB |
Output is correct |
27 |
Correct |
24 ms |
1912 KB |
Output is correct |
28 |
Correct |
26 ms |
1912 KB |
Output is correct |
29 |
Correct |
26 ms |
1912 KB |
Output is correct |
30 |
Correct |
26 ms |
1912 KB |
Output is correct |
31 |
Correct |
28 ms |
1912 KB |
Output is correct |
32 |
Correct |
26 ms |
1912 KB |
Output is correct |
33 |
Correct |
24 ms |
1912 KB |
Output is correct |
34 |
Correct |
26 ms |
1920 KB |
Output is correct |
35 |
Correct |
2 ms |
256 KB |
Output is correct |
36 |
Correct |
2 ms |
256 KB |
Output is correct |
37 |
Correct |
27 ms |
1916 KB |
Output is correct |
38 |
Correct |
26 ms |
1916 KB |
Output is correct |
39 |
Correct |
26 ms |
1912 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
256 KB |
Output is correct |
5 |
Correct |
31 ms |
1912 KB |
Output is correct |
6 |
Correct |
31 ms |
1912 KB |
Output is correct |
7 |
Correct |
31 ms |
2040 KB |
Output is correct |
8 |
Correct |
30 ms |
1912 KB |
Output is correct |
9 |
Correct |
31 ms |
1912 KB |
Output is correct |
10 |
Correct |
32 ms |
1912 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |