답안 #624655

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
624655	2022-08-08T15:03:06 Z	8e7	고대 책들 (IOI17_books)	C++17	100 / 100	138 ms	28108 KB

books

//Challenge: Accepted
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ...b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
#define ll long long
#define maxn 1000005
#define pii pair<int, int>
#define ff first
#define ss second
#include "books.h"

const int inf = 1e9;
pii ran[maxn], color[maxn];
long long minimum_walk(vector<int> p, int s) {
	ll ans = 0;
	int n = p.size();
	vector<int> a(n, 0);
	vector<bool> vis(n);
	{
		int c = 0;
		for (int i = 0;i < n;i++) {
			ans += abs(p[i] - i);
			if (!vis[i]) {
				c++;
				int cur = i;
				int mi = inf, ma = 0;
				do {
					mi = min(mi, cur);
					ma = max(ma, cur);
					a[cur] = c;
					vis[cur] = 1;
					cur = p[cur];
				} while (!vis[cur]);
				color[c] = {mi, ma};
			}
		}
		for (int i = 0;i < n;i++) ran[i] = color[a[i]];
	}

	int lb = 0, rb = n-1;
	while (lb < s && p[lb] == lb) lb++;
	while (rb > s && p[rb] == rb) rb--;
	auto expand = [&] (int l, int r, int nl, int nr, int type) { //0:none, 1:left, 2:right
		if (type == 1) {
			l = max(lb, l-1);
			nl = min(nl, ran[l].ff);	
			nr = max(nr, ran[l].ss);
		} else if(type == 2) {
			r = min(rb, r+1);
			nl = min(nl, ran[r].ff);	
			nr = max(nr, ran[r].ss);
		}
		while (nl < l || nr > r) {
			int tl = nl, tr = nr;
			while (tl < l) {
				l--;	
				nl = min(nl, ran[l].ff);
				nr = max(nr, ran[l].ss);
			}
			while (tr > r) {
				r++;
				nl = min(nl, ran[r].ff);
				nr = max(nr, ran[r].ss);
			}
		}
		return make_pair(l, r);
	};
	pii cur = {s, s};	
	cur = expand(s, s, ran[s].ff, ran[s].ss, 0);	
	while (cur.ff > lb || cur.ss < rb) {
		if (cur.ff == lb) {
			cur = expand(cur.ff, cur.ss, cur.ff, cur.ss, 2);
			ans+=2;
		} else if (cur.ss == rb){
			cur = expand(cur.ff, cur.ss, cur.ff, cur.ss, 1);
			ans+=2;
		} else {
			pii tmp = cur, lef;
			int sl = 0, sr = 0, vl, vr;
			while (tmp.ss <= cur.ss) {
				tmp = expand(tmp.ff, tmp.ss, tmp.ff, tmp.ss, 1);
				sl++;
				if (tmp.ff == lb) break;
			}
			vl = sl;
			if (tmp.ss <= cur.ss) vl = inf;
			lef = tmp;

			tmp = cur;	
			while (tmp.ff >= cur.ff) {
				tmp = expand(tmp.ff, tmp.ss, tmp.ff, tmp.ss, 2);
				sr++;
				if (tmp.ss == rb) break;
			}
			vr = sr;
			if (tmp.ff >= cur.ff) vr = inf;
			if (vl == inf && vr == inf) {
				ans += 2 * (sl + sr);
				break;
			} else if (vl < vr) {
				ans += 2 * vl;
				cur = lef;
			} else {
				ans += 2 * vr;
				cur = tmp;
			}
		}
	}
	return ans;
}

Subtask #1

12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	224 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	304 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	308 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	308 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	224 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	304 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	308 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	308 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	316 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	312 KB	Output is correct
27	Correct	1 ms	316 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct

Subtask #3

28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	224 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	304 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	308 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	308 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	316 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	312 KB	Output is correct
27	Correct	1 ms	316 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	137 ms	20476 KB	Output is correct
31	Correct	138 ms	20388 KB	Output is correct
32	Correct	99 ms	28108 KB	Output is correct
33	Correct	105 ms	25712 KB	Output is correct
34	Correct	107 ms	25720 KB	Output is correct
35	Correct	106 ms	24640 KB	Output is correct
36	Correct	103 ms	22368 KB	Output is correct
37	Correct	99 ms	20620 KB	Output is correct
38	Correct	95 ms	20336 KB	Output is correct
39	Correct	98 ms	20304 KB	Output is correct
40	Correct	101 ms	20420 KB	Output is correct
41	Correct	122 ms	20304 KB	Output is correct
42	Correct	134 ms	20256 KB	Output is correct
43	Correct	103 ms	26188 KB	Output is correct

Subtask #4

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	316 KB	Output is correct
7	Correct	1 ms	308 KB	Output is correct
8	Correct	1 ms	312 KB	Output is correct
9	Correct	1 ms	316 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	308 KB	Output is correct
12	Correct	1 ms	316 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	312 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	308 KB	Output is correct

Subtask #5

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	224 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	304 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	308 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	308 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	316 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	312 KB	Output is correct
27	Correct	1 ms	316 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	137 ms	20476 KB	Output is correct
31	Correct	138 ms	20388 KB	Output is correct
32	Correct	99 ms	28108 KB	Output is correct
33	Correct	105 ms	25712 KB	Output is correct
34	Correct	107 ms	25720 KB	Output is correct
35	Correct	106 ms	24640 KB	Output is correct
36	Correct	103 ms	22368 KB	Output is correct
37	Correct	99 ms	20620 KB	Output is correct
38	Correct	95 ms	20336 KB	Output is correct
39	Correct	98 ms	20304 KB	Output is correct
40	Correct	101 ms	20420 KB	Output is correct
41	Correct	122 ms	20304 KB	Output is correct
42	Correct	134 ms	20256 KB	Output is correct
43	Correct	103 ms	26188 KB	Output is correct
44	Correct	1 ms	212 KB	Output is correct
45	Correct	1 ms	340 KB	Output is correct
46	Correct	1 ms	340 KB	Output is correct
47	Correct	1 ms	340 KB	Output is correct
48	Correct	1 ms	340 KB	Output is correct
49	Correct	1 ms	316 KB	Output is correct
50	Correct	1 ms	308 KB	Output is correct
51	Correct	1 ms	312 KB	Output is correct
52	Correct	1 ms	316 KB	Output is correct
53	Correct	1 ms	340 KB	Output is correct
54	Correct	1 ms	308 KB	Output is correct
55	Correct	1 ms	316 KB	Output is correct
56	Correct	1 ms	340 KB	Output is correct
57	Correct	1 ms	312 KB	Output is correct
58	Correct	1 ms	340 KB	Output is correct
59	Correct	1 ms	340 KB	Output is correct
60	Correct	1 ms	340 KB	Output is correct
61	Correct	1 ms	340 KB	Output is correct
62	Correct	1 ms	212 KB	Output is correct
63	Correct	1 ms	308 KB	Output is correct
64	Correct	103 ms	25988 KB	Output is correct
65	Correct	106 ms	26604 KB	Output is correct
66	Correct	106 ms	20484 KB	Output is correct
67	Correct	104 ms	20416 KB	Output is correct
68	Correct	10 ms	2636 KB	Output is correct
69	Correct	12 ms	2492 KB	Output is correct
70	Correct	13 ms	2644 KB	Output is correct
71	Correct	15 ms	2892 KB	Output is correct
72	Correct	11 ms	3028 KB	Output is correct
73	Correct	10 ms	2388 KB	Output is correct
74	Correct	108 ms	25676 KB	Output is correct
75	Correct	113 ms	25768 KB	Output is correct
76	Correct	128 ms	25980 KB	Output is correct
77	Correct	126 ms	26172 KB	Output is correct
78	Correct	103 ms	25288 KB	Output is correct
79	Correct	110 ms	25224 KB	Output is correct
80	Correct	114 ms	28024 KB	Output is correct
81	Correct	109 ms	24144 KB	Output is correct
82	Correct	102 ms	24188 KB	Output is correct
83	Correct	108 ms	23324 KB	Output is correct
84	Correct	103 ms	22608 KB	Output is correct
85	Correct	108 ms	21532 KB	Output is correct
86	Correct	98 ms	20724 KB	Output is correct
87	Correct	110 ms	26844 KB	Output is correct
88	Correct	108 ms	25776 KB	Output is correct
89	Correct	111 ms	23940 KB	Output is correct
90	Correct	105 ms	20428 KB	Output is correct
91	Correct	113 ms	20476 KB	Output is correct
92	Correct	101 ms	20232 KB	Output is correct