oj.uz

Submission #33233

# Submission time Handle Problem Language Result Execution time Memory
33233 2017-10-23T04:15:03 Z model_code Ancient Books (IOI17_books) C++11
22 / 100
 2000 ms 9944 KB 
// Library solution for S=0 in O(N^2)
// Score: 35
#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;
	vector<bool> covered(N-1, false);
	for(int i=0; i<N; i++) {
		result += abs(i-order[i]); // Compute d(pi)
		// Non-optimal linear sweep over the arc [i,order[i]]
		for(int j=min(i,order[i]); j<max(i,order[i]); j++) {
			covered[j] = 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;
}

Subtask #1
12.0 / 12.0

# 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

Subtask #2
10.0 / 10.0

# 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

Subtask #3
0 / 28.0

# 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 Execution timed out 2000 ms 9944 KB Execution timed out
31 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 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 -

Subtask #5
0 / 30.0

# 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 Execution timed out 2000 ms 9944 KB Execution timed out
31 Halted 0 ms 0 KB -