답안 #782421

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
782421	2023-07-14T00:18:02 Z	GusterGoose27	고대 책들 (IOI17_books)	C++17	50 / 100	120 ms	12160 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);
	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 || i == s) intervals.push_back(pii(l, r));
	}
	sort(intervals.begin(), intervals.end()); // they are probably already sorted
	int curl = intervals[0].first;
	int curr = intervals[0].second;
	for (int i = 1; i < intervals.size(); i++) {
		assert(curr != intervals[i].first);
		if (curr > intervals[i].first) {
			curr = max(curr, intervals[i].second);
			continue;
		}
		ans += 2*(intervals[i].first-curr);
		curl = intervals[i].first;
		curr = intervals[i].second;
	}
	return ans;
}

Compilation message

books.cpp: In function 'll minimum_walk(std::vector<int>, int)':
books.cpp:38: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]
   38 |  for (int i = 1; i < intervals.size(); i++) {
      |                  ~~^~~~~~~~~~~~~~~~~~
books.cpp:36:6: warning: variable 'curl' set but not used [-Wunused-but-set-variable]
   36 |  int curl = intervals[0].first;
      |      ^~~~

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	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 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	1 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	0 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	0 ms	212 KB	Output is correct
7	Correct	0 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	1 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	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	308 KB	Output is correct
25	Correct	1 ms	308 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	308 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	304 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	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 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	1 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	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	308 KB	Output is correct
25	Correct	1 ms	308 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	308 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	304 KB	Output is correct
30	Correct	95 ms	9952 KB	Output is correct
31	Correct	97 ms	9920 KB	Output is correct
32	Correct	82 ms	9876 KB	Output is correct
33	Correct	85 ms	11760 KB	Output is correct
34	Correct	86 ms	11844 KB	Output is correct
35	Correct	89 ms	11728 KB	Output is correct
36	Correct	86 ms	11996 KB	Output is correct
37	Correct	81 ms	10328 KB	Output is correct
38	Correct	82 ms	10040 KB	Output is correct
39	Correct	79 ms	10096 KB	Output is correct
40	Correct	82 ms	9996 KB	Output is correct
41	Correct	120 ms	9900 KB	Output is correct
42	Correct	91 ms	9888 KB	Output is correct
43	Correct	88 ms	12160 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	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 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	1 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	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	308 KB	Output is correct
25	Correct	1 ms	308 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	308 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	304 KB	Output is correct
30	Correct	95 ms	9952 KB	Output is correct
31	Correct	97 ms	9920 KB	Output is correct
32	Correct	82 ms	9876 KB	Output is correct
33	Correct	85 ms	11760 KB	Output is correct
34	Correct	86 ms	11844 KB	Output is correct
35	Correct	89 ms	11728 KB	Output is correct
36	Correct	86 ms	11996 KB	Output is correct
37	Correct	81 ms	10328 KB	Output is correct
38	Correct	82 ms	10040 KB	Output is correct
39	Correct	79 ms	10096 KB	Output is correct
40	Correct	82 ms	9996 KB	Output is correct
41	Correct	120 ms	9900 KB	Output is correct
42	Correct	91 ms	9888 KB	Output is correct
43	Correct	88 ms	12160 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	-

답안 #782421

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