oj.uz

Submission #283842

# Submission time Handle Problem Language Result Execution time Memory
283842 2020-08-26T07:56:05 Z balbit Ancient Books (IOI17_books) C++14
100 / 100
 339 ms 50428 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pii pair<int, int>
#define f first
#define s second

#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)((x).size())
#define pb push_back

#ifdef BALBIT
#define bug(...) cerr<<"#"<<__LINE__<<" "<<#__VA_ARGS__<<": ", _do(__VA_ARGS__)
template <typename T> void _do(T && x) {cerr<<x<<endl;}
template <typename T, typename ...S> void _do(T && x, S&&...y) {cerr<<x<<", "; _do(y...);}
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#endif
const int maxn = 1e6+5;
bool seen[maxn];
int R[maxn], L[maxn];
bool st[maxn];
bool dv[maxn];
int RR[maxn], LL[maxn];

int par[maxn];
int find(int x) {return x == par[x]? x : par[x] = find(par[x]);}
void mrg(int a, int b) {
	a = find(a); b = find(b);
	if (a == b) return;
	RR[a] = max(RR[a], RR[b]);
	LL[a] = min(LL[a], LL[b]);
	par[b] = a;
}
vector<int> here[maxn];
ll minimum_walk(vector<int> p, int s) {
	memset(seen, 0, sizeof seen);
	int n = SZ(p);
	ll re= 0;
	for (int i = 0; i<n; ++i) {
		// --p[i]; 
		re+= abs(i-p[i]);
	}

	// vector<pair<pii,int> > v;

	for (int i = 0; i<n; ++i) {
		if (!seen[i]) {
			st[i] = 1;
			seen[i] = 1;
			R[i] = L[i] = i;
			for (int x = p[i]; x != i; x = p[x]) seen[x] = 1, R[i] = max(R[i], x);
			for (int x = p[i]; x != i; x = p[x]) R[x] = R[i], L[x] = L[i];
			bug(i, L[i], R[i]);
			LL[i] = L[i]; RR[i] =R[i];
		}
	}
	int nmx = 0;
	re -= 2;

	for (int i = 0; i<n; ++i) {
		nmx = max(nmx, R[i]);
		// bug(L[i], R[i]);
		if (nmx <= i) {
			re += 2;
			dv[i] = 1;
		}

		// if (i == s && nmx > i) {
		// 	int ad = 0;
		// 	for (int j = 1; ; ++j) {
		// 		if (p[i+j] != i+j || p[i-j] != i-j) {
		// 			ad = j; break;
		// 		}
		// 	}
		// 	bug(ad);

		// }
	}
	// for (int i = 0; i<n; ++i) par[i] = i;
	// vector<pii> stk;
	// for (int i = 0; i<n; ++i) {
	// 	if (st[i]) {
	// 		while (!stk.empty() && i > stk.back().s) stk.pop_back();
	// 		int newl = i;
	// 		while (!stk.empty() && R[i] > stk.back().s) {
	// 			mrg(i, stk.back().f);
	// 			bug("merged", i, stk.back().f);
	// 			newl = stk.back().f;
	// 			stk.pop_back();
	// 		}
	// 		stk.pb({newl, R[i]});
	// 	}
	// }

	// for (int i = 0; i<n; ++i) {
	// 	if (st[i]) {
	// 		here[find(i)].pb(i);
	// 		for (int x = p[i]; x != i; x = p[x])
	// 			here[find(i)].pb(x), par[x] = find(i);
	// 	}
	// }

	{
		int l= L[s], r = R[s];
		int lat = l, rat = l;

		while (1) {
			if (lat > l) {
				--lat; l = min(l, L[lat]); r = max(r, R[lat]);
			}
			else if (rat < r) {
				++rat; l = min(l, L[rat]); r = max(r, R[rat]);
			}else{
				assert(lat == l && rat ==r);
				int rneed = 0, lneed = 0, rto = r, lto = l;
				for (int i = 1; ; ++i) {
					if (lat-i < 0) {
						goto fofoo;
					}
					if (lat-i < lto) {
						lneed ++; 
					}
					lto = min(lto, L[lat-i]);
					if (R[(lat-i)] > r) {
						bug("HII");
						// assert(L[lat-i] < l);
						// r = R[find(lat-i)]; l = L[find(lat-i)]; 
						break;
					}
				}
				for (int i =1; ; ++i) {
					if (rat+i>=n) {
						goto fofoo;
					}
					if (rat+i > rto) {
						rneed ++; 
					}
					rto = max(rto, R[rat+i]);
					if (L[(rat+i)] < l) {
						bug("HII");
						// assert(R[rat+i] > r);
						r = R[(rat+i)]; l = L[(rat+i)]; break;
					}
				}
				bug(lneed, rneed);
				re += min(lneed, rneed) * 2;
			}
		}

	}
	fofoo:
	for (int i = 0; i<n; ++i) {
		if (p[i] == i && i != s) re -= 2;
		else break;
	}
	for (int i = n-1; i>=0; --i) {
		if (p[i] == i && i != s) re -= 2;
		else break;
	}
	return re;
}

#ifdef BALBIT
signed main(){
	IOS();
	bug(minimum_walk({4,1,2,3,0},1));
	// bug(minimum_walk({3,2,1,0},0));
	// bug(minimum_walk({1,0,3,2},0));
}
#endif

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 24832 KB Output is correct
2 Correct 24 ms 24864 KB Output is correct
3 Correct 17 ms 24832 KB Output is correct
4 Correct 17 ms 24832 KB Output is correct
5 Correct 17 ms 24832 KB Output is correct
6 Correct 20 ms 24832 KB Output is correct
7 Correct 20 ms 24864 KB Output is correct
8 Correct 17 ms 24832 KB Output is correct
9 Correct 17 ms 24832 KB Output is correct
10 Correct 18 ms 24832 KB Output is correct
11 Correct 18 ms 24832 KB Output is correct
12 Correct 17 ms 24832 KB Output is correct
13 Correct 17 ms 24832 KB Output is correct
14 Correct 17 ms 24832 KB Output is correct
15 Correct 18 ms 24832 KB Output is correct
16 Correct 17 ms 24832 KB Output is correct
17 Correct 19 ms 24832 KB Output is correct
18 Correct 19 ms 24832 KB Output is correct
19 Correct 18 ms 24832 KB Output is correct
20 Correct 17 ms 24832 KB Output is correct
21 Correct 17 ms 24832 KB Output is correct
22 Correct 18 ms 24832 KB Output is correct
23 Correct 18 ms 24832 KB Output is correct
24 Correct 18 ms 24832 KB Output is correct
25 Correct 17 ms 24832 KB Output is correct
26 Correct 20 ms 24832 KB Output is correct
27 Correct 17 ms 24832 KB Output is correct
28 Correct 18 ms 24832 KB Output is correct
29 Correct 17 ms 24832 KB Output is correct
30 Correct 339 ms 40568 KB Output is correct
31 Correct 335 ms 40616 KB Output is correct
32 Correct 193 ms 50296 KB Output is correct
33 Correct 205 ms 50296 KB Output is correct
34 Correct 197 ms 50428 KB Output is correct
35 Correct 193 ms 50180 KB Output is correct
36 Correct 211 ms 50168 KB Output is correct
37 Correct 219 ms 50180 KB Output is correct
38 Correct 193 ms 49144 KB Output is correct
39 Correct 201 ms 48764 KB Output is correct
40 Correct 247 ms 43384 KB Output is correct
41 Correct 255 ms 40824 KB Output is correct
42 Correct 228 ms 41336 KB Output is correct
43 Correct 189 ms 49432 KB Output is correct

Subtask #4
20.0 / 20.0

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

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 24832 KB Output is correct
2 Correct 24 ms 24864 KB Output is correct
3 Correct 17 ms 24832 KB Output is correct
4 Correct 17 ms 24832 KB Output is correct
5 Correct 17 ms 24832 KB Output is correct
6 Correct 20 ms 24832 KB Output is correct
7 Correct 20 ms 24864 KB Output is correct
8 Correct 17 ms 24832 KB Output is correct
9 Correct 17 ms 24832 KB Output is correct
10 Correct 18 ms 24832 KB Output is correct
11 Correct 18 ms 24832 KB Output is correct
12 Correct 17 ms 24832 KB Output is correct
13 Correct 17 ms 24832 KB Output is correct
14 Correct 17 ms 24832 KB Output is correct
15 Correct 18 ms 24832 KB Output is correct
16 Correct 17 ms 24832 KB Output is correct
17 Correct 19 ms 24832 KB Output is correct
18 Correct 19 ms 24832 KB Output is correct
19 Correct 18 ms 24832 KB Output is correct
20 Correct 17 ms 24832 KB Output is correct
21 Correct 17 ms 24832 KB Output is correct
22 Correct 18 ms 24832 KB Output is correct
23 Correct 18 ms 24832 KB Output is correct
24 Correct 18 ms 24832 KB Output is correct
25 Correct 17 ms 24832 KB Output is correct
26 Correct 20 ms 24832 KB Output is correct
27 Correct 17 ms 24832 KB Output is correct
28 Correct 18 ms 24832 KB Output is correct
29 Correct 17 ms 24832 KB Output is correct
30 Correct 339 ms 40568 KB Output is correct
31 Correct 335 ms 40616 KB Output is correct
32 Correct 193 ms 50296 KB Output is correct
33 Correct 205 ms 50296 KB Output is correct
34 Correct 197 ms 50428 KB Output is correct
35 Correct 193 ms 50180 KB Output is correct
36 Correct 211 ms 50168 KB Output is correct
37 Correct 219 ms 50180 KB Output is correct
38 Correct 193 ms 49144 KB Output is correct
39 Correct 201 ms 48764 KB Output is correct
40 Correct 247 ms 43384 KB Output is correct
41 Correct 255 ms 40824 KB Output is correct
42 Correct 228 ms 41336 KB Output is correct
43 Correct 189 ms 49432 KB Output is correct
44 Correct 18 ms 24832 KB Output is correct
45 Correct 17 ms 24832 KB Output is correct
46 Correct 17 ms 24832 KB Output is correct
47 Correct 17 ms 24832 KB Output is correct
48 Correct 17 ms 24832 KB Output is correct
49 Correct 19 ms 24832 KB Output is correct
50 Correct 17 ms 24832 KB Output is correct
51 Correct 19 ms 24832 KB Output is correct
52 Correct 17 ms 24832 KB Output is correct
53 Correct 17 ms 24832 KB Output is correct
54 Correct 18 ms 24832 KB Output is correct
55 Correct 17 ms 24832 KB Output is correct
56 Correct 17 ms 24832 KB Output is correct
57 Correct 17 ms 24952 KB Output is correct
58 Correct 17 ms 24832 KB Output is correct
59 Correct 17 ms 24832 KB Output is correct
60 Correct 17 ms 24832 KB Output is correct
61 Correct 18 ms 24832 KB Output is correct
62 Correct 17 ms 24832 KB Output is correct
63 Correct 22 ms 24832 KB Output is correct
64 Correct 189 ms 49272 KB Output is correct
65 Correct 205 ms 49404 KB Output is correct
66 Correct 206 ms 49284 KB Output is correct
67 Correct 196 ms 49236 KB Output is correct
68 Correct 39 ms 27256 KB Output is correct
69 Correct 37 ms 27264 KB Output is correct
70 Correct 38 ms 27256 KB Output is correct
71 Correct 33 ms 27264 KB Output is correct
72 Correct 34 ms 27264 KB Output is correct
73 Correct 35 ms 26876 KB Output is correct
74 Correct 197 ms 50296 KB Output is correct
75 Correct 193 ms 50168 KB Output is correct
76 Correct 187 ms 49272 KB Output is correct
77 Correct 185 ms 49272 KB Output is correct
78 Correct 204 ms 49272 KB Output is correct
79 Correct 231 ms 49272 KB Output is correct
80 Correct 182 ms 50168 KB Output is correct
81 Correct 187 ms 46456 KB Output is correct
82 Correct 179 ms 46328 KB Output is correct
83 Correct 189 ms 49400 KB Output is correct
84 Correct 189 ms 49276 KB Output is correct
85 Correct 187 ms 49284 KB Output is correct
86 Correct 193 ms 49272 KB Output is correct
87 Correct 195 ms 49272 KB Output is correct
88 Correct 192 ms 49272 KB Output is correct
89 Correct 191 ms 49272 KB Output is correct
90 Correct 196 ms 49412 KB Output is correct
91 Correct 196 ms 49272 KB Output is correct
92 Correct 199 ms 44036 KB Output is correct