Submission #74390

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
74390	2018-08-31T14:32:55 Z	nvmdava	Ancient Books (IOI17_books)	C++17	50 / 100	228 ms	13312 KB

books

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

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:30:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < p.size(); i++){
                 ~~^~~~~~~~~~
books.cpp:28: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	376 KB	Output is correct
2	Correct	2 ms	608 KB	Output is correct
3	Correct	2 ms	608 KB	Output is correct
4	Correct	2 ms	608 KB	Output is correct
5	Correct	2 ms	608 KB	Output is correct
6	Correct	2 ms	608 KB	Output is correct
7	Correct	2 ms	608 KB	Output is correct
8	Correct	2 ms	608 KB	Output is correct
9	Correct	2 ms	608 KB	Output is correct
10	Correct	2 ms	608 KB	Output is correct
11	Correct	2 ms	608 KB	Output is correct
12	Correct	2 ms	608 KB	Output is correct
13	Correct	2 ms	608 KB	Output is correct
14	Correct	2 ms	608 KB	Output is correct
15	Correct	2 ms	608 KB	Output is correct
16	Correct	2 ms	608 KB	Output is correct
17	Correct	2 ms	720 KB	Output is correct
18	Correct	2 ms	720 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	608 KB	Output is correct
3	Correct	2 ms	608 KB	Output is correct
4	Correct	2 ms	608 KB	Output is correct
5	Correct	2 ms	608 KB	Output is correct
6	Correct	2 ms	608 KB	Output is correct
7	Correct	2 ms	608 KB	Output is correct
8	Correct	2 ms	608 KB	Output is correct
9	Correct	2 ms	608 KB	Output is correct
10	Correct	2 ms	608 KB	Output is correct
11	Correct	2 ms	608 KB	Output is correct
12	Correct	2 ms	608 KB	Output is correct
13	Correct	2 ms	608 KB	Output is correct
14	Correct	2 ms	608 KB	Output is correct
15	Correct	2 ms	608 KB	Output is correct
16	Correct	2 ms	608 KB	Output is correct
17	Correct	2 ms	720 KB	Output is correct
18	Correct	2 ms	720 KB	Output is correct
19	Correct	2 ms	720 KB	Output is correct
20	Correct	2 ms	720 KB	Output is correct
21	Correct	3 ms	720 KB	Output is correct
22	Correct	2 ms	720 KB	Output is correct
23	Correct	2 ms	720 KB	Output is correct
24	Correct	2 ms	720 KB	Output is correct
25	Correct	2 ms	720 KB	Output is correct
26	Correct	2 ms	720 KB	Output is correct
27	Correct	2 ms	720 KB	Output is correct
28	Correct	2 ms	720 KB	Output is correct
29	Correct	3 ms	720 KB	Output is correct

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	608 KB	Output is correct
3	Correct	2 ms	608 KB	Output is correct
4	Correct	2 ms	608 KB	Output is correct
5	Correct	2 ms	608 KB	Output is correct
6	Correct	2 ms	608 KB	Output is correct
7	Correct	2 ms	608 KB	Output is correct
8	Correct	2 ms	608 KB	Output is correct
9	Correct	2 ms	608 KB	Output is correct
10	Correct	2 ms	608 KB	Output is correct
11	Correct	2 ms	608 KB	Output is correct
12	Correct	2 ms	608 KB	Output is correct
13	Correct	2 ms	608 KB	Output is correct
14	Correct	2 ms	608 KB	Output is correct
15	Correct	2 ms	608 KB	Output is correct
16	Correct	2 ms	608 KB	Output is correct
17	Correct	2 ms	720 KB	Output is correct
18	Correct	2 ms	720 KB	Output is correct
19	Correct	2 ms	720 KB	Output is correct
20	Correct	2 ms	720 KB	Output is correct
21	Correct	3 ms	720 KB	Output is correct
22	Correct	2 ms	720 KB	Output is correct
23	Correct	2 ms	720 KB	Output is correct
24	Correct	2 ms	720 KB	Output is correct
25	Correct	2 ms	720 KB	Output is correct
26	Correct	2 ms	720 KB	Output is correct
27	Correct	2 ms	720 KB	Output is correct
28	Correct	2 ms	720 KB	Output is correct
29	Correct	3 ms	720 KB	Output is correct
30	Correct	228 ms	13292 KB	Output is correct
31	Correct	205 ms	13292 KB	Output is correct
32	Correct	144 ms	13292 KB	Output is correct
33	Correct	160 ms	13292 KB	Output is correct
34	Correct	154 ms	13292 KB	Output is correct
35	Correct	169 ms	13292 KB	Output is correct
36	Correct	172 ms	13292 KB	Output is correct
37	Correct	162 ms	13292 KB	Output is correct
38	Correct	165 ms	13292 KB	Output is correct
39	Correct	188 ms	13292 KB	Output is correct
40	Correct	174 ms	13292 KB	Output is correct
41	Correct	217 ms	13292 KB	Output is correct
42	Correct	193 ms	13312 KB	Output is correct
43	Correct	196 ms	13312 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	13312 KB	Output is correct
2	Incorrect	2 ms	13312 KB	3rd lines differ - on the 1st token, expected: '9800', found: '3304'
3	Halted	0 ms	0 KB	-

Subtask #5
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	608 KB	Output is correct
3	Correct	2 ms	608 KB	Output is correct
4	Correct	2 ms	608 KB	Output is correct
5	Correct	2 ms	608 KB	Output is correct
6	Correct	2 ms	608 KB	Output is correct
7	Correct	2 ms	608 KB	Output is correct
8	Correct	2 ms	608 KB	Output is correct
9	Correct	2 ms	608 KB	Output is correct
10	Correct	2 ms	608 KB	Output is correct
11	Correct	2 ms	608 KB	Output is correct
12	Correct	2 ms	608 KB	Output is correct
13	Correct	2 ms	608 KB	Output is correct
14	Correct	2 ms	608 KB	Output is correct
15	Correct	2 ms	608 KB	Output is correct
16	Correct	2 ms	608 KB	Output is correct
17	Correct	2 ms	720 KB	Output is correct
18	Correct	2 ms	720 KB	Output is correct
19	Correct	2 ms	720 KB	Output is correct
20	Correct	2 ms	720 KB	Output is correct
21	Correct	3 ms	720 KB	Output is correct
22	Correct	2 ms	720 KB	Output is correct
23	Correct	2 ms	720 KB	Output is correct
24	Correct	2 ms	720 KB	Output is correct
25	Correct	2 ms	720 KB	Output is correct
26	Correct	2 ms	720 KB	Output is correct
27	Correct	2 ms	720 KB	Output is correct
28	Correct	2 ms	720 KB	Output is correct
29	Correct	3 ms	720 KB	Output is correct
30	Correct	228 ms	13292 KB	Output is correct
31	Correct	205 ms	13292 KB	Output is correct
32	Correct	144 ms	13292 KB	Output is correct
33	Correct	160 ms	13292 KB	Output is correct
34	Correct	154 ms	13292 KB	Output is correct
35	Correct	169 ms	13292 KB	Output is correct
36	Correct	172 ms	13292 KB	Output is correct
37	Correct	162 ms	13292 KB	Output is correct
38	Correct	165 ms	13292 KB	Output is correct
39	Correct	188 ms	13292 KB	Output is correct
40	Correct	174 ms	13292 KB	Output is correct
41	Correct	217 ms	13292 KB	Output is correct
42	Correct	193 ms	13312 KB	Output is correct
43	Correct	196 ms	13312 KB	Output is correct
44	Correct	2 ms	13312 KB	Output is correct
45	Incorrect	2 ms	13312 KB	3rd lines differ - on the 1st token, expected: '9800', found: '3304'
46	Halted	0 ms	0 KB	-

Submission #74390

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