Submission #153279

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
153279	2019-09-13T07:38:02 Z	mieszko11b	Ancient Books (IOI17_books)	C++14	100 / 100	405 ms	178108 KB

books

#include "books.h"
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ii = pair<int, int>;

#define X first
#define Y second

int n;
bool vis[1000007];
ii I[1000007];
int minv[21][1000007], maxv[21][1000007];
int maxk[1000007];

int getmin(int a, int b) {
	int l = (b - a + 1);
	return min(minv[maxk[l]][a], minv[maxk[l]][b - (1 << maxk[l]) + 1]);
}

int getmax(int a, int b) {
	int l = (b - a + 1);
	return max(maxv[maxk[l]][a], maxv[maxk[l]][b - (1 << maxk[l]) + 1]);
}

ii extend(int a, int b) {
	int na = min(a, getmin(a, b));
	int nb = max(b, getmax(a, b));
	if((ii){na, nb} == (ii){a, b})
		return {a, b};
	return extend(na, nb);
}

int dist_left(int x, int y) {
	int res = 0;
	int a = x, b = x;
	while(a > y) {
		res++;
		a--;
		a = extend(a, b).X;
	}
	return res;
}

int dist_right(int x, int y) {
	int res = 0;
	int a = x, b = x;
	while(b < y) {
		res++;
		b++;
		b = extend(a, b).Y;
	}
	return res;
}

long long minimum_walk(std::vector<int> p, int s) {
	ll res = 0;
	n = p.size();

	for(int i = 0 ; i < n ; i++) {
		if(vis[i])
			continue;
	
		vector<int> tmp;
		int minx = 1e9, maxx = -1;
		
		int w = i;
		while(!vis[w]) {
			vis[w] = 1;
			res += abs(p[w] - w);
			minx = min(minx, w);
			maxx = max(maxx, w);
			tmp.push_back(w);
			w = p[w];
		}
		
		for(int x : tmp)
			I[x] = {minx, maxx};
	}

	for(int i = 0 ; i < n ; i++)
		minv[0][i] = maxv[0][i] = p[i];
		
	for(int k = 1 ; k < 20 ; k++) {
		for(int i = 0 ; i + (1 << k) <= n ; i++) {
			minv[k][i] = min(minv[k - 1][i], minv[k - 1][i + (1 << (k - 1))]);
			maxv[k][i] = max(maxv[k - 1][i], maxv[k - 1][i + (1 << (k - 1))]);
		}
	}
	
	int k = 0;
	for(int i = 1 ; i <= n ; i++) {
		if((1 << (k + 1)) <= i)
			k++;
		maxk[i] = k;
	}
	
	int begin = 0;
	while(begin < n && p[begin] == begin)
		begin++;
		
	if(begin == n)
		return 0;
		
	int end = n - 1;
	while(p[end] == end)
		end--;
	
	end = max(end, s);
	begin = min(begin, s);
	
	int a = extend(s, s).X, b = extend(s, s).Y;
	
	while(a > begin || b < end) {
		int lbook = a - 1;
		while(lbook >= 0 && I[lbook].Y < s)
			lbook--;

		if(lbook == -1) {
			res += 2 * dist_left(a, begin);
			res += 2 * dist_right(b, end);
			a = begin;
			b = end;
			continue;
		}
		
		int rbook = b + 1;
		while(I[rbook].X > s)
			rbook++;
			
		if(dist_left(a, lbook) < dist_right(b, rbook)) {
			res += 2 * dist_left(a, lbook);
		} else {
			res += 2 * dist_right(b, rbook);
		}
		
		ii r = extend(lbook, rbook);
		a = r.X;
		b = r.Y;
	}

	//~ for(int i = 0 ; i < n ; i++)
		//~ cout << I[i].X << " " << I[i].Y << endl;

	return res;
}

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	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	424 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	380 KB	Output is correct
18	Correct	2 ms	376 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	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	424 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	380 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	3 ms	632 KB	Output is correct
20	Correct	2 ms	504 KB	Output is correct
21	Correct	3 ms	504 KB	Output is correct
22	Correct	3 ms	632 KB	Output is correct
23	Correct	3 ms	632 KB	Output is correct
24	Correct	3 ms	632 KB	Output is correct
25	Correct	3 ms	632 KB	Output is correct
26	Correct	2 ms	504 KB	Output is correct
27	Correct	2 ms	632 KB	Output is correct
28	Correct	3 ms	632 KB	Output is correct
29	Correct	3 ms	632 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	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	424 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	380 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	3 ms	632 KB	Output is correct
20	Correct	2 ms	504 KB	Output is correct
21	Correct	3 ms	504 KB	Output is correct
22	Correct	3 ms	632 KB	Output is correct
23	Correct	3 ms	632 KB	Output is correct
24	Correct	3 ms	632 KB	Output is correct
25	Correct	3 ms	632 KB	Output is correct
26	Correct	2 ms	504 KB	Output is correct
27	Correct	2 ms	632 KB	Output is correct
28	Correct	3 ms	632 KB	Output is correct
29	Correct	3 ms	632 KB	Output is correct
30	Correct	385 ms	177956 KB	Output is correct
31	Correct	397 ms	178108 KB	Output is correct
32	Correct	339 ms	175936 KB	Output is correct
33	Correct	380 ms	176140 KB	Output is correct
34	Correct	379 ms	176000 KB	Output is correct
35	Correct	371 ms	175992 KB	Output is correct
36	Correct	345 ms	176120 KB	Output is correct
37	Correct	318 ms	176248 KB	Output is correct
38	Correct	316 ms	176120 KB	Output is correct
39	Correct	317 ms	176248 KB	Output is correct
40	Correct	330 ms	176408 KB	Output is correct
41	Correct	359 ms	176900 KB	Output is correct
42	Correct	351 ms	177072 KB	Output is correct
43	Correct	356 ms	176232 KB	Output is correct

Subtask #4
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	636 KB	Output is correct
2	Correct	3 ms	632 KB	Output is correct
3	Correct	2 ms	636 KB	Output is correct
4	Correct	2 ms	632 KB	Output is correct
5	Correct	3 ms	632 KB	Output is correct
6	Correct	3 ms	632 KB	Output is correct
7	Correct	2 ms	504 KB	Output is correct
8	Correct	2 ms	508 KB	Output is correct
9	Correct	2 ms	632 KB	Output is correct
10	Correct	2 ms	632 KB	Output is correct
11	Correct	3 ms	632 KB	Output is correct
12	Correct	3 ms	632 KB	Output is correct
13	Correct	3 ms	636 KB	Output is correct
14	Correct	2 ms	632 KB	Output is correct
15	Correct	2 ms	632 KB	Output is correct
16	Correct	2 ms	632 KB	Output is correct
17	Correct	3 ms	760 KB	Output is correct
18	Correct	3 ms	632 KB	Output is correct
19	Correct	2 ms	632 KB	Output is correct
20	Correct	3 ms	760 KB	Output is correct

Subtask #5
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	424 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	380 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	3 ms	632 KB	Output is correct
20	Correct	2 ms	504 KB	Output is correct
21	Correct	3 ms	504 KB	Output is correct
22	Correct	3 ms	632 KB	Output is correct
23	Correct	3 ms	632 KB	Output is correct
24	Correct	3 ms	632 KB	Output is correct
25	Correct	3 ms	632 KB	Output is correct
26	Correct	2 ms	504 KB	Output is correct
27	Correct	2 ms	632 KB	Output is correct
28	Correct	3 ms	632 KB	Output is correct
29	Correct	3 ms	632 KB	Output is correct
30	Correct	385 ms	177956 KB	Output is correct
31	Correct	397 ms	178108 KB	Output is correct
32	Correct	339 ms	175936 KB	Output is correct
33	Correct	380 ms	176140 KB	Output is correct
34	Correct	379 ms	176000 KB	Output is correct
35	Correct	371 ms	175992 KB	Output is correct
36	Correct	345 ms	176120 KB	Output is correct
37	Correct	318 ms	176248 KB	Output is correct
38	Correct	316 ms	176120 KB	Output is correct
39	Correct	317 ms	176248 KB	Output is correct
40	Correct	330 ms	176408 KB	Output is correct
41	Correct	359 ms	176900 KB	Output is correct
42	Correct	351 ms	177072 KB	Output is correct
43	Correct	356 ms	176232 KB	Output is correct
44	Correct	3 ms	636 KB	Output is correct
45	Correct	3 ms	632 KB	Output is correct
46	Correct	2 ms	636 KB	Output is correct
47	Correct	2 ms	632 KB	Output is correct
48	Correct	3 ms	632 KB	Output is correct
49	Correct	3 ms	632 KB	Output is correct
50	Correct	2 ms	504 KB	Output is correct
51	Correct	2 ms	508 KB	Output is correct
52	Correct	2 ms	632 KB	Output is correct
53	Correct	2 ms	632 KB	Output is correct
54	Correct	3 ms	632 KB	Output is correct
55	Correct	3 ms	632 KB	Output is correct
56	Correct	3 ms	636 KB	Output is correct
57	Correct	2 ms	632 KB	Output is correct
58	Correct	2 ms	632 KB	Output is correct
59	Correct	2 ms	632 KB	Output is correct
60	Correct	3 ms	760 KB	Output is correct
61	Correct	3 ms	632 KB	Output is correct
62	Correct	2 ms	632 KB	Output is correct
63	Correct	3 ms	760 KB	Output is correct
64	Correct	346 ms	176044 KB	Output is correct
65	Correct	352 ms	176036 KB	Output is correct
66	Correct	320 ms	176064 KB	Output is correct
67	Correct	320 ms	176252 KB	Output is correct
68	Correct	33 ms	15480 KB	Output is correct
69	Correct	32 ms	15480 KB	Output is correct
70	Correct	32 ms	15552 KB	Output is correct
71	Correct	33 ms	15452 KB	Output is correct
72	Correct	33 ms	15480 KB	Output is correct
73	Correct	31 ms	15712 KB	Output is correct
74	Correct	366 ms	176060 KB	Output is correct
75	Correct	357 ms	176148 KB	Output is correct
76	Correct	355 ms	176028 KB	Output is correct
77	Correct	352 ms	175992 KB	Output is correct
78	Correct	350 ms	176124 KB	Output is correct
79	Correct	352 ms	176120 KB	Output is correct
80	Correct	341 ms	176124 KB	Output is correct
81	Correct	361 ms	176120 KB	Output is correct
82	Correct	365 ms	176248 KB	Output is correct
83	Correct	364 ms	176124 KB	Output is correct
84	Correct	364 ms	176084 KB	Output is correct
85	Correct	334 ms	176088 KB	Output is correct
86	Correct	359 ms	176068 KB	Output is correct
87	Correct	405 ms	176056 KB	Output is correct
88	Correct	379 ms	176072 KB	Output is correct
89	Correct	373 ms	176016 KB	Output is correct
90	Correct	321 ms	176068 KB	Output is correct
91	Correct	320 ms	176092 KB	Output is correct
92	Correct	323 ms	176176 KB	Output is correct

Submission #153279

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 10.0 / 10.0

Subtask #3 28.0 / 28.0

Subtask #4 20.0 / 20.0

Subtask #5 30.0 / 30.0

Subtask #1
12.0 / 12.0

Subtask #2
10.0 / 10.0

Subtask #3
28.0 / 28.0

Subtask #4
20.0 / 20.0

Subtask #5
30.0 / 30.0