Submission #74333

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
74333	2018-08-31T10:21:20 Z	nvmdava	Ancient Books (IOI17_books)	C++17	50 / 100	202 ms	13440 KB

books

#include "books.h"
#include <bits/stdc++.h>
using namespace std;
int r = -1, l = 1000001;
vector<int> p;
bool in[1000001];
void go(int v){
	if(in[v] == 1){
		return;
	}
	in[v] = 1;
	r = max(r, v);
	go(p[v]);
}
 
long long minimum_walk(vector<int> p, int s) {
	::p = p;
	int q = 0;
	long long ans = 0;
	for(int i = 0; i < p.size(); i++){
		ans += (long long)abs(i - p[i]);
		if(in[i] || p[i] == i) continue;
		l = min(l, i);
		if(r < i && r != -1){
			ans += (long long)(i - r) * 2;
		}
		go(i);
	}
	if(s < l && l != 1000001){
		ans += (l - s) * 2;
	} else if(s > r &&r != -1){
		ans += (r - s) * 2;
	}
	return ans;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:20:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < p.size(); i++){
                 ~~^~~~~~~~~~
books.cpp:18:6: warning: unused variable 'q' [-Wunused-variable]
  int q = 0;
      ^

Subtask #1
12.0 / 12.0

#	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	484 KB	Output is correct
4	Correct	2 ms	484 KB	Output is correct
5	Correct	2 ms	484 KB	Output is correct
6	Correct	2 ms	484 KB	Output is correct
7	Correct	2 ms	544 KB	Output is correct
8	Correct	2 ms	604 KB	Output is correct
9	Correct	2 ms	604 KB	Output is correct
10	Correct	2 ms	604 KB	Output is correct
11	Correct	2 ms	624 KB	Output is correct
12	Correct	2 ms	636 KB	Output is correct
13	Correct	2 ms	640 KB	Output is correct
14	Correct	2 ms	640 KB	Output is correct
15	Correct	2 ms	640 KB	Output is correct
16	Correct	2 ms	640 KB	Output is correct
17	Correct	2 ms	640 KB	Output is correct
18	Correct	2 ms	640 KB	Output is correct

Subtask #2
10.0 / 10.0

#	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	484 KB	Output is correct
4	Correct	2 ms	484 KB	Output is correct
5	Correct	2 ms	484 KB	Output is correct
6	Correct	2 ms	484 KB	Output is correct
7	Correct	2 ms	544 KB	Output is correct
8	Correct	2 ms	604 KB	Output is correct
9	Correct	2 ms	604 KB	Output is correct
10	Correct	2 ms	604 KB	Output is correct
11	Correct	2 ms	624 KB	Output is correct
12	Correct	2 ms	636 KB	Output is correct
13	Correct	2 ms	640 KB	Output is correct
14	Correct	2 ms	640 KB	Output is correct
15	Correct	2 ms	640 KB	Output is correct
16	Correct	2 ms	640 KB	Output is correct
17	Correct	2 ms	640 KB	Output is correct
18	Correct	2 ms	640 KB	Output is correct
19	Correct	2 ms	640 KB	Output is correct
20	Correct	2 ms	640 KB	Output is correct
21	Correct	2 ms	640 KB	Output is correct
22	Correct	2 ms	640 KB	Output is correct
23	Correct	2 ms	640 KB	Output is correct
24	Correct	2 ms	640 KB	Output is correct
25	Correct	2 ms	640 KB	Output is correct
26	Correct	2 ms	640 KB	Output is correct
27	Correct	2 ms	640 KB	Output is correct
28	Correct	2 ms	640 KB	Output is correct
29	Correct	3 ms	640 KB	Output is correct

Subtask #3
28.0 / 28.0

#	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	484 KB	Output is correct
4	Correct	2 ms	484 KB	Output is correct
5	Correct	2 ms	484 KB	Output is correct
6	Correct	2 ms	484 KB	Output is correct
7	Correct	2 ms	544 KB	Output is correct
8	Correct	2 ms	604 KB	Output is correct
9	Correct	2 ms	604 KB	Output is correct
10	Correct	2 ms	604 KB	Output is correct
11	Correct	2 ms	624 KB	Output is correct
12	Correct	2 ms	636 KB	Output is correct
13	Correct	2 ms	640 KB	Output is correct
14	Correct	2 ms	640 KB	Output is correct
15	Correct	2 ms	640 KB	Output is correct
16	Correct	2 ms	640 KB	Output is correct
17	Correct	2 ms	640 KB	Output is correct
18	Correct	2 ms	640 KB	Output is correct
19	Correct	2 ms	640 KB	Output is correct
20	Correct	2 ms	640 KB	Output is correct
21	Correct	2 ms	640 KB	Output is correct
22	Correct	2 ms	640 KB	Output is correct
23	Correct	2 ms	640 KB	Output is correct
24	Correct	2 ms	640 KB	Output is correct
25	Correct	2 ms	640 KB	Output is correct
26	Correct	2 ms	640 KB	Output is correct
27	Correct	2 ms	640 KB	Output is correct
28	Correct	2 ms	640 KB	Output is correct
29	Correct	3 ms	640 KB	Output is correct
30	Correct	202 ms	13312 KB	Output is correct
31	Correct	198 ms	13312 KB	Output is correct
32	Correct	144 ms	13312 KB	Output is correct
33	Correct	157 ms	13312 KB	Output is correct
34	Correct	149 ms	13344 KB	Output is correct
35	Correct	164 ms	13344 KB	Output is correct
36	Correct	162 ms	13344 KB	Output is correct
37	Correct	158 ms	13344 KB	Output is correct
38	Correct	187 ms	13344 KB	Output is correct
39	Correct	158 ms	13440 KB	Output is correct
40	Correct	160 ms	13440 KB	Output is correct
41	Correct	184 ms	13440 KB	Output is correct
42	Correct	179 ms	13440 KB	Output is correct
43	Correct	150 ms	13440 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	13440 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	2 ms	256 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	484 KB	Output is correct
4	Correct	2 ms	484 KB	Output is correct
5	Correct	2 ms	484 KB	Output is correct
6	Correct	2 ms	484 KB	Output is correct
7	Correct	2 ms	544 KB	Output is correct
8	Correct	2 ms	604 KB	Output is correct
9	Correct	2 ms	604 KB	Output is correct
10	Correct	2 ms	604 KB	Output is correct
11	Correct	2 ms	624 KB	Output is correct
12	Correct	2 ms	636 KB	Output is correct
13	Correct	2 ms	640 KB	Output is correct
14	Correct	2 ms	640 KB	Output is correct
15	Correct	2 ms	640 KB	Output is correct
16	Correct	2 ms	640 KB	Output is correct
17	Correct	2 ms	640 KB	Output is correct
18	Correct	2 ms	640 KB	Output is correct
19	Correct	2 ms	640 KB	Output is correct
20	Correct	2 ms	640 KB	Output is correct
21	Correct	2 ms	640 KB	Output is correct
22	Correct	2 ms	640 KB	Output is correct
23	Correct	2 ms	640 KB	Output is correct
24	Correct	2 ms	640 KB	Output is correct
25	Correct	2 ms	640 KB	Output is correct
26	Correct	2 ms	640 KB	Output is correct
27	Correct	2 ms	640 KB	Output is correct
28	Correct	2 ms	640 KB	Output is correct
29	Correct	3 ms	640 KB	Output is correct
30	Correct	202 ms	13312 KB	Output is correct
31	Correct	198 ms	13312 KB	Output is correct
32	Correct	144 ms	13312 KB	Output is correct
33	Correct	157 ms	13312 KB	Output is correct
34	Correct	149 ms	13344 KB	Output is correct
35	Correct	164 ms	13344 KB	Output is correct
36	Correct	162 ms	13344 KB	Output is correct
37	Correct	158 ms	13344 KB	Output is correct
38	Correct	187 ms	13344 KB	Output is correct
39	Correct	158 ms	13440 KB	Output is correct
40	Correct	160 ms	13440 KB	Output is correct
41	Correct	184 ms	13440 KB	Output is correct
42	Correct	179 ms	13440 KB	Output is correct
43	Correct	150 ms	13440 KB	Output is correct
44	Incorrect	2 ms	13440 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-

Submission #74333

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 10.0 / 10.0

Subtask #3 28.0 / 28.0

Subtask #4 0 / 20.0

Subtask #5 0 / 30.0

Subtask #1
12.0 / 12.0

Subtask #2
10.0 / 10.0

Subtask #3
28.0 / 28.0

Subtask #4
0 / 20.0

Subtask #5
0 / 30.0