// Library solution for S=0 in O(N)
// Score: 50
#include "books.h"
#include <cstdlib>
#include <vector>
using namespace std;
long long minimum_walk(vector<int> order, int S){
int N = order.size();
long long int result = 0;
int right = 0;
vector<bool> covered(N-1, false);
for(int i=0; i<N; i++) {
result += abs(i-order[i]); // Compute d(pi)
right = max(right,order[i]);
if(i<N-1 && right>i) covered[i] = true;
}
int counter = 0;
for(int i=0; i<N-1; i++) {
if(!covered[i]) {
// [i,i+1] is in E' if some uncovered edge follows
counter++;
} else {
result += 2*counter;
counter = 0;
}
}
return result;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1928 KB |
Output is correct |
2 |
Correct |
0 ms |
1928 KB |
Output is correct |
3 |
Correct |
0 ms |
1928 KB |
Output is correct |
4 |
Correct |
0 ms |
1928 KB |
Output is correct |
5 |
Correct |
0 ms |
1928 KB |
Output is correct |
6 |
Correct |
0 ms |
1928 KB |
Output is correct |
7 |
Correct |
0 ms |
1928 KB |
Output is correct |
8 |
Correct |
0 ms |
1928 KB |
Output is correct |
9 |
Correct |
0 ms |
1928 KB |
Output is correct |
10 |
Correct |
0 ms |
1928 KB |
Output is correct |
11 |
Correct |
0 ms |
1928 KB |
Output is correct |
12 |
Correct |
0 ms |
1928 KB |
Output is correct |
13 |
Correct |
0 ms |
1928 KB |
Output is correct |
14 |
Correct |
0 ms |
1928 KB |
Output is correct |
15 |
Correct |
0 ms |
1928 KB |
Output is correct |
16 |
Correct |
0 ms |
1928 KB |
Output is correct |
17 |
Correct |
0 ms |
1928 KB |
Output is correct |
18 |
Correct |
0 ms |
1928 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1928 KB |
Output is correct |
2 |
Correct |
0 ms |
1928 KB |
Output is correct |
3 |
Correct |
0 ms |
1928 KB |
Output is correct |
4 |
Correct |
0 ms |
1928 KB |
Output is correct |
5 |
Correct |
0 ms |
1928 KB |
Output is correct |
6 |
Correct |
0 ms |
1928 KB |
Output is correct |
7 |
Correct |
0 ms |
1928 KB |
Output is correct |
8 |
Correct |
0 ms |
1928 KB |
Output is correct |
9 |
Correct |
0 ms |
1928 KB |
Output is correct |
10 |
Correct |
0 ms |
1928 KB |
Output is correct |
11 |
Correct |
0 ms |
1928 KB |
Output is correct |
12 |
Correct |
0 ms |
1928 KB |
Output is correct |
13 |
Correct |
0 ms |
1928 KB |
Output is correct |
14 |
Correct |
0 ms |
1928 KB |
Output is correct |
15 |
Correct |
0 ms |
1928 KB |
Output is correct |
16 |
Correct |
0 ms |
1928 KB |
Output is correct |
17 |
Correct |
0 ms |
1928 KB |
Output is correct |
18 |
Correct |
0 ms |
1928 KB |
Output is correct |
19 |
Correct |
0 ms |
1928 KB |
Output is correct |
20 |
Correct |
0 ms |
1928 KB |
Output is correct |
21 |
Correct |
0 ms |
1928 KB |
Output is correct |
22 |
Correct |
0 ms |
1928 KB |
Output is correct |
23 |
Correct |
0 ms |
1928 KB |
Output is correct |
24 |
Correct |
0 ms |
1928 KB |
Output is correct |
25 |
Correct |
0 ms |
1928 KB |
Output is correct |
26 |
Correct |
0 ms |
1928 KB |
Output is correct |
27 |
Correct |
0 ms |
1928 KB |
Output is correct |
28 |
Correct |
0 ms |
1928 KB |
Output is correct |
29 |
Correct |
0 ms |
1928 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1928 KB |
Output is correct |
2 |
Correct |
0 ms |
1928 KB |
Output is correct |
3 |
Correct |
0 ms |
1928 KB |
Output is correct |
4 |
Correct |
0 ms |
1928 KB |
Output is correct |
5 |
Correct |
0 ms |
1928 KB |
Output is correct |
6 |
Correct |
0 ms |
1928 KB |
Output is correct |
7 |
Correct |
0 ms |
1928 KB |
Output is correct |
8 |
Correct |
0 ms |
1928 KB |
Output is correct |
9 |
Correct |
0 ms |
1928 KB |
Output is correct |
10 |
Correct |
0 ms |
1928 KB |
Output is correct |
11 |
Correct |
0 ms |
1928 KB |
Output is correct |
12 |
Correct |
0 ms |
1928 KB |
Output is correct |
13 |
Correct |
0 ms |
1928 KB |
Output is correct |
14 |
Correct |
0 ms |
1928 KB |
Output is correct |
15 |
Correct |
0 ms |
1928 KB |
Output is correct |
16 |
Correct |
0 ms |
1928 KB |
Output is correct |
17 |
Correct |
0 ms |
1928 KB |
Output is correct |
18 |
Correct |
0 ms |
1928 KB |
Output is correct |
19 |
Correct |
0 ms |
1928 KB |
Output is correct |
20 |
Correct |
0 ms |
1928 KB |
Output is correct |
21 |
Correct |
0 ms |
1928 KB |
Output is correct |
22 |
Correct |
0 ms |
1928 KB |
Output is correct |
23 |
Correct |
0 ms |
1928 KB |
Output is correct |
24 |
Correct |
0 ms |
1928 KB |
Output is correct |
25 |
Correct |
0 ms |
1928 KB |
Output is correct |
26 |
Correct |
0 ms |
1928 KB |
Output is correct |
27 |
Correct |
0 ms |
1928 KB |
Output is correct |
28 |
Correct |
0 ms |
1928 KB |
Output is correct |
29 |
Correct |
0 ms |
1928 KB |
Output is correct |
30 |
Correct |
186 ms |
9944 KB |
Output is correct |
31 |
Correct |
173 ms |
9944 KB |
Output is correct |
32 |
Correct |
173 ms |
9944 KB |
Output is correct |
33 |
Correct |
133 ms |
9944 KB |
Output is correct |
34 |
Correct |
156 ms |
9944 KB |
Output is correct |
35 |
Correct |
166 ms |
9944 KB |
Output is correct |
36 |
Correct |
146 ms |
9944 KB |
Output is correct |
37 |
Correct |
173 ms |
9944 KB |
Output is correct |
38 |
Correct |
149 ms |
9944 KB |
Output is correct |
39 |
Correct |
156 ms |
9944 KB |
Output is correct |
40 |
Correct |
196 ms |
9944 KB |
Output is correct |
41 |
Correct |
159 ms |
9944 KB |
Output is correct |
42 |
Correct |
196 ms |
9944 KB |
Output is correct |
43 |
Correct |
153 ms |
9944 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
1928 KB |
3rd lines differ - on the 1st token, expected: '3304', found: '2744' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1928 KB |
Output is correct |
2 |
Correct |
0 ms |
1928 KB |
Output is correct |
3 |
Correct |
0 ms |
1928 KB |
Output is correct |
4 |
Correct |
0 ms |
1928 KB |
Output is correct |
5 |
Correct |
0 ms |
1928 KB |
Output is correct |
6 |
Correct |
0 ms |
1928 KB |
Output is correct |
7 |
Correct |
0 ms |
1928 KB |
Output is correct |
8 |
Correct |
0 ms |
1928 KB |
Output is correct |
9 |
Correct |
0 ms |
1928 KB |
Output is correct |
10 |
Correct |
0 ms |
1928 KB |
Output is correct |
11 |
Correct |
0 ms |
1928 KB |
Output is correct |
12 |
Correct |
0 ms |
1928 KB |
Output is correct |
13 |
Correct |
0 ms |
1928 KB |
Output is correct |
14 |
Correct |
0 ms |
1928 KB |
Output is correct |
15 |
Correct |
0 ms |
1928 KB |
Output is correct |
16 |
Correct |
0 ms |
1928 KB |
Output is correct |
17 |
Correct |
0 ms |
1928 KB |
Output is correct |
18 |
Correct |
0 ms |
1928 KB |
Output is correct |
19 |
Correct |
0 ms |
1928 KB |
Output is correct |
20 |
Correct |
0 ms |
1928 KB |
Output is correct |
21 |
Correct |
0 ms |
1928 KB |
Output is correct |
22 |
Correct |
0 ms |
1928 KB |
Output is correct |
23 |
Correct |
0 ms |
1928 KB |
Output is correct |
24 |
Correct |
0 ms |
1928 KB |
Output is correct |
25 |
Correct |
0 ms |
1928 KB |
Output is correct |
26 |
Correct |
0 ms |
1928 KB |
Output is correct |
27 |
Correct |
0 ms |
1928 KB |
Output is correct |
28 |
Correct |
0 ms |
1928 KB |
Output is correct |
29 |
Correct |
0 ms |
1928 KB |
Output is correct |
30 |
Correct |
186 ms |
9944 KB |
Output is correct |
31 |
Correct |
173 ms |
9944 KB |
Output is correct |
32 |
Correct |
173 ms |
9944 KB |
Output is correct |
33 |
Correct |
133 ms |
9944 KB |
Output is correct |
34 |
Correct |
156 ms |
9944 KB |
Output is correct |
35 |
Correct |
166 ms |
9944 KB |
Output is correct |
36 |
Correct |
146 ms |
9944 KB |
Output is correct |
37 |
Correct |
173 ms |
9944 KB |
Output is correct |
38 |
Correct |
149 ms |
9944 KB |
Output is correct |
39 |
Correct |
156 ms |
9944 KB |
Output is correct |
40 |
Correct |
196 ms |
9944 KB |
Output is correct |
41 |
Correct |
159 ms |
9944 KB |
Output is correct |
42 |
Correct |
196 ms |
9944 KB |
Output is correct |
43 |
Correct |
153 ms |
9944 KB |
Output is correct |
44 |
Incorrect |
0 ms |
1928 KB |
3rd lines differ - on the 1st token, expected: '3304', found: '2744' |
45 |
Halted |
0 ms |
0 KB |
- |