Submission #74367

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
74367	2018-08-31T12:04:26 Z	nvmdava	Ancient Books (IOI17_books)	C++17	50 / 100	201 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;
	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:29:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < p.size(); i++){
                 ~~^~~~~~~~~~
books.cpp:27: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	380 KB	Output is correct
3	Correct	2 ms	380 KB	Output is correct
4	Correct	2 ms	440 KB	Output is correct
5	Correct	2 ms	444 KB	Output is correct
6	Correct	2 ms	456 KB	Output is correct
7	Correct	2 ms	468 KB	Output is correct
8	Correct	2 ms	548 KB	Output is correct
9	Correct	2 ms	576 KB	Output is correct
10	Correct	2 ms	576 KB	Output is correct
11	Correct	2 ms	576 KB	Output is correct
12	Correct	2 ms	576 KB	Output is correct
13	Correct	2 ms	576 KB	Output is correct
14	Correct	2 ms	576 KB	Output is correct
15	Correct	2 ms	576 KB	Output is correct
16	Correct	2 ms	576 KB	Output is correct
17	Correct	2 ms	576 KB	Output is correct
18	Correct	2 ms	576 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	380 KB	Output is correct
3	Correct	2 ms	380 KB	Output is correct
4	Correct	2 ms	440 KB	Output is correct
5	Correct	2 ms	444 KB	Output is correct
6	Correct	2 ms	456 KB	Output is correct
7	Correct	2 ms	468 KB	Output is correct
8	Correct	2 ms	548 KB	Output is correct
9	Correct	2 ms	576 KB	Output is correct
10	Correct	2 ms	576 KB	Output is correct
11	Correct	2 ms	576 KB	Output is correct
12	Correct	2 ms	576 KB	Output is correct
13	Correct	2 ms	576 KB	Output is correct
14	Correct	2 ms	576 KB	Output is correct
15	Correct	2 ms	576 KB	Output is correct
16	Correct	2 ms	576 KB	Output is correct
17	Correct	2 ms	576 KB	Output is correct
18	Correct	2 ms	576 KB	Output is correct
19	Correct	2 ms	636 KB	Output is correct
20	Correct	2 ms	636 KB	Output is correct
21	Correct	2 ms	636 KB	Output is correct
22	Correct	2 ms	636 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	2 ms	640 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	380 KB	Output is correct
3	Correct	2 ms	380 KB	Output is correct
4	Correct	2 ms	440 KB	Output is correct
5	Correct	2 ms	444 KB	Output is correct
6	Correct	2 ms	456 KB	Output is correct
7	Correct	2 ms	468 KB	Output is correct
8	Correct	2 ms	548 KB	Output is correct
9	Correct	2 ms	576 KB	Output is correct
10	Correct	2 ms	576 KB	Output is correct
11	Correct	2 ms	576 KB	Output is correct
12	Correct	2 ms	576 KB	Output is correct
13	Correct	2 ms	576 KB	Output is correct
14	Correct	2 ms	576 KB	Output is correct
15	Correct	2 ms	576 KB	Output is correct
16	Correct	2 ms	576 KB	Output is correct
17	Correct	2 ms	576 KB	Output is correct
18	Correct	2 ms	576 KB	Output is correct
19	Correct	2 ms	636 KB	Output is correct
20	Correct	2 ms	636 KB	Output is correct
21	Correct	2 ms	636 KB	Output is correct
22	Correct	2 ms	636 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	2 ms	640 KB	Output is correct
30	Correct	199 ms	13256 KB	Output is correct
31	Correct	201 ms	13308 KB	Output is correct
32	Correct	142 ms	13308 KB	Output is correct
33	Correct	149 ms	13308 KB	Output is correct
34	Correct	154 ms	13308 KB	Output is correct
35	Correct	156 ms	13308 KB	Output is correct
36	Correct	158 ms	13308 KB	Output is correct
37	Correct	165 ms	13308 KB	Output is correct
38	Correct	157 ms	13312 KB	Output is correct
39	Correct	170 ms	13312 KB	Output is correct
40	Correct	178 ms	13312 KB	Output is correct
41	Correct	192 ms	13312 KB	Output is correct
42	Correct	195 ms	13312 KB	Output is correct
43	Correct	147 ms	13312 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	13312 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	376 KB	Output is correct
2	Correct	2 ms	380 KB	Output is correct
3	Correct	2 ms	380 KB	Output is correct
4	Correct	2 ms	440 KB	Output is correct
5	Correct	2 ms	444 KB	Output is correct
6	Correct	2 ms	456 KB	Output is correct
7	Correct	2 ms	468 KB	Output is correct
8	Correct	2 ms	548 KB	Output is correct
9	Correct	2 ms	576 KB	Output is correct
10	Correct	2 ms	576 KB	Output is correct
11	Correct	2 ms	576 KB	Output is correct
12	Correct	2 ms	576 KB	Output is correct
13	Correct	2 ms	576 KB	Output is correct
14	Correct	2 ms	576 KB	Output is correct
15	Correct	2 ms	576 KB	Output is correct
16	Correct	2 ms	576 KB	Output is correct
17	Correct	2 ms	576 KB	Output is correct
18	Correct	2 ms	576 KB	Output is correct
19	Correct	2 ms	636 KB	Output is correct
20	Correct	2 ms	636 KB	Output is correct
21	Correct	2 ms	636 KB	Output is correct
22	Correct	2 ms	636 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	2 ms	640 KB	Output is correct
30	Correct	199 ms	13256 KB	Output is correct
31	Correct	201 ms	13308 KB	Output is correct
32	Correct	142 ms	13308 KB	Output is correct
33	Correct	149 ms	13308 KB	Output is correct
34	Correct	154 ms	13308 KB	Output is correct
35	Correct	156 ms	13308 KB	Output is correct
36	Correct	158 ms	13308 KB	Output is correct
37	Correct	165 ms	13308 KB	Output is correct
38	Correct	157 ms	13312 KB	Output is correct
39	Correct	170 ms	13312 KB	Output is correct
40	Correct	178 ms	13312 KB	Output is correct
41	Correct	192 ms	13312 KB	Output is correct
42	Correct	195 ms	13312 KB	Output is correct
43	Correct	147 ms	13312 KB	Output is correct
44	Incorrect	2 ms	13312 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-

Submission #74367

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