답안 #566604

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
566604	2022-05-22T12:56:47 Z	Temmie	고대 책들 (IOI17_books)	C++17	50 / 100	561 ms	70780 KB

books

//#include "public_c/public/cpp/books.h"
#include "books.h"

#include <bits/stdc++.h>

long long minimum_walk(std::vector <int> p, int s) {
	int n = p.size();
	std::vector <int> min(n, 1 << 30);
	std::vector <int> max(n, -1);
	std::vector <int> col(n, -1);
	for (int i = 0, cnt = 0; i < n; i++) {
		if (col[i] != -1) {
			continue;
		}
		int u = i;
		do {
			min[cnt] = std::min(min[cnt], u);
			max[cnt] = std::max(max[cnt], u);
			col[u] = cnt;
			u = p[u];
		} while (u != i);
		cnt++;
	}
	int l = 0, r = n - 1;
	while (l < s && l == p[l]) {
		l++;
	}
	while (r > s && r == p[r]) {
		r--;
	}
	std::set <int> st;
	for (int i = l; i <= r; i++) {
		st.insert(i);
	}
	int dr = 0;
	std::vector <int> dis(n, 1 << 30);
	std::deque <std::pair <int, int>> q;
	q.emplace_back(col[s], dis[col[s]] = 0);
	while (q.size()) {
		int v = q.front().first;
		int d = q.front().second;
		q.pop_front();
		if (d != dis[v]) {
			continue;
		}
		int mn = min[v];
		int mx = max[v];
		dr = s >= mn && s <= mx ? d : dr;
		while (true) {
			int u;
			auto it = st.lower_bound(mn);
			if (it == st.end() || (u = *it) > mx) {
				break;
			}
			st.erase(it);
			if (d < dis[col[u]]) {
				q.emplace_front(col[u], dis[col[u]] = d);
			}
		}
		if (v < r && d + 1 < dis[col[v + 1]]) {
			q.emplace_back(col[v + 1], dis[col[v + 1]] = d + 1);
		}
		if (v > l && d + 1 < dis[col[v - 1]]) {
			q.emplace_back(col[v - 1], dis[col[v - 1]] = d + 1);
		}
	}
	long long ans = 0;
	for (int i = l; i <= r; i++) {
		ans += abs(i - p[i]);
	}
	int cnt = 0;
	for (int i = l; i <= r; i++) {
		dr += !cnt && s < i;
		cnt += max[col[i]] == i;
		cnt -= min[col[i]] == i;
	}
	cnt = 0;
	for (int i = r; i >= l; i--) {
		dr += !cnt && s > i;
		cnt += max[col[i]] == i;
		cnt -= min[col[i]] == i;
	}
	return ans + dr * 2;
}

Subtask #1

12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct

Subtask #3

28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	561 ms	70636 KB	Output is correct
31	Correct	520 ms	70632 KB	Output is correct
32	Correct	111 ms	23664 KB	Output is correct
33	Correct	413 ms	70624 KB	Output is correct
34	Correct	364 ms	70772 KB	Output is correct
35	Correct	403 ms	70764 KB	Output is correct
36	Correct	387 ms	70732 KB	Output is correct
37	Correct	402 ms	70776 KB	Output is correct
38	Correct	371 ms	70716 KB	Output is correct
39	Correct	426 ms	70656 KB	Output is correct
40	Correct	381 ms	70740 KB	Output is correct
41	Correct	465 ms	70732 KB	Output is correct
42	Correct	384 ms	70780 KB	Output is correct
43	Correct	484 ms	70780 KB	Output is correct

Subtask #4

0 / 20.0

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

Subtask #5

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	561 ms	70636 KB	Output is correct
31	Correct	520 ms	70632 KB	Output is correct
32	Correct	111 ms	23664 KB	Output is correct
33	Correct	413 ms	70624 KB	Output is correct
34	Correct	364 ms	70772 KB	Output is correct
35	Correct	403 ms	70764 KB	Output is correct
36	Correct	387 ms	70732 KB	Output is correct
37	Correct	402 ms	70776 KB	Output is correct
38	Correct	371 ms	70716 KB	Output is correct
39	Correct	426 ms	70656 KB	Output is correct
40	Correct	381 ms	70740 KB	Output is correct
41	Correct	465 ms	70732 KB	Output is correct
42	Correct	384 ms	70780 KB	Output is correct
43	Correct	484 ms	70780 KB	Output is correct
44	Incorrect	1 ms	340 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2766'
45	Halted	0 ms	0 KB	-