Submission #1083004

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1083004	2024-09-02T09:46:40 Z	happypotato	Ancient Books (IOI17_books)	C++17	50 / 100	101 ms	23816 KB

books

#include "books.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ff first
#define ss second
#define pb push_back
long long st123(vector<int> p, int s) {
	vector<int> ori = p;
	int n = (int)(p.size());
	ll ans = 0;
	for (int i = 0; i < n; i++) {
		if (p[i] == -1 || p[i] == i) continue;
		int cur = i;
		vector<int> seq = {cur};
		while (p[cur] != i) {
			cur = p[cur];
			seq.pb(cur);
		}
		// cerr << i << ": ";
		// for (int x : seq) cerr << x << ' ';
		// cerr << endl;
		for (int i = 0; i < (int)(seq.size()); i++) {
			ans += abs(seq[(i + 1) % (int)(seq.size())] - seq[i]);
			p[seq[i]] = -1;
		}
	}
	vector<int> bruh;
	int maxi = 0;
	for (int i = 0; i < n; i++) {
		maxi = max(maxi, ori[i]);
		if (maxi == i) bruh.pb(i);
	}
	// for (int x : bruh) cerr << x << ' ';
	// cerr << endl;
	while (bruh.size() >= 2) {
		int x = bruh.size();
		if (bruh[x - 1] - bruh[x - 2] == 1) {
			bruh.pop_back();
		} else break;
	}
	ans += ((int)(bruh.size()) - 1) * 2;
	return ans;
}
long long minimum_walk(vector<int> p, int s) {
	if (s == 0) return st123(p, s);
	vector<int> ori = p;
	int n = (int)(p.size());
	ll ans = 0;
	vector<pii> range(n);
	for (int i = 0; i < n; i++) {
		if (p[i] == -1) continue;
		int cur = i;
		vector<int> seq = {cur};
		while (p[cur] != i) {
			cur = p[cur];
			seq.pb(cur);
		}
		pii get = {i, i};
		for (int x : seq) {
			get.ff = min(get.ff, x);
			get.ss = max(get.ss, x);
		}
		// cerr << "seq: ";
		// for (int x : seq) cerr << x << ' ';
		// cerr << " | " << get.ff << ' ' << get.ss << endl;
		for (int j = 0; j < (int)(seq.size()); j++) {
			ans += abs(seq[(j + 1) % (int)(seq.size())] - seq[j]);
			range[seq[j]] = get;
			p[seq[j]] = -1;
		}
	}
	// for (int i = 0; i < n; i++) {
	// 	cerr << i << ": " << range[i].ff << ' ' << range[i].ss << endl;
	// }

	vector<vector<int>> dp(n);
	for (int i = 0; i < n; i++) dp[i].resize(n, 1e9);
	deque<pii> dq;
	dp[range[s].ff][range[s].ss] = 0;
	dq.push_back(range[s]);
	while (!dq.empty()) {
		pii cur = dq.front(); dq.pop_front();
		if (cur.ff < n - 1) {
			pii nrange = {cur.ff + 1, cur.ss};
			if (dp[nrange.ff][nrange.ss] > dp[cur.ff][cur.ss]) {
				dp[nrange.ff][nrange.ss] = dp[cur.ff][cur.ss];
				dq.push_front(nrange);
			}
		}
		if (cur.ss > 0) {
			pii nrange = {cur.ff, cur.ss - 1};
			if (dp[nrange.ff][nrange.ss] > dp[cur.ff][cur.ss]) {
				dp[nrange.ff][nrange.ss] = dp[cur.ff][cur.ss];
				dq.push_front(nrange);
			}
		}
		if (cur.ff > 0) {
			pii nrange = {range[cur.ff - 1].ff, max(cur.ss, range[cur.ff - 1].ss)};
			if (dp[nrange.ff][nrange.ss] > dp[cur.ff][cur.ss] + 1) {
				dp[nrange.ff][nrange.ss] = dp[cur.ff][cur.ss] + 1;
				dq.push_back(nrange);
			}
		}
		if (cur.ss < n - 1) {
			pii nrange = {min(cur.ff, range[cur.ss + 1].ff), range[cur.ss + 1].ss};
			if (dp[nrange.ff][nrange.ss] > dp[cur.ff][cur.ss] + 1) {
				dp[nrange.ff][nrange.ss] = dp[cur.ff][cur.ss] + 1;
				dq.push_back(nrange);
			}
		}
	}
	int lb = 0, rb = n - 1;
	while (lb < n && ori[lb] == lb) lb++;
	if (lb == n) return 0;
	while (rb >= 0 && ori[rb] == rb) rb--;
	int take = 1e9;
	for (int i = 0; i <= lb; i++) {
		for (int j = rb; j < n; j++) take = min(take, dp[i][j]);
	}
	ans += take * 2;
	return ans;
}

Subtask #1

12.0 / 12.0

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

Subtask #2

10.0 / 10.0

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

Subtask #3

28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	101 ms	23792 KB	Output is correct
31	Correct	101 ms	21824 KB	Output is correct
32	Correct	81 ms	23816 KB	Output is correct
33	Correct	86 ms	23744 KB	Output is correct
34	Correct	86 ms	23744 KB	Output is correct
35	Correct	93 ms	21700 KB	Output is correct
36	Correct	86 ms	20680 KB	Output is correct
37	Correct	80 ms	19540 KB	Output is correct
38	Correct	82 ms	19692 KB	Output is correct
39	Correct	76 ms	19560 KB	Output is correct
40	Correct	83 ms	19996 KB	Output is correct
41	Correct	94 ms	22536 KB	Output is correct
42	Correct	100 ms	21276 KB	Output is correct
43	Correct	81 ms	16088 KB	Output is correct

Subtask #4

0 / 20.0

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

Subtask #5

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	101 ms	23792 KB	Output is correct
31	Correct	101 ms	21824 KB	Output is correct
32	Correct	81 ms	23816 KB	Output is correct
33	Correct	86 ms	23744 KB	Output is correct
34	Correct	86 ms	23744 KB	Output is correct
35	Correct	93 ms	21700 KB	Output is correct
36	Correct	86 ms	20680 KB	Output is correct
37	Correct	80 ms	19540 KB	Output is correct
38	Correct	82 ms	19692 KB	Output is correct
39	Correct	76 ms	19560 KB	Output is correct
40	Correct	83 ms	19996 KB	Output is correct
41	Correct	94 ms	22536 KB	Output is correct
42	Correct	100 ms	21276 KB	Output is correct
43	Correct	81 ms	16088 KB	Output is correct
44	Incorrect	18 ms	7260 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2746'
45	Halted	0 ms	0 KB	-