답안 #782463

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
782463	2023-07-14T02:22:38 Z	GusterGoose27	고대 책들 (IOI17_books)	C++17	50 / 100	117 ms	12060 KB

books

#include "books.h"

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e6+5;

typedef long long ll;
typedef pair<int, int> pii;
bool vis[MAXN];
int n;

int _abs(int v) {
	return v < 0 ? -v : v;
}

ll minimum_walk(vector<int> p, int s) {
	ll ans = 0;
	n = p.size();
	for (int i = 0; i < n; i++) ans += _abs(p[i]-i);
	if (ans == 0) return 0;
	vector<pii> intervals;
	for (int i = 0; i < n; i++) {
		if (vis[i]) continue;
		int cur = i;
		int l = i, r = i;
		do {
			l = min(l, cur);
			r = max(r, cur);
			vis[cur] = 1;
			cur = p[cur];
		} while (cur != i);
		if (r > l) intervals.push_back(pii(l, r));
	}
	sort(intervals.begin(), intervals.end()); // they are probably already sorted
	int curr = intervals[0].second;
	int mn = 0;
	if (intervals[0].first <= s && s <= intervals[0].second) mn = n;
	if (s < intervals[0].first) {
		mn = n;
		// assert(false);
	}
	for (int i = 1; i < intervals.size(); i++) {
		if (intervals[i].first <= s && s <= intervals[i].second) mn = n;
		assert(curr != intervals[i].first);
		if (curr > intervals[i].first) {
			curr = max(curr, intervals[i].second);
			continue;
		}
		ans += 2*(intervals[i].first-curr);
		curr = intervals[i].second;
	}
	if (s > curr) {
		mn = n;
		// assert(false);
	}
	// assert(mn == 0);
	for (int i = 0; i < n; i++)
		if (p[i] != i) mn = min(mn, _abs(i-s));
	return ans+2*mn;
}

Compilation message

books.cpp: In function 'll minimum_walk(std::vector<int>, int)':
books.cpp:44:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |  for (int i = 1; i < intervals.size(); i++) {
      |                  ~~^~~~~~~~~~~~~~~~~~

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	0 ms	212 KB	Output is correct
4	Correct	1 ms	308 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	1 ms	212 KB	Output is correct
11	Correct	1 ms	308 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	304 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	308 KB	Output is correct
18	Correct	1 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	0 ms	212 KB	Output is correct
4	Correct	1 ms	308 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	1 ms	212 KB	Output is correct
11	Correct	1 ms	308 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	304 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	308 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	304 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	300 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	308 KB	Output is correct
27	Correct	1 ms	304 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 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	0 ms	212 KB	Output is correct
4	Correct	1 ms	308 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	1 ms	212 KB	Output is correct
11	Correct	1 ms	308 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	304 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	308 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	304 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	300 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	308 KB	Output is correct
27	Correct	1 ms	304 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	92 ms	9804 KB	Output is correct
31	Correct	91 ms	9812 KB	Output is correct
32	Correct	75 ms	8884 KB	Output is correct
33	Correct	87 ms	11740 KB	Output is correct
34	Correct	100 ms	11736 KB	Output is correct
35	Correct	91 ms	11608 KB	Output is correct
36	Correct	105 ms	12060 KB	Output is correct
37	Correct	79 ms	10088 KB	Output is correct
38	Correct	81 ms	9952 KB	Output is correct
39	Correct	92 ms	10196 KB	Output is correct
40	Correct	80 ms	9800 KB	Output is correct
41	Correct	117 ms	9764 KB	Output is correct
42	Correct	97 ms	9880 KB	Output is correct
43	Correct	95 ms	11956 KB	Output is correct

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	212 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
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	0 ms	212 KB	Output is correct
4	Correct	1 ms	308 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	1 ms	212 KB	Output is correct
11	Correct	1 ms	308 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	304 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	308 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	304 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	300 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	308 KB	Output is correct
27	Correct	1 ms	304 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	92 ms	9804 KB	Output is correct
31	Correct	91 ms	9812 KB	Output is correct
32	Correct	75 ms	8884 KB	Output is correct
33	Correct	87 ms	11740 KB	Output is correct
34	Correct	100 ms	11736 KB	Output is correct
35	Correct	91 ms	11608 KB	Output is correct
36	Correct	105 ms	12060 KB	Output is correct
37	Correct	79 ms	10088 KB	Output is correct
38	Correct	81 ms	9952 KB	Output is correct
39	Correct	92 ms	10196 KB	Output is correct
40	Correct	80 ms	9800 KB	Output is correct
41	Correct	117 ms	9764 KB	Output is correct
42	Correct	97 ms	9880 KB	Output is correct
43	Correct	95 ms	11956 KB	Output is correct
44	Incorrect	1 ms	212 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-

답안 #782463

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