답안 #1082958

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1082958	2024-09-02T08:41:03 Z	happypotato	고대 책들 (IOI17_books)	C++17	50 / 100	133 ms	38848 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 minimum_walk(vector<int> p, int 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);
		}
		for (int i = 0; i < (int)(seq.size()); i++) {
			ans += abs(seq[(i + 1) % (int)(seq.size())] - seq[i]);
			range[seq[i]] = get;
			p[seq[i]] = -1;
		}
	}
	vector<int> bruh = {-1};
	int maxi = 0;
	for (int i = 0; i < n; i++) {
		maxi = max(maxi, ori[i]);
		if (maxi == i) bruh.pb(i);
	}
	deque<pii> dq;
	for (int i = 1; i < (int)(bruh.size()); i++) {
		dq.push_back({bruh[i - 1] + 1, bruh[i]});
	}
	while (!dq.empty()) {
		pii cur = dq.front();
		if (cur.ff <= s && s <= cur.ss) break;
		if (cur.ff < cur.ss) break;
		dq.pop_front();
	}
	while (!dq.empty()) {
		pii cur = dq.back();
		if (cur.ff <= s && s <= cur.ss) break;
		if (cur.ff < cur.ss) break;
		dq.pop_back();
	}
	ans += ((int)(dq.size()) - 1) * 2;
	if (s == 0) return ans;

	pii tar;
	while (!dq.empty()) {
		pii cur = dq.front(); dq.pop_front();
		if (cur.ff <= s && s <= cur.ss) {
			tar = cur; break;
		}
	}

	assert(n <= 1000);
	vector<vector<int>> dp(n);
	for (int i = 0; i < n; i++) dp[i].resize(n, 1e9);
	dp[s][s] = 0;
	queue<pii> q;
	q.push({s, s});
	while (!q.empty()) {
		pii cur = q.front(); q.pop();
		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;
				q.push(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;
				q.push(nrange);
			}
		}
	}
	ans += dp[tar.ff][tar.ss] * 2;
	return ans;
}

Subtask #1

12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	432 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 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	1 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	344 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

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	432 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 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	1 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	344 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	344 KB	Output is correct
20	Correct	1 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	0 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	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	436 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct

Subtask #3

28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	432 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 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	1 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	344 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	344 KB	Output is correct
20	Correct	1 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	0 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	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	436 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	118 ms	30916 KB	Output is correct
31	Correct	120 ms	28924 KB	Output is correct
32	Correct	104 ms	38848 KB	Output is correct
33	Correct	133 ms	34492 KB	Output is correct
34	Correct	114 ms	34236 KB	Output is correct
35	Correct	118 ms	32192 KB	Output is correct
36	Correct	98 ms	28236 KB	Output is correct
37	Correct	87 ms	26732 KB	Output is correct
38	Correct	91 ms	26704 KB	Output is correct
39	Correct	88 ms	26600 KB	Output is correct
40	Correct	90 ms	27024 KB	Output is correct
41	Correct	103 ms	29708 KB	Output is correct
42	Correct	102 ms	28292 KB	Output is correct
43	Correct	98 ms	26480 KB	Output is correct

Subtask #4

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	4 ms	4188 KB	3rd lines differ - on the 1st token, expected: '3304', found: '3312'
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	432 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 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	1 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	344 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	344 KB	Output is correct
20	Correct	1 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	0 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	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	436 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	118 ms	30916 KB	Output is correct
31	Correct	120 ms	28924 KB	Output is correct
32	Correct	104 ms	38848 KB	Output is correct
33	Correct	133 ms	34492 KB	Output is correct
34	Correct	114 ms	34236 KB	Output is correct
35	Correct	118 ms	32192 KB	Output is correct
36	Correct	98 ms	28236 KB	Output is correct
37	Correct	87 ms	26732 KB	Output is correct
38	Correct	91 ms	26704 KB	Output is correct
39	Correct	88 ms	26600 KB	Output is correct
40	Correct	90 ms	27024 KB	Output is correct
41	Correct	103 ms	29708 KB	Output is correct
42	Correct	102 ms	28292 KB	Output is correct
43	Correct	98 ms	26480 KB	Output is correct
44	Incorrect	4 ms	4188 KB	3rd lines differ - on the 1st token, expected: '3304', found: '3312'
45	Halted	0 ms	0 KB	-