답안 #105215

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
105215	2019-04-11T02:51:32 Z	bert30702	고대 책들 (IOI17_books)	C++17	22 / 100	302 ms	106852 KB

books

#include <bits/stdc++.h>
#include "books.h"
#define pii pair<int, int>
#define F first
#define S second
using namespace std;
const int MX = 1e6 + 100;
int boss[MX], sz[MX];
int Find(int u) {
	return boss[u] == u ? u : boss[u] = Find(boss[u]);
}
void merge(int a, int b) {
	a = Find(a), b = Find(b);
	if(a == b) return;
	boss[a] = b;
	sz[b] += sz[a];
}
priority_queue<int> pq[MX];
int G[MX];
long long minimum_walk(vector<int> p, int s) {
	int n = p.size();
	long long sum = 0, cnt = 0;
	for(int i = 0; i < n; i ++) {
		boss[i] = i;
		sz[i] = 1;
		cnt += (i != s and p[i] == i);
		G[p[i]] = max(G[p[i]], i);
		G[i]    = max(G[i], p[i]);
	}
	for(int i = 0; i < n; i ++) sum += abs(i - p[i]), merge(i, p[i]);
	vector<pair<int, pii> > E;
	for(int i = 0; i + 1 < n; i ++) {
		if(p[i] == i and i != s) continue;
		if(Find(i) == Find(i + 1)) continue;
		int ptr = i + 1, mx = i;
		while(ptr <= G[i] or (ptr != s and ptr < n and p[ptr] == ptr)) {
			if(ptr <= G[i]) mx = ptr;
			if(p[ptr] == ptr) cnt --;
			G[i] = max(G[i], G[ptr]);
			merge(i, ptr);
			ptr ++;
		}
		if(ptr < n) E.push_back({ptr - mx, {i, ptr}});
		i = ptr - 1;
	}
	sort(E.begin(), E.end());
	for(auto it: E) {
		if(Find(it.S.F) != Find(it.S.S)) {
			merge(it.S.F, it.S.S);
			sum += 2 * it.F;
		}
	}
	if(sum == 2121820) assert(p[0] != 0);
	assert(sz[Find(s)] + cnt == n);
	return sum;
}
//main () {
//	cout << minimum_walk({2, 3, 0, 1}, 0);
//}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	30 ms	31616 KB	Output is correct
2	Correct	36 ms	31612 KB	Output is correct
3	Correct	31 ms	31612 KB	Output is correct
4	Correct	32 ms	31616 KB	Output is correct
5	Correct	33 ms	31616 KB	Output is correct
6	Correct	32 ms	31616 KB	Output is correct
7	Correct	32 ms	31616 KB	Output is correct
8	Correct	36 ms	31616 KB	Output is correct
9	Correct	33 ms	31616 KB	Output is correct
10	Correct	31 ms	31608 KB	Output is correct
11	Correct	31 ms	31608 KB	Output is correct
12	Correct	31 ms	31616 KB	Output is correct
13	Correct	34 ms	31608 KB	Output is correct
14	Correct	29 ms	31616 KB	Output is correct
15	Correct	28 ms	31616 KB	Output is correct
16	Correct	31 ms	31616 KB	Output is correct
17	Correct	32 ms	31616 KB	Output is correct
18	Correct	32 ms	31616 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	30 ms	31616 KB	Output is correct
2	Correct	36 ms	31612 KB	Output is correct
3	Correct	31 ms	31612 KB	Output is correct
4	Correct	32 ms	31616 KB	Output is correct
5	Correct	33 ms	31616 KB	Output is correct
6	Correct	32 ms	31616 KB	Output is correct
7	Correct	32 ms	31616 KB	Output is correct
8	Correct	36 ms	31616 KB	Output is correct
9	Correct	33 ms	31616 KB	Output is correct
10	Correct	31 ms	31608 KB	Output is correct
11	Correct	31 ms	31608 KB	Output is correct
12	Correct	31 ms	31616 KB	Output is correct
13	Correct	34 ms	31608 KB	Output is correct
14	Correct	29 ms	31616 KB	Output is correct
15	Correct	28 ms	31616 KB	Output is correct
16	Correct	31 ms	31616 KB	Output is correct
17	Correct	32 ms	31616 KB	Output is correct
18	Correct	32 ms	31616 KB	Output is correct
19	Correct	33 ms	31708 KB	Output is correct
20	Correct	33 ms	31708 KB	Output is correct
21	Correct	32 ms	31608 KB	Output is correct
22	Correct	30 ms	31712 KB	Output is correct
23	Correct	37 ms	31608 KB	Output is correct
24	Correct	33 ms	31612 KB	Output is correct
25	Correct	35 ms	31608 KB	Output is correct
26	Correct	31 ms	31608 KB	Output is correct
27	Correct	30 ms	31608 KB	Output is correct
28	Correct	30 ms	31616 KB	Output is correct
29	Correct	29 ms	31616 KB	Output is correct

Subtask #3
0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	30 ms	31616 KB	Output is correct
2	Correct	36 ms	31612 KB	Output is correct
3	Correct	31 ms	31612 KB	Output is correct
4	Correct	32 ms	31616 KB	Output is correct
5	Correct	33 ms	31616 KB	Output is correct
6	Correct	32 ms	31616 KB	Output is correct
7	Correct	32 ms	31616 KB	Output is correct
8	Correct	36 ms	31616 KB	Output is correct
9	Correct	33 ms	31616 KB	Output is correct
10	Correct	31 ms	31608 KB	Output is correct
11	Correct	31 ms	31608 KB	Output is correct
12	Correct	31 ms	31616 KB	Output is correct
13	Correct	34 ms	31608 KB	Output is correct
14	Correct	29 ms	31616 KB	Output is correct
15	Correct	28 ms	31616 KB	Output is correct
16	Correct	31 ms	31616 KB	Output is correct
17	Correct	32 ms	31616 KB	Output is correct
18	Correct	32 ms	31616 KB	Output is correct
19	Correct	33 ms	31708 KB	Output is correct
20	Correct	33 ms	31708 KB	Output is correct
21	Correct	32 ms	31608 KB	Output is correct
22	Correct	30 ms	31712 KB	Output is correct
23	Correct	37 ms	31608 KB	Output is correct
24	Correct	33 ms	31612 KB	Output is correct
25	Correct	35 ms	31608 KB	Output is correct
26	Correct	31 ms	31608 KB	Output is correct
27	Correct	30 ms	31608 KB	Output is correct
28	Correct	30 ms	31616 KB	Output is correct
29	Correct	29 ms	31616 KB	Output is correct
30	Correct	263 ms	51192 KB	Output is correct
31	Correct	302 ms	51292 KB	Output is correct
32	Correct	200 ms	51296 KB	Output is correct
33	Runtime error	297 ms	106852 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
34	Halted	0 ms	0 KB	-

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	32 ms	31616 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	30 ms	31616 KB	Output is correct
2	Correct	36 ms	31612 KB	Output is correct
3	Correct	31 ms	31612 KB	Output is correct
4	Correct	32 ms	31616 KB	Output is correct
5	Correct	33 ms	31616 KB	Output is correct
6	Correct	32 ms	31616 KB	Output is correct
7	Correct	32 ms	31616 KB	Output is correct
8	Correct	36 ms	31616 KB	Output is correct
9	Correct	33 ms	31616 KB	Output is correct
10	Correct	31 ms	31608 KB	Output is correct
11	Correct	31 ms	31608 KB	Output is correct
12	Correct	31 ms	31616 KB	Output is correct
13	Correct	34 ms	31608 KB	Output is correct
14	Correct	29 ms	31616 KB	Output is correct
15	Correct	28 ms	31616 KB	Output is correct
16	Correct	31 ms	31616 KB	Output is correct
17	Correct	32 ms	31616 KB	Output is correct
18	Correct	32 ms	31616 KB	Output is correct
19	Correct	33 ms	31708 KB	Output is correct
20	Correct	33 ms	31708 KB	Output is correct
21	Correct	32 ms	31608 KB	Output is correct
22	Correct	30 ms	31712 KB	Output is correct
23	Correct	37 ms	31608 KB	Output is correct
24	Correct	33 ms	31612 KB	Output is correct
25	Correct	35 ms	31608 KB	Output is correct
26	Correct	31 ms	31608 KB	Output is correct
27	Correct	30 ms	31608 KB	Output is correct
28	Correct	30 ms	31616 KB	Output is correct
29	Correct	29 ms	31616 KB	Output is correct
30	Correct	263 ms	51192 KB	Output is correct
31	Correct	302 ms	51292 KB	Output is correct
32	Correct	200 ms	51296 KB	Output is correct
33	Runtime error	297 ms	106852 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
34	Halted	0 ms	0 KB	-

답안 #105215

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 10.0 / 10.0

Subtask #3 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
0 / 28.0

Subtask #4
0 / 20.0

Subtask #5
0 / 30.0