Submission #390607

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
390607	2021-04-16T11:32:59 Z	Keshi	Ancient Books (IOI17_books)	C++17	50 / 100	465 ms	122040 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 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];
ll b[maxn];
ll mn[maxn], mx[maxn], mnp[maxn], mxp[maxn];
bool vis[maxn];
vector<ll> vec, g[maxn], gp[maxn], gg[maxn];
vector<pll> v2;

ll seg[maxn << 2];

void bld(ll id, ll s, ll e){
	if(e - s == 1){
		seg[id] = b[s];
		return;
	}
	ll mid = (s + e) >> 1;
	bld(lc, s, mid);
	bld(rc, mid, e);
	seg[id] = max(seg[lc], seg[rc]);
}
ll get(ll id, ll s, ll e, ll l, ll r){
	if(r <= s || e <= l) return 0;
	if(l <= s && e <= r) return seg[id];
	ll mid = (s + e) >> 1;
	return max(get(lc, s, mid, l, r), get(rc, mid, e, l, r));
}

void dfs(ll v){
	vis[v] = 1;
	for(ll u : g[v]){
		if(!vis[u]) dfs(u);
	}
	vec.pb(v);
}
void sfd(ll v){
	vis[v] = 1;
	c[v] = tt;
	mnp[tt] = min(mnp[tt], mn[v]);
	mxp[tt] = max(mxp[tt], mx[v]);
	for(ll u : gp[v]){
		if(!vis[u]) sfd(u);
	}
}

ll solve(ll v, ll s){
	if(mnp[v] > s || s > mxp[v]) return 0;
	ll x = -1;
	ll ans = 0;
	ll i = 0;
	for(ll u : gg[v]){
		if(mnp[u] <= s && s <= mxp[u]) x = i;
		ans += solve(u, s);
		i++;
	}
	if(x == -1) return ans;
	if(mnp[v] == -1){
		return ans + Sz(gg[v]) - 1;
	}
	return ans + max(0, min(x, Sz(gg[v]) - x - 1)) + 1;
}

long long minimum_walk(vector<int> p, int s){
	ll n = Sz(p);
	ll l = 0;
	while(l < n && p[l] == l) l++;
	ll r = n;
	while(r && p[r - 1] == r - 1) r--;
	l = min(l, s);
	r = max(r, s + 1);
	mn[0] = -1;
	mx[0] = n + 1;
	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{
				vis[v] = 1;
				mx[t] = max(mx[t], v);
				mn[t] = min(mn[t], v);
				v = p[v];
			}while(v != i);
			rr[mx[t]] = t;
			b[mn[t]] = mx[t];
			t++;
		}
	}
	bld(1, 0, 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];
		vis[i.S] = 0;
		while(true){
			ll x = get(1, 0, n, mnp[tt], mxp[tt] + 1);
			if(x > mxp[tt]) mxp[tt] = x;
			else break;
			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();
		gg[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	42 ms	70676 KB	Output is correct
2	Correct	42 ms	70792 KB	Output is correct
3	Correct	43 ms	70744 KB	Output is correct
4	Correct	42 ms	70684 KB	Output is correct
5	Correct	43 ms	70700 KB	Output is correct
6	Correct	42 ms	70800 KB	Output is correct
7	Correct	42 ms	70796 KB	Output is correct
8	Correct	43 ms	70800 KB	Output is correct
9	Correct	42 ms	70812 KB	Output is correct
10	Correct	42 ms	70724 KB	Output is correct
11	Correct	42 ms	70732 KB	Output is correct
12	Correct	44 ms	70800 KB	Output is correct
13	Correct	42 ms	70812 KB	Output is correct
14	Correct	41 ms	70724 KB	Output is correct
15	Correct	42 ms	70780 KB	Output is correct
16	Correct	43 ms	70724 KB	Output is correct
17	Correct	41 ms	70724 KB	Output is correct
18	Correct	44 ms	70784 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	42 ms	70676 KB	Output is correct
2	Correct	42 ms	70792 KB	Output is correct
3	Correct	43 ms	70744 KB	Output is correct
4	Correct	42 ms	70684 KB	Output is correct
5	Correct	43 ms	70700 KB	Output is correct
6	Correct	42 ms	70800 KB	Output is correct
7	Correct	42 ms	70796 KB	Output is correct
8	Correct	43 ms	70800 KB	Output is correct
9	Correct	42 ms	70812 KB	Output is correct
10	Correct	42 ms	70724 KB	Output is correct
11	Correct	42 ms	70732 KB	Output is correct
12	Correct	44 ms	70800 KB	Output is correct
13	Correct	42 ms	70812 KB	Output is correct
14	Correct	41 ms	70724 KB	Output is correct
15	Correct	42 ms	70780 KB	Output is correct
16	Correct	43 ms	70724 KB	Output is correct
17	Correct	41 ms	70724 KB	Output is correct
18	Correct	44 ms	70784 KB	Output is correct
19	Correct	43 ms	70784 KB	Output is correct
20	Correct	41 ms	70780 KB	Output is correct
21	Correct	43 ms	70796 KB	Output is correct
22	Correct	41 ms	70796 KB	Output is correct
23	Correct	41 ms	70744 KB	Output is correct
24	Correct	42 ms	70724 KB	Output is correct
25	Correct	42 ms	70820 KB	Output is correct
26	Correct	44 ms	70840 KB	Output is correct
27	Correct	42 ms	70724 KB	Output is correct
28	Correct	41 ms	70840 KB	Output is correct
29	Correct	42 ms	70868 KB	Output is correct

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	42 ms	70676 KB	Output is correct
2	Correct	42 ms	70792 KB	Output is correct
3	Correct	43 ms	70744 KB	Output is correct
4	Correct	42 ms	70684 KB	Output is correct
5	Correct	43 ms	70700 KB	Output is correct
6	Correct	42 ms	70800 KB	Output is correct
7	Correct	42 ms	70796 KB	Output is correct
8	Correct	43 ms	70800 KB	Output is correct
9	Correct	42 ms	70812 KB	Output is correct
10	Correct	42 ms	70724 KB	Output is correct
11	Correct	42 ms	70732 KB	Output is correct
12	Correct	44 ms	70800 KB	Output is correct
13	Correct	42 ms	70812 KB	Output is correct
14	Correct	41 ms	70724 KB	Output is correct
15	Correct	42 ms	70780 KB	Output is correct
16	Correct	43 ms	70724 KB	Output is correct
17	Correct	41 ms	70724 KB	Output is correct
18	Correct	44 ms	70784 KB	Output is correct
19	Correct	43 ms	70784 KB	Output is correct
20	Correct	41 ms	70780 KB	Output is correct
21	Correct	43 ms	70796 KB	Output is correct
22	Correct	41 ms	70796 KB	Output is correct
23	Correct	41 ms	70744 KB	Output is correct
24	Correct	42 ms	70724 KB	Output is correct
25	Correct	42 ms	70820 KB	Output is correct
26	Correct	44 ms	70840 KB	Output is correct
27	Correct	42 ms	70724 KB	Output is correct
28	Correct	41 ms	70840 KB	Output is correct
29	Correct	42 ms	70868 KB	Output is correct
30	Correct	259 ms	87848 KB	Output is correct
31	Correct	196 ms	87828 KB	Output is correct
32	Correct	179 ms	86744 KB	Output is correct
33	Correct	396 ms	118552 KB	Output is correct
34	Correct	397 ms	118396 KB	Output is correct
35	Correct	355 ms	112276 KB	Output is correct
36	Correct	271 ms	104628 KB	Output is correct
37	Correct	189 ms	96888 KB	Output is correct
38	Correct	193 ms	94804 KB	Output is correct
39	Correct	186 ms	94276 KB	Output is correct
40	Correct	178 ms	89924 KB	Output is correct
41	Correct	187 ms	88004 KB	Output is correct
42	Correct	191 ms	88368 KB	Output is correct
43	Correct	465 ms	122040 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	42 ms	70832 KB	3rd lines differ - on the 1st token, expected: '3304', found: '3306'
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	42 ms	70676 KB	Output is correct
2	Correct	42 ms	70792 KB	Output is correct
3	Correct	43 ms	70744 KB	Output is correct
4	Correct	42 ms	70684 KB	Output is correct
5	Correct	43 ms	70700 KB	Output is correct
6	Correct	42 ms	70800 KB	Output is correct
7	Correct	42 ms	70796 KB	Output is correct
8	Correct	43 ms	70800 KB	Output is correct
9	Correct	42 ms	70812 KB	Output is correct
10	Correct	42 ms	70724 KB	Output is correct
11	Correct	42 ms	70732 KB	Output is correct
12	Correct	44 ms	70800 KB	Output is correct
13	Correct	42 ms	70812 KB	Output is correct
14	Correct	41 ms	70724 KB	Output is correct
15	Correct	42 ms	70780 KB	Output is correct
16	Correct	43 ms	70724 KB	Output is correct
17	Correct	41 ms	70724 KB	Output is correct
18	Correct	44 ms	70784 KB	Output is correct
19	Correct	43 ms	70784 KB	Output is correct
20	Correct	41 ms	70780 KB	Output is correct
21	Correct	43 ms	70796 KB	Output is correct
22	Correct	41 ms	70796 KB	Output is correct
23	Correct	41 ms	70744 KB	Output is correct
24	Correct	42 ms	70724 KB	Output is correct
25	Correct	42 ms	70820 KB	Output is correct
26	Correct	44 ms	70840 KB	Output is correct
27	Correct	42 ms	70724 KB	Output is correct
28	Correct	41 ms	70840 KB	Output is correct
29	Correct	42 ms	70868 KB	Output is correct
30	Correct	259 ms	87848 KB	Output is correct
31	Correct	196 ms	87828 KB	Output is correct
32	Correct	179 ms	86744 KB	Output is correct
33	Correct	396 ms	118552 KB	Output is correct
34	Correct	397 ms	118396 KB	Output is correct
35	Correct	355 ms	112276 KB	Output is correct
36	Correct	271 ms	104628 KB	Output is correct
37	Correct	189 ms	96888 KB	Output is correct
38	Correct	193 ms	94804 KB	Output is correct
39	Correct	186 ms	94276 KB	Output is correct
40	Correct	178 ms	89924 KB	Output is correct
41	Correct	187 ms	88004 KB	Output is correct
42	Correct	191 ms	88368 KB	Output is correct
43	Correct	465 ms	122040 KB	Output is correct
44	Incorrect	42 ms	70832 KB	3rd lines differ - on the 1st token, expected: '3304', found: '3306'
45	Halted	0 ms	0 KB	-

Submission #390607

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 10.0 / 10.0

Subtask #3 28.0 / 28.0

Subtask #4 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
0 / 20.0

Subtask #5
0 / 30.0