Submission #391013

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
391013	2021-04-17T15:00:56 Z	alishahali1382	Ancient Books (IOI17_books)	C++14	100 / 100	226 ms	30660 KB

books

#include "books.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define debug(x) {cerr<<#x<<"="<<x<<"\n";}
#define debug2(x, y) {cerr<<#x<<", "<<#y<<" = "<<x<<", "<<y<<"\n";}
#define debugp(p) {cerr<<#p<<"={"<<p.first<<", "<<p.second<<"}\n";}
#define pb push_back
#define all(x) x.begin(), x.end()
 
const int inf=1000000100;
const int MAXN=1000010;
 
ll ans; // :)
int n, m, k, s, L, R;
int P[MAXN], ps[MAXN];
int mn[MAXN], mx[MAXN];
 
pii fix(int l, int r){
	int ll=min({l, mn[l], mn[r]}), rr=max({r, mx[l], mx[r]});
	while (ll<l || r<rr){
		if (ll<l){
			l--;
			ll=min(ll, mn[l]);
			rr=max(rr, mx[l]);
		}
		if (r<rr){
			r++;
			ll=min(ll, mn[r]);
			rr=max(rr, mx[r]);
		}
	}
	return {l, r};
}
 
ll minimum_walk(vector<int> _p, int s){
	n=_p.size();
	for (int i=0; i<n; i++){
		P[i]=_p[i];
		ans+=abs(i-P[i]);
		ps[min(i, P[i])]++;
		ps[max(i, P[i])]--;
	}
	if (!ans) return 0;
	L=0;
	R=n-1;
	while (P[L]==L) L++;
	while (P[R]==R) R--;
	for (int i=1; i<=R; i++) ps[i]+=ps[i-1];
	if (s<=L || R<=s){
		for (int i=L; i+1<=R; i++) if (!ps[i]) ans+=2;
		if (s<L) ans+=2*(L-s);
		if (R<s) ans+=2*(s-R);
		return ans;
	}
	for (int i=L; i<R; i++) if (!mx[i]){
		vector<int> vec;
		int v=i;
		while (1){
			vec.pb(v);
			v=P[v];
			if (v==i) break ;
		}
		mn[i]=mx[i]=i;
		for (int v:vec){
			mn[i]=min(mn[i], v);
			mx[i]=max(mx[i], v);
		}
		for (int v:vec){
			mn[v]=mn[i];
			mx[v]=mx[i];
		}
	}
	// debug2(mn[3], mx[3])
	pii p=fix(s, s);
	int tl=p.first, tr=p.second;
	for (int i=L; i<tl; i++) if (!ps[i]){
		ans+=2;
		L=i+1;
	}
	for (int i=R-1; i>=tr; i--) if (!ps[i]){
		ans+=2;
		R=i;
	}
	// debug(ans)
	while (tr-tl!=R-L){
		int l=tl, r=tr;
		int cl=0, cr=0;
		while (L<l){
			cl+=2;
			pii p=fix(--l, tr);
			l=p.first;
			if (tr<p.second) break ;
		}
		while (r<R){
			cr+=2;
			pii p=fix(tl, ++r);
			r=p.second;
			if (p.first<tl) break ;
		}
		ans+=min(cl, cr);
		tl=l;
		tr=r;
	}
	
	return ans;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	153 ms	15872 KB	Output is correct
31	Correct	158 ms	15864 KB	Output is correct
32	Correct	145 ms	15872 KB	Output is correct
33	Correct	151 ms	15860 KB	Output is correct
34	Correct	149 ms	15940 KB	Output is correct
35	Correct	162 ms	15956 KB	Output is correct
36	Correct	172 ms	15940 KB	Output is correct
37	Correct	146 ms	15868 KB	Output is correct
38	Correct	148 ms	15856 KB	Output is correct
39	Correct	145 ms	15876 KB	Output is correct
40	Correct	152 ms	15860 KB	Output is correct
41	Correct	153 ms	15944 KB	Output is correct
42	Correct	152 ms	15868 KB	Output is correct
43	Correct	146 ms	15860 KB	Output is correct

Subtask #4
20.0 / 20.0

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

Subtask #5
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	153 ms	15872 KB	Output is correct
31	Correct	158 ms	15864 KB	Output is correct
32	Correct	145 ms	15872 KB	Output is correct
33	Correct	151 ms	15860 KB	Output is correct
34	Correct	149 ms	15940 KB	Output is correct
35	Correct	162 ms	15956 KB	Output is correct
36	Correct	172 ms	15940 KB	Output is correct
37	Correct	146 ms	15868 KB	Output is correct
38	Correct	148 ms	15856 KB	Output is correct
39	Correct	145 ms	15876 KB	Output is correct
40	Correct	152 ms	15860 KB	Output is correct
41	Correct	153 ms	15944 KB	Output is correct
42	Correct	152 ms	15868 KB	Output is correct
43	Correct	146 ms	15860 KB	Output is correct
44	Correct	1 ms	332 KB	Output is correct
45	Correct	1 ms	332 KB	Output is correct
46	Correct	1 ms	332 KB	Output is correct
47	Correct	1 ms	332 KB	Output is correct
48	Correct	1 ms	332 KB	Output is correct
49	Correct	1 ms	332 KB	Output is correct
50	Correct	1 ms	332 KB	Output is correct
51	Correct	1 ms	332 KB	Output is correct
52	Correct	1 ms	332 KB	Output is correct
53	Correct	1 ms	332 KB	Output is correct
54	Correct	1 ms	332 KB	Output is correct
55	Correct	1 ms	332 KB	Output is correct
56	Correct	1 ms	332 KB	Output is correct
57	Correct	1 ms	332 KB	Output is correct
58	Correct	1 ms	332 KB	Output is correct
59	Correct	1 ms	332 KB	Output is correct
60	Correct	1 ms	332 KB	Output is correct
61	Correct	1 ms	332 KB	Output is correct
62	Correct	1 ms	332 KB	Output is correct
63	Correct	1 ms	332 KB	Output is correct
64	Correct	185 ms	23792 KB	Output is correct
65	Correct	184 ms	23728 KB	Output is correct
66	Correct	181 ms	23676 KB	Output is correct
67	Correct	174 ms	26436 KB	Output is correct
68	Correct	17 ms	3176 KB	Output is correct
69	Correct	18 ms	3240 KB	Output is correct
70	Correct	19 ms	3248 KB	Output is correct
71	Correct	18 ms	3148 KB	Output is correct
72	Correct	19 ms	3148 KB	Output is correct
73	Correct	17 ms	3280 KB	Output is correct
74	Correct	194 ms	26364 KB	Output is correct
75	Correct	192 ms	26296 KB	Output is correct
76	Correct	193 ms	26328 KB	Output is correct
77	Correct	189 ms	26112 KB	Output is correct
78	Correct	191 ms	26224 KB	Output is correct
79	Correct	193 ms	26180 KB	Output is correct
80	Correct	146 ms	18372 KB	Output is correct
81	Correct	191 ms	26096 KB	Output is correct
82	Correct	188 ms	30440 KB	Output is correct
83	Correct	195 ms	30432 KB	Output is correct
84	Correct	226 ms	30536 KB	Output is correct
85	Correct	182 ms	30444 KB	Output is correct
86	Correct	174 ms	30404 KB	Output is correct
87	Correct	206 ms	30504 KB	Output is correct
88	Correct	199 ms	30516 KB	Output is correct
89	Correct	199 ms	30432 KB	Output is correct
90	Correct	173 ms	30660 KB	Output is correct
91	Correct	172 ms	30436 KB	Output is correct
92	Correct	178 ms	30560 KB	Output is correct

Submission #391013

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