Submission #1048554

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1048554	2024-08-08T08:20:53 Z	pcc	Ancient Books (IOI17_books)	C++17	50 / 100	78 ms	15956 KB

books

#include "books.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long
const int mxn = 1e6+10;
int N;
int l[mxn],r[mxn];

long long minimum_walk(std::vector<int> p, int s) {
	ll ans = 0;
	N = p.size();
	for(int i = 0;i<N;i++){
		if(p[i] == i)continue;
		int a = i,b = p[i];
		if(a<b){
			l[a]++;
			l[b]--;
		}
		else{
			r[b]++;
			r[a]--;
		}
	}
	for(int i = 1;i<N;i++){
		l[i] += l[i-1];
		r[i] += r[i-1];
	}
	int lp = s,rp = s-1;
	for(int i = s;i+1<N;i++){
		if(max(l[i],r[i]) != 0)rp = i;
	}
	for(int i = s-1;i>=0;i--){
		if(max(l[i],r[i]) != 0)lp = i;
	}
	for(int i = lp;i<=rp;i++){
		ans += max({l[i],r[i],1})<<1;
	}
	return ans;
}

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	2392 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	0 ms	2396 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	2392 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	2396 KB	Output is correct
13	Correct	0 ms	2396 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	0 ms	2396 KB	Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	2392 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	0 ms	2396 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	2392 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	2396 KB	Output is correct
13	Correct	0 ms	2396 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	0 ms	2396 KB	Output is correct
19	Correct	0 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	2396 KB	Output is correct
23	Correct	0 ms	2396 KB	Output is correct
24	Correct	0 ms	2396 KB	Output is correct
25	Correct	1 ms	2392 KB	Output is correct
26	Correct	0 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	0 ms	2396 KB	Output is correct
29	Correct	0 ms	2396 KB	Output is correct
30	Correct	60 ms	15860 KB	Output is correct
31	Correct	62 ms	15952 KB	Output is correct
32	Correct	54 ms	15956 KB	Output is correct
33	Correct	58 ms	15880 KB	Output is correct
34	Correct	58 ms	15880 KB	Output is correct
35	Correct	57 ms	15880 KB	Output is correct
36	Correct	58 ms	15956 KB	Output is correct
37	Correct	66 ms	15952 KB	Output is correct
38	Correct	69 ms	15952 KB	Output is correct
39	Correct	57 ms	15952 KB	Output is correct
40	Correct	56 ms	15952 KB	Output is correct
41	Correct	57 ms	15952 KB	Output is correct
42	Correct	78 ms	15956 KB	Output is correct
43	Correct	68 ms	15952 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	2392 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	2392 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	0 ms	2396 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	2392 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	2396 KB	Output is correct
13	Correct	0 ms	2396 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	0 ms	2396 KB	Output is correct
19	Correct	0 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	2396 KB	Output is correct
23	Correct	0 ms	2396 KB	Output is correct
24	Correct	0 ms	2396 KB	Output is correct
25	Correct	1 ms	2392 KB	Output is correct
26	Correct	0 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	0 ms	2396 KB	Output is correct
29	Correct	0 ms	2396 KB	Output is correct
30	Correct	60 ms	15860 KB	Output is correct
31	Correct	62 ms	15952 KB	Output is correct
32	Correct	54 ms	15956 KB	Output is correct
33	Correct	58 ms	15880 KB	Output is correct
34	Correct	58 ms	15880 KB	Output is correct
35	Correct	57 ms	15880 KB	Output is correct
36	Correct	58 ms	15956 KB	Output is correct
37	Correct	66 ms	15952 KB	Output is correct
38	Correct	69 ms	15952 KB	Output is correct
39	Correct	57 ms	15952 KB	Output is correct
40	Correct	56 ms	15952 KB	Output is correct
41	Correct	57 ms	15952 KB	Output is correct
42	Correct	78 ms	15956 KB	Output is correct
43	Correct	68 ms	15952 KB	Output is correct
44	Incorrect	1 ms	2392 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-

Submission #1048554

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