Submission #1039130

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1039130	2024-07-30T13:24:30 Z	Soumya1	Ancient Books (IOI17_books)	C++17	50 / 100	113 ms	27104 KB

books

#include "books.h"
#include <bits/stdc++.h>
using namespace std;
long long minimum_walk(std::vector<int> p, int s) {
	long long ans = 0;
	int n = p.size();
	for (int i = 0; i < n; i++) {
		ans += abs(i - p[i]);
	}
	vector<bool> vis(n);
	vector<int> mn(n, n), mx(n);
	for (int i = 0; i < n; i++) {
		if (vis[i]) continue;
		int cur = i;
		vector<int> all;
		while (!vis[cur]) {
			all.push_back(cur);
			vis[cur] = true;
			mn[i] = min(mn[i], cur);
			mx[i] = max(mx[i], cur);
			cur = p[cur];
		}
		for (int j : all) mn[j] = mn[i], mx[j] = mx[i];
	}
	int L = mn[s], R = mx[s], l = s, r = s;
	auto simulate = [&]() {
		while (L < l || r < R) {
			if (L < l) {
				L = min(L, mn[l]);
				R = max(R, mx[l]);
				l--;
			} else {
				L = min(L, mn[r]);
				R = max(R, mx[r]);
				r++;
			}
		}
	};
	int lto = 0, rto = n - 1;
	for (int i = 0; i < n; i++) {
		if (p[i] == i) lto++;
		else break;
	}
	for (int i = n - 1; i >= 0; i--) {
		if (p[i] == i) rto--;
		else break;
	}
	lto = min(lto, s);
	rto = max(rto, s);
	simulate();
	while (true) {
		bool first = false;
		int right_cost = 0;
		int m = r;
		for (int i = r + 1; i <= rto; i++) {
			if (mn[i] < l) {
				right_cost++;
				first = true;
				break;
			}
			if (mn[i] > m) right_cost++;
			m = max(m, mx[i]); 
		}
		bool second = false;
		int left_cost = 0;
		m = l;
		for (int i = l - 1; i >= lto; i--) {
			if (mx[i] > r) {
				left_cost++;
				second = true;
				break;
			}
			if (mx[i] < m) left_cost++;
			m = min(m, mn[i]);
		}
		if (!first) {
			ans += 2 * (left_cost + right_cost);
			break;
		}
		if (left_cost < right_cost) {
			ans += 2 * left_cost;
			for (int i = l + 1; i <= rto; i++) {
				L = min(L, mn[i]), R = max(R, mx[i]);
				if (mn[i] < l) break;
			}
			simulate();
		} else {
			ans += 2 * right_cost;
			for (int i = r - 1; i >= lto; i--) {
				L = min(L, mn[i]), R = max(R, mx[i]);
				if (mx[i] > r) break;
			}
			simulate();
		}
	}
	return ans;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:64:8: warning: variable 'second' set but not used [-Wunused-but-set-variable]
   64 |   bool second = false;
      |        ^~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 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	344 KB	Output is correct
19	Correct	0 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	1 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	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	1 ms	344 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	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 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	344 KB	Output is correct
19	Correct	0 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	1 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	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	1 ms	344 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	113 ms	27104 KB	Output is correct
31	Correct	103 ms	25036 KB	Output is correct
32	Correct	85 ms	22864 KB	Output is correct
33	Correct	92 ms	22896 KB	Output is correct
34	Correct	97 ms	22864 KB	Output is correct
35	Correct	94 ms	22864 KB	Output is correct
36	Correct	90 ms	22868 KB	Output is correct
37	Correct	80 ms	22868 KB	Output is correct
38	Correct	82 ms	22884 KB	Output is correct
39	Correct	87 ms	22856 KB	Output is correct
40	Correct	72 ms	23192 KB	Output is correct
41	Correct	94 ms	25880 KB	Output is correct
42	Correct	100 ms	24464 KB	Output is correct
43	Correct	94 ms	22868 KB	Output is correct

Subtask #4
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Incorrect	0 ms	344 KB	3rd lines differ - on the 1st token, expected: '5920', found: '5922'
4	Halted	0 ms	0 KB	-

Subtask #5
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 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	344 KB	Output is correct
19	Correct	0 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	1 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	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	1 ms	344 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	113 ms	27104 KB	Output is correct
31	Correct	103 ms	25036 KB	Output is correct
32	Correct	85 ms	22864 KB	Output is correct
33	Correct	92 ms	22896 KB	Output is correct
34	Correct	97 ms	22864 KB	Output is correct
35	Correct	94 ms	22864 KB	Output is correct
36	Correct	90 ms	22868 KB	Output is correct
37	Correct	80 ms	22868 KB	Output is correct
38	Correct	82 ms	22884 KB	Output is correct
39	Correct	87 ms	22856 KB	Output is correct
40	Correct	72 ms	23192 KB	Output is correct
41	Correct	94 ms	25880 KB	Output is correct
42	Correct	100 ms	24464 KB	Output is correct
43	Correct	94 ms	22868 KB	Output is correct
44	Correct	1 ms	348 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Incorrect	0 ms	344 KB	3rd lines differ - on the 1st token, expected: '5920', found: '5922'
47	Halted	0 ms	0 KB	-

Submission #1039130

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