Submission #935136

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
935136	2024-02-28T17:41:37 Z	Lobo	Ancient Books (IOI17_books)	C++17	70 / 100	2000 ms	347704 KB

books

#include "books.h"
#include<bits/stdc++.h>
using namespace std;
const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
const int maxn = 1e6+10;

int n;
int ds[maxn], dsz[maxn], dsl[maxn], dsr[maxn];

int find(int v) {
	if(v == ds[v]) return v;
	return ds[v] = find(ds[v]);
}

void join(int u, int v) {
	u = find(u);
	v = find(v);
	if(u == v) return;

	if(dsz[u] < dsz[v]) swap(u,v);
	dsz[u]+= dsz[v];
	dsl[u] = min(dsl[u],dsl[v]);
	dsr[u] = max(dsr[u],dsr[v]);
	ds[v] = u;
}

int L,R;
map<int,int> dp[maxn];
int sol(int l, int r) {
	if(dp[l].count(r)) return dp[l][r];
	if(l == L && r == R) return dp[l][r] = 0;

	dp[l][r] = inf;
	if(l > L) dp[l][r] = min(dp[l][r],2+sol(dsl[find(l-1)],max(r,dsr[find(l-1)])));
	if(r < R) dp[l][r] = min(dp[l][r],2+sol(min(l,dsl[find(r+1)]),dsr[find(r+1)]));
	return dp[l][r];
}

long long minimum_walk(vector<int32_t> p, int32_t s) {
	// return 0;

	n = p.size();

	for(int i = 0; i < n; i++) {
		ds[i] = i;
		dsz[i] = 1;
		dsl[i] = i;
		dsr[i] = i;
	}

	for(int i = 0; i < n; i++) {
		join(i,p[i]);
	}

	int itl = s;
	while(itl != n) {
		int itr = itl;
		int cur = itl;
		while(cur <= itr) {
			itr = max(itr,dsr[find(cur)]);
			cur++;
		}
		for(int i = itl; i < itr; i++) {
			join(i,i+1);
		}
		itl = itr+1;
	}

	int itr = s;
	while(itr >= 0) {
		int itl = itr;
		int cur = itr;
		while(cur >= itl) {
			itl = min(itl,dsl[find(cur)]);
			cur--;
		}
		for(int i = itl; i < itr; i++) {
			join(i,i+1);
		}
		itr = itl-1;
	}

	L = 0;
	R = n-1;
	while(L < s && dsz[find(L)] == 1) L++;
	while(R > s && dsz[find(R)] == 1) R--;

	// for(int i = R; i >= s; i--) {

	// }


	int ans = 0;
	for(int i = 0; i < n; i++) ans+= abs(p[i]-i);

	return ans+sol(dsl[find(s)],dsr[find(s)]);
}

Subtask #1

12.0 / 12.0

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

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	53852 KB	Output is correct
2	Correct	12 ms	53852 KB	Output is correct
3	Correct	13 ms	53852 KB	Output is correct
4	Correct	12 ms	53848 KB	Output is correct
5	Correct	11 ms	53852 KB	Output is correct
6	Correct	11 ms	53852 KB	Output is correct
7	Correct	11 ms	53852 KB	Output is correct
8	Correct	12 ms	53944 KB	Output is correct
9	Correct	12 ms	54108 KB	Output is correct
10	Correct	12 ms	53852 KB	Output is correct
11	Correct	13 ms	53852 KB	Output is correct
12	Correct	11 ms	53848 KB	Output is correct
13	Correct	11 ms	53848 KB	Output is correct
14	Correct	12 ms	53852 KB	Output is correct
15	Correct	11 ms	53852 KB	Output is correct
16	Correct	13 ms	53852 KB	Output is correct
17	Correct	14 ms	53852 KB	Output is correct
18	Correct	11 ms	53848 KB	Output is correct
19	Correct	11 ms	53852 KB	Output is correct
20	Correct	11 ms	54080 KB	Output is correct
21	Correct	12 ms	53852 KB	Output is correct
22	Correct	11 ms	54072 KB	Output is correct
23	Correct	12 ms	53852 KB	Output is correct
24	Correct	12 ms	54040 KB	Output is correct
25	Correct	12 ms	54028 KB	Output is correct
26	Correct	12 ms	53852 KB	Output is correct
27	Correct	11 ms	53852 KB	Output is correct
28	Correct	11 ms	53852 KB	Output is correct
29	Correct	11 ms	53968 KB	Output is correct

Subtask #3

28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	53852 KB	Output is correct
2	Correct	12 ms	53852 KB	Output is correct
3	Correct	13 ms	53852 KB	Output is correct
4	Correct	12 ms	53848 KB	Output is correct
5	Correct	11 ms	53852 KB	Output is correct
6	Correct	11 ms	53852 KB	Output is correct
7	Correct	11 ms	53852 KB	Output is correct
8	Correct	12 ms	53944 KB	Output is correct
9	Correct	12 ms	54108 KB	Output is correct
10	Correct	12 ms	53852 KB	Output is correct
11	Correct	13 ms	53852 KB	Output is correct
12	Correct	11 ms	53848 KB	Output is correct
13	Correct	11 ms	53848 KB	Output is correct
14	Correct	12 ms	53852 KB	Output is correct
15	Correct	11 ms	53852 KB	Output is correct
16	Correct	13 ms	53852 KB	Output is correct
17	Correct	14 ms	53852 KB	Output is correct
18	Correct	11 ms	53848 KB	Output is correct
19	Correct	11 ms	53852 KB	Output is correct
20	Correct	11 ms	54080 KB	Output is correct
21	Correct	12 ms	53852 KB	Output is correct
22	Correct	11 ms	54072 KB	Output is correct
23	Correct	12 ms	53852 KB	Output is correct
24	Correct	12 ms	54040 KB	Output is correct
25	Correct	12 ms	54028 KB	Output is correct
26	Correct	12 ms	53852 KB	Output is correct
27	Correct	11 ms	53852 KB	Output is correct
28	Correct	11 ms	53852 KB	Output is correct
29	Correct	11 ms	53968 KB	Output is correct
30	Correct	175 ms	86524 KB	Output is correct
31	Correct	178 ms	93052 KB	Output is correct
32	Correct	93 ms	93012 KB	Output is correct
33	Correct	525 ms	193336 KB	Output is correct
34	Correct	530 ms	193404 KB	Output is correct
35	Correct	396 ms	164436 KB	Output is correct
36	Correct	186 ms	114172 KB	Output is correct
37	Correct	119 ms	94544 KB	Output is correct
38	Correct	115 ms	93172 KB	Output is correct
39	Correct	118 ms	93168 KB	Output is correct
40	Correct	122 ms	93200 KB	Output is correct
41	Correct	141 ms	93424 KB	Output is correct
42	Correct	127 ms	93168 KB	Output is correct
43	Correct	137 ms	93264 KB	Output is correct

Subtask #4

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	44 ms	60500 KB	Output is correct
2	Correct	11 ms	53852 KB	Output is correct
3	Correct	21 ms	56412 KB	Output is correct
4	Correct	34 ms	60080 KB	Output is correct
5	Correct	37 ms	60244 KB	Output is correct
6	Correct	11 ms	53852 KB	Output is correct
7	Correct	12 ms	53852 KB	Output is correct
8	Correct	11 ms	53968 KB	Output is correct
9	Correct	11 ms	54104 KB	Output is correct
10	Correct	11 ms	53852 KB	Output is correct
11	Correct	14 ms	54364 KB	Output is correct
12	Correct	12 ms	54364 KB	Output is correct
13	Correct	12 ms	53880 KB	Output is correct
14	Correct	11 ms	53852 KB	Output is correct
15	Correct	11 ms	53920 KB	Output is correct
16	Correct	12 ms	53852 KB	Output is correct
17	Correct	13 ms	53852 KB	Output is correct
18	Correct	11 ms	54108 KB	Output is correct
19	Correct	12 ms	53888 KB	Output is correct
20	Correct	12 ms	53852 KB	Output is correct

Subtask #5

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	53852 KB	Output is correct
2	Correct	12 ms	53852 KB	Output is correct
3	Correct	13 ms	53852 KB	Output is correct
4	Correct	12 ms	53848 KB	Output is correct
5	Correct	11 ms	53852 KB	Output is correct
6	Correct	11 ms	53852 KB	Output is correct
7	Correct	11 ms	53852 KB	Output is correct
8	Correct	12 ms	53944 KB	Output is correct
9	Correct	12 ms	54108 KB	Output is correct
10	Correct	12 ms	53852 KB	Output is correct
11	Correct	13 ms	53852 KB	Output is correct
12	Correct	11 ms	53848 KB	Output is correct
13	Correct	11 ms	53848 KB	Output is correct
14	Correct	12 ms	53852 KB	Output is correct
15	Correct	11 ms	53852 KB	Output is correct
16	Correct	13 ms	53852 KB	Output is correct
17	Correct	14 ms	53852 KB	Output is correct
18	Correct	11 ms	53848 KB	Output is correct
19	Correct	11 ms	53852 KB	Output is correct
20	Correct	11 ms	54080 KB	Output is correct
21	Correct	12 ms	53852 KB	Output is correct
22	Correct	11 ms	54072 KB	Output is correct
23	Correct	12 ms	53852 KB	Output is correct
24	Correct	12 ms	54040 KB	Output is correct
25	Correct	12 ms	54028 KB	Output is correct
26	Correct	12 ms	53852 KB	Output is correct
27	Correct	11 ms	53852 KB	Output is correct
28	Correct	11 ms	53852 KB	Output is correct
29	Correct	11 ms	53968 KB	Output is correct
30	Correct	175 ms	86524 KB	Output is correct
31	Correct	178 ms	93052 KB	Output is correct
32	Correct	93 ms	93012 KB	Output is correct
33	Correct	525 ms	193336 KB	Output is correct
34	Correct	530 ms	193404 KB	Output is correct
35	Correct	396 ms	164436 KB	Output is correct
36	Correct	186 ms	114172 KB	Output is correct
37	Correct	119 ms	94544 KB	Output is correct
38	Correct	115 ms	93172 KB	Output is correct
39	Correct	118 ms	93168 KB	Output is correct
40	Correct	122 ms	93200 KB	Output is correct
41	Correct	141 ms	93424 KB	Output is correct
42	Correct	127 ms	93168 KB	Output is correct
43	Correct	137 ms	93264 KB	Output is correct
44	Correct	44 ms	60500 KB	Output is correct
45	Correct	11 ms	53852 KB	Output is correct
46	Correct	21 ms	56412 KB	Output is correct
47	Correct	34 ms	60080 KB	Output is correct
48	Correct	37 ms	60244 KB	Output is correct
49	Correct	11 ms	53852 KB	Output is correct
50	Correct	12 ms	53852 KB	Output is correct
51	Correct	11 ms	53968 KB	Output is correct
52	Correct	11 ms	54104 KB	Output is correct
53	Correct	11 ms	53852 KB	Output is correct
54	Correct	14 ms	54364 KB	Output is correct
55	Correct	12 ms	54364 KB	Output is correct
56	Correct	12 ms	53880 KB	Output is correct
57	Correct	11 ms	53852 KB	Output is correct
58	Correct	11 ms	53920 KB	Output is correct
59	Correct	12 ms	53852 KB	Output is correct
60	Correct	13 ms	53852 KB	Output is correct
61	Correct	11 ms	54108 KB	Output is correct
62	Correct	12 ms	53888 KB	Output is correct
63	Correct	12 ms	53852 KB	Output is correct
64	Correct	378 ms	126032 KB	Output is correct
65	Execution timed out	2065 ms	347704 KB	Time limit exceeded
66	Halted	0 ms	0 KB	-