Submission #390674

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
390674	2021-04-16T13:36:26 Z	Keshi	Ancient Books (IOI17_books)	C++17	70 / 100	2000 ms	241476 KB

books

//In the name of God
#include <bits/stdc++.h>
#include "books.h"
using namespace std;

typedef int ll;
typedef pair<ll, ll> pll;

const ll maxn = 1e6 + 100;
const ll lg = 20;
const ll mod = 1e9 + 7;
const ll inf = 1e9;

#define pb push_back
#define Mp make_pair
#define F first
#define S second
#define Sz(x) ll((x).size())
#define all(x) (x).begin(), (x).end()
#define lc (id << 1)
#define rc (lc | 1)

ll a[maxn], t, tt, c[maxn], rr[maxn], e[maxn];
ll b[maxn];
ll mn[maxn], mx[maxn], mnp[maxn], mxp[maxn];
bool vis[maxn];
vector<ll> vec, g[maxn];
vector<pll> v2;

ll seg[lg][maxn];

void bld(ll n){
	for(ll i = 0; i < n; i++){
		seg[0][i] = b[i];
	}
	for(ll j = 1; j < lg; j++){
		for(ll i = 0; i + (1 << j) <= n; i++){
			seg[j][i] = max(seg[j - 1][i], seg[j - 1][i + (1 << (j - 1))]);
		}
	}
}
ll get(ll l, ll r){
	ll f = e[r - l];
	return max(seg[f][l], seg[f][r - (1 << f)]);
}

ll sz[maxn], cnt[maxn];
bool val[maxn];

ll solve(ll v, ll s){
	ll x = -1;
	ll ans = 0;
	for(ll i = 0; i < Sz(g[v]); i++){
		ll u = g[v][i];
		if(mnp[u] <= s && s <= mxp[u]) x = i;
		if(mnp[v] == 0){
//			cout << "$ " << u << "    " << mnp[u] << " " << mxp[u] << "\n";
		}
		ans += solve(u, s);
		sz[v] += sz[u];
	}
	val[v] = (sz[v] == mxp[v] - mnp[v] + 1);
	if(x == -1 || mnp[v] > s || s > mxp[v]) return 0;
//	if(!val[g[v][x]]) cout << v << " [" << mnp[v] << ", " << mxp[v] << "]    ----->   " << ans << "\n";
	if(!val[g[v][x]]) return ans;
	ll j = 0;
	ll y = inf;
	ll o = mnp[g[v][x]];
	for(ll i = x; i--;){
		ll u = g[v][i];
		if(!val[u]) continue;
		j++;
		if(mxp[u] + 1 != o){
			y = min(y, j);
			break;
		}
		o = mnp[u];
	}
	y = min(y, j + 1);
	j = 0;
	o = mxp[g[v][x]];
	for(ll i = x + 1; i < Sz(g[v]); i++){
		ll u = g[v][i];
		if(!val[u]) continue;
		j++;
		if(mnp[u] != o + 1){
			y = min(y, j);
			break;
		}
		o = mxp[u];
	}
	y = min(y, j + 1);
//	cout << "# " << v << " [" << mnp[v] << ", " << mxp[v] << "]    ----->   ";
	if(mnp[v] == -1){
//		cout << ans + Sz(g[v]) - 1 << "\n";
		return ans + Sz(g[v]) - 1;
	}
//	cout << ans + y << "\n";
	return ans + y;
}

long long minimum_walk(vector<int> p, int s){
	for(ll i = 2; i < maxn; i++){
		e[i] = e[i / 2] + 1;
	}
	ll n = Sz(p);
	v2.reserve(n);
	vec.reserve(n);
	for(ll i = 0; i < n; i++){
		g[i].reserve(20);
	}
	ll l = 0;
	while(l < n && p[l] == l) l++;
	ll r = n;
	while(r && p[r - 1] == r - 1) r--;
	if(r <= l) return 0;
	l = min(l, s);
	r = max(r, s + 1);
	mn[0] = -1;
	mx[0] = n;
	t++;
	long long ans = 0;
	for(ll i = l; i < r; i++){
		ans += abs(p[i] - i);
		if(!vis[i]){
			ll v = i;
			mn[t] = inf;
			mx[t] = -inf;
			do{
				cout.flush();
				vis[v] = 1;
				mx[t] = max(mx[t], v);
				mn[t] = min(mn[t], v);
				cnt[t]++;
				v = p[v];
			}while(v != i);
			rr[mx[t]] = t;
			b[mn[t]] = mx[t];
			t++;
		}
	}
	bld(n);
	for(ll i = 0; i < t; i++){
		v2.pb(Mp(mn[i], i));
	}
	for(pll i : v2){
		if(!vis[i.S]) continue;
		mnp[tt] = i.F;
		mxp[tt] = mx[i.S];
		sz[tt] = cnt[i.S];
		vis[i.S] = 0;
		while(true){
			ll x = get(mnp[tt], mxp[tt] + 1);
			if(!vis[rr[x]] || x <= mxp[tt]) break;
			mxp[tt] = x;
			sz[tt] += cnt[rr[x]];
			vis[rr[x]] = 0;
		}
		tt++;
	}
	vec.clear();
	v2.clear();
	ll root = -1;
	for(ll i = 0; i < tt; i++){
		if(mnp[i] == -1) root = i;
		v2.pb(Mp(mnp[i], i));
	}
	sort(all(v2));
	for(pll i : v2){
		if(vec.empty()){
			vec.pb(i.S);
			continue;
		}
		while(mxp[vec.back()] < i.F) vec.pop_back();
		g[vec.back()].pb(i.S);
		vec.pb(i.S);
	}
	ll xx = solve(root, s);
	ans += 2 * xx;

	return ans;
}

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	27812 KB	Output is correct
2	Correct	19 ms	27724 KB	Output is correct
3	Correct	19 ms	27704 KB	Output is correct
4	Correct	18 ms	27724 KB	Output is correct
5	Correct	18 ms	27712 KB	Output is correct
6	Correct	18 ms	27724 KB	Output is correct
7	Correct	19 ms	27816 KB	Output is correct
8	Correct	19 ms	27728 KB	Output is correct
9	Correct	20 ms	27620 KB	Output is correct
10	Correct	19 ms	27724 KB	Output is correct
11	Correct	19 ms	27596 KB	Output is correct
12	Correct	18 ms	27788 KB	Output is correct
13	Correct	18 ms	27788 KB	Output is correct
14	Correct	18 ms	27724 KB	Output is correct
15	Correct	19 ms	27772 KB	Output is correct
16	Correct	19 ms	27812 KB	Output is correct
17	Correct	19 ms	27708 KB	Output is correct
18	Correct	18 ms	27792 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	27812 KB	Output is correct
2	Correct	19 ms	27724 KB	Output is correct
3	Correct	19 ms	27704 KB	Output is correct
4	Correct	18 ms	27724 KB	Output is correct
5	Correct	18 ms	27712 KB	Output is correct
6	Correct	18 ms	27724 KB	Output is correct
7	Correct	19 ms	27816 KB	Output is correct
8	Correct	19 ms	27728 KB	Output is correct
9	Correct	20 ms	27620 KB	Output is correct
10	Correct	19 ms	27724 KB	Output is correct
11	Correct	19 ms	27596 KB	Output is correct
12	Correct	18 ms	27788 KB	Output is correct
13	Correct	18 ms	27788 KB	Output is correct
14	Correct	18 ms	27724 KB	Output is correct
15	Correct	19 ms	27772 KB	Output is correct
16	Correct	19 ms	27812 KB	Output is correct
17	Correct	19 ms	27708 KB	Output is correct
18	Correct	18 ms	27792 KB	Output is correct
19	Correct	18 ms	27992 KB	Output is correct
20	Correct	19 ms	28024 KB	Output is correct
21	Correct	18 ms	27832 KB	Output is correct
22	Correct	19 ms	27980 KB	Output is correct
23	Correct	18 ms	27980 KB	Output is correct
24	Correct	18 ms	27932 KB	Output is correct
25	Correct	19 ms	27956 KB	Output is correct
26	Correct	19 ms	27904 KB	Output is correct
27	Correct	20 ms	28072 KB	Output is correct
28	Correct	19 ms	27980 KB	Output is correct
29	Correct	19 ms	28036 KB	Output is correct

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	27812 KB	Output is correct
2	Correct	19 ms	27724 KB	Output is correct
3	Correct	19 ms	27704 KB	Output is correct
4	Correct	18 ms	27724 KB	Output is correct
5	Correct	18 ms	27712 KB	Output is correct
6	Correct	18 ms	27724 KB	Output is correct
7	Correct	19 ms	27816 KB	Output is correct
8	Correct	19 ms	27728 KB	Output is correct
9	Correct	20 ms	27620 KB	Output is correct
10	Correct	19 ms	27724 KB	Output is correct
11	Correct	19 ms	27596 KB	Output is correct
12	Correct	18 ms	27788 KB	Output is correct
13	Correct	18 ms	27788 KB	Output is correct
14	Correct	18 ms	27724 KB	Output is correct
15	Correct	19 ms	27772 KB	Output is correct
16	Correct	19 ms	27812 KB	Output is correct
17	Correct	19 ms	27708 KB	Output is correct
18	Correct	18 ms	27792 KB	Output is correct
19	Correct	18 ms	27992 KB	Output is correct
20	Correct	19 ms	28024 KB	Output is correct
21	Correct	18 ms	27832 KB	Output is correct
22	Correct	19 ms	27980 KB	Output is correct
23	Correct	18 ms	27980 KB	Output is correct
24	Correct	18 ms	27932 KB	Output is correct
25	Correct	19 ms	27956 KB	Output is correct
26	Correct	19 ms	27904 KB	Output is correct
27	Correct	20 ms	28072 KB	Output is correct
28	Correct	19 ms	27980 KB	Output is correct
29	Correct	19 ms	28036 KB	Output is correct
30	Correct	323 ms	204740 KB	Output is correct
31	Correct	340 ms	204752 KB	Output is correct
32	Correct	221 ms	129424 KB	Output is correct
33	Correct	390 ms	237364 KB	Output is correct
34	Correct	398 ms	237364 KB	Output is correct
35	Correct	378 ms	232352 KB	Output is correct
36	Correct	342 ms	221028 KB	Output is correct
37	Correct	324 ms	213560 KB	Output is correct
38	Correct	312 ms	211652 KB	Output is correct
39	Correct	317 ms	211124 KB	Output is correct
40	Correct	308 ms	207092 KB	Output is correct
41	Correct	312 ms	204980 KB	Output is correct
42	Correct	315 ms	205524 KB	Output is correct
43	Correct	413 ms	236588 KB	Output is correct

Subtask #4
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	27980 KB	Output is correct
2	Correct	19 ms	27948 KB	Output is correct
3	Correct	19 ms	28036 KB	Output is correct
4	Correct	19 ms	28040 KB	Output is correct
5	Correct	19 ms	28024 KB	Output is correct
6	Correct	18 ms	27980 KB	Output is correct
7	Correct	19 ms	27956 KB	Output is correct
8	Correct	19 ms	27940 KB	Output is correct
9	Correct	19 ms	28028 KB	Output is correct
10	Correct	19 ms	27724 KB	Output is correct
11	Correct	19 ms	27980 KB	Output is correct
12	Correct	19 ms	27980 KB	Output is correct
13	Correct	19 ms	27940 KB	Output is correct
14	Correct	19 ms	27984 KB	Output is correct
15	Correct	19 ms	27980 KB	Output is correct
16	Correct	19 ms	27968 KB	Output is correct
17	Correct	19 ms	28052 KB	Output is correct
18	Correct	18 ms	27952 KB	Output is correct
19	Correct	19 ms	28032 KB	Output is correct
20	Correct	19 ms	27980 KB	Output is correct

Subtask #5
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	27812 KB	Output is correct
2	Correct	19 ms	27724 KB	Output is correct
3	Correct	19 ms	27704 KB	Output is correct
4	Correct	18 ms	27724 KB	Output is correct
5	Correct	18 ms	27712 KB	Output is correct
6	Correct	18 ms	27724 KB	Output is correct
7	Correct	19 ms	27816 KB	Output is correct
8	Correct	19 ms	27728 KB	Output is correct
9	Correct	20 ms	27620 KB	Output is correct
10	Correct	19 ms	27724 KB	Output is correct
11	Correct	19 ms	27596 KB	Output is correct
12	Correct	18 ms	27788 KB	Output is correct
13	Correct	18 ms	27788 KB	Output is correct
14	Correct	18 ms	27724 KB	Output is correct
15	Correct	19 ms	27772 KB	Output is correct
16	Correct	19 ms	27812 KB	Output is correct
17	Correct	19 ms	27708 KB	Output is correct
18	Correct	18 ms	27792 KB	Output is correct
19	Correct	18 ms	27992 KB	Output is correct
20	Correct	19 ms	28024 KB	Output is correct
21	Correct	18 ms	27832 KB	Output is correct
22	Correct	19 ms	27980 KB	Output is correct
23	Correct	18 ms	27980 KB	Output is correct
24	Correct	18 ms	27932 KB	Output is correct
25	Correct	19 ms	27956 KB	Output is correct
26	Correct	19 ms	27904 KB	Output is correct
27	Correct	20 ms	28072 KB	Output is correct
28	Correct	19 ms	27980 KB	Output is correct
29	Correct	19 ms	28036 KB	Output is correct
30	Correct	323 ms	204740 KB	Output is correct
31	Correct	340 ms	204752 KB	Output is correct
32	Correct	221 ms	129424 KB	Output is correct
33	Correct	390 ms	237364 KB	Output is correct
34	Correct	398 ms	237364 KB	Output is correct
35	Correct	378 ms	232352 KB	Output is correct
36	Correct	342 ms	221028 KB	Output is correct
37	Correct	324 ms	213560 KB	Output is correct
38	Correct	312 ms	211652 KB	Output is correct
39	Correct	317 ms	211124 KB	Output is correct
40	Correct	308 ms	207092 KB	Output is correct
41	Correct	312 ms	204980 KB	Output is correct
42	Correct	315 ms	205524 KB	Output is correct
43	Correct	413 ms	236588 KB	Output is correct
44	Correct	18 ms	27980 KB	Output is correct
45	Correct	19 ms	27948 KB	Output is correct
46	Correct	19 ms	28036 KB	Output is correct
47	Correct	19 ms	28040 KB	Output is correct
48	Correct	19 ms	28024 KB	Output is correct
49	Correct	18 ms	27980 KB	Output is correct
50	Correct	19 ms	27956 KB	Output is correct
51	Correct	19 ms	27940 KB	Output is correct
52	Correct	19 ms	28028 KB	Output is correct
53	Correct	19 ms	27724 KB	Output is correct
54	Correct	19 ms	27980 KB	Output is correct
55	Correct	19 ms	27980 KB	Output is correct
56	Correct	19 ms	27940 KB	Output is correct
57	Correct	19 ms	27984 KB	Output is correct
58	Correct	19 ms	27980 KB	Output is correct
59	Correct	19 ms	27968 KB	Output is correct
60	Correct	19 ms	28052 KB	Output is correct
61	Correct	18 ms	27952 KB	Output is correct
62	Correct	19 ms	28032 KB	Output is correct
63	Correct	19 ms	27980 KB	Output is correct
64	Correct	406 ms	238276 KB	Output is correct
65	Execution timed out	2103 ms	241476 KB	Time limit exceeded
66	Halted	0 ms	0 KB	-

Submission #390674

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 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
0 / 30.0