oj.uz

답안 #767937

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
767937 2023-06-27T09:54:29 Z SanguineChameleon Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 133 ms 18276 KB 
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;

const int inf = 1e9 + 20;
const int maxn = 2e5 + 20;
pair<int, int> events[maxn * 2];
pair<int, int> len[maxn * 2];
int sum[maxn * 2];
int par[maxn * 2];
int depth[maxn * 2];

int root(int u) {
	if (!par[u]) {
		return u;
	}
	else {
		return par[u] = root(par[u]);
	}
}

bool update(int u, int v) {
	int ru = root(u);
	int rv = root(v);
	if (ru == rv) {
		return false;
	}
	if (depth[ru] > depth[rv]) {
		swap(ru, rv);
	}
	par[ru] = rv;
	if (depth[ru] == depth[rv]) {
		depth[rv]++;
	}
	return true;
}

long long plan_roller_coaster(vector<int> s, vector<int> t) {
	s.push_back(inf);
	t.push_back(1);
	int n = s.size();
	for (int i = 1; i <= n; i++) {
		events[i * 2 - 1] = make_pair(s[i - 1], i);
		events[i * 2] = make_pair(t[i - 1], -i);
	}
	s.resize(n + 1);
	t.resize(n + 1);
	sort(events + 1, events + n * 2 + 1);
	int cnt = 0;
	for (int i = 1; i <= n * 2; i++) {
		if (events[i].first != events[i - 1].first) {
			len[cnt] = make_pair(events[i].first - events[i - 1].first, cnt);
			cnt++;
		}
		int id = events[i].second;
		if (id > 0) {
			s[id] = cnt;
		}
		else {
			t[-id] = cnt;
		}
	}
	for (int i = 1; i <= n; i++) {
		update(s[i], t[i]);
		sum[s[i]]++;
		sum[t[i]]--;
	}
	long long res = 0;
	for (int i = 1; i <= cnt - 1; i++) {
		sum[i] += sum[i - 1];
		if (sum[i] > 0) {
			res += 1LL * len[i].first * sum[i];
		}
		if (sum[i]) {
			update(i, i + 1);
		}
	}
	sort(len + 1, len + cnt);
	for (int i = 1; i <= cnt - 1; i++) {
		if (update(len[i].second, len[i].second + 1)) {
			res += len[i].first;
		}
	}
	return res;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB n = 2
2 Correct 1 ms 340 KB n = 2
3 Correct 1 ms 304 KB n = 2
4 Correct 1 ms 340 KB n = 2
5 Correct 1 ms 304 KB n = 2
6 Correct 1 ms 312 KB n = 2
7 Correct 1 ms 340 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 340 KB n = 3
10 Correct 1 ms 304 KB n = 8
11 Correct 1 ms 340 KB n = 8
12 Correct 0 ms 340 KB n = 8
13 Correct 0 ms 304 KB n = 8
14 Correct 1 ms 308 KB n = 8
15 Correct 1 ms 340 KB n = 8
16 Correct 1 ms 304 KB n = 8
17 Correct 1 ms 340 KB n = 8
18 Correct 1 ms 340 KB n = 8
19 Correct 1 ms 308 KB n = 3
20 Correct 1 ms 340 KB n = 7
21 Correct 1 ms 340 KB n = 8
22 Correct 1 ms 340 KB n = 8
23 Correct 1 ms 340 KB n = 8
24 Correct 1 ms 304 KB n = 8
25 Correct 1 ms 340 KB n = 8

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB n = 2
2 Correct 1 ms 340 KB n = 2
3 Correct 1 ms 304 KB n = 2
4 Correct 1 ms 340 KB n = 2
5 Correct 1 ms 304 KB n = 2
6 Correct 1 ms 312 KB n = 2
7 Correct 1 ms 340 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 340 KB n = 3
10 Correct 1 ms 304 KB n = 8
11 Correct 1 ms 340 KB n = 8
12 Correct 0 ms 340 KB n = 8
13 Correct 0 ms 304 KB n = 8
14 Correct 1 ms 308 KB n = 8
15 Correct 1 ms 340 KB n = 8
16 Correct 1 ms 304 KB n = 8
17 Correct 1 ms 340 KB n = 8
18 Correct 1 ms 340 KB n = 8
19 Correct 1 ms 308 KB n = 3
20 Correct 1 ms 340 KB n = 7
21 Correct 1 ms 340 KB n = 8
22 Correct 1 ms 340 KB n = 8
23 Correct 1 ms 340 KB n = 8
24 Correct 1 ms 304 KB n = 8
25 Correct 1 ms 340 KB n = 8
26 Correct 1 ms 340 KB n = 8
27 Correct 1 ms 304 KB n = 8
28 Correct 1 ms 308 KB n = 8
29 Correct 1 ms 312 KB n = 16
30 Correct 1 ms 340 KB n = 16
31 Correct 1 ms 340 KB n = 16
32 Correct 0 ms 340 KB n = 16
33 Correct 1 ms 340 KB n = 16
34 Correct 1 ms 308 KB n = 16
35 Correct 1 ms 304 KB n = 16
36 Correct 1 ms 304 KB n = 15
37 Correct 1 ms 340 KB n = 8
38 Correct 1 ms 340 KB n = 16
39 Correct 1 ms 340 KB n = 16
40 Correct 1 ms 312 KB n = 9
41 Correct 1 ms 340 KB n = 16
42 Correct 1 ms 340 KB n = 16
43 Correct 1 ms 308 KB n = 16
44 Correct 1 ms 308 KB n = 9
45 Correct 1 ms 340 KB n = 15
46 Correct 1 ms 340 KB n = 16
47 Correct 1 ms 304 KB n = 16
48 Correct 1 ms 304 KB n = 16

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 18204 KB n = 199999
2 Correct 124 ms 18216 KB n = 199991
3 Correct 130 ms 18264 KB n = 199993
4 Correct 84 ms 13600 KB n = 152076
5 Correct 52 ms 8612 KB n = 93249
6 Correct 104 ms 15648 KB n = 199910
7 Correct 118 ms 17272 KB n = 199999
8 Correct 98 ms 15780 KB n = 199997
9 Correct 100 ms 15556 KB n = 171294
10 Correct 90 ms 12956 KB n = 140872
11 Correct 104 ms 15748 KB n = 199886
12 Correct 119 ms 17452 KB n = 199996
13 Correct 111 ms 16084 KB n = 200000
14 Correct 120 ms 17332 KB n = 199998
15 Correct 110 ms 17072 KB n = 200000
16 Correct 118 ms 17656 KB n = 199998
17 Correct 122 ms 17452 KB n = 200000
18 Correct 111 ms 17392 KB n = 190000
19 Correct 104 ms 15612 KB n = 177777
20 Correct 56 ms 9232 KB n = 100000
21 Correct 111 ms 18268 KB n = 200000
22 Correct 105 ms 18276 KB n = 200000
23 Correct 110 ms 18224 KB n = 200000

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB n = 2
2 Correct 1 ms 340 KB n = 2
3 Correct 1 ms 304 KB n = 2
4 Correct 1 ms 340 KB n = 2
5 Correct 1 ms 304 KB n = 2
6 Correct 1 ms 312 KB n = 2
7 Correct 1 ms 340 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 1 ms 340 KB n = 3
10 Correct 1 ms 304 KB n = 8
11 Correct 1 ms 340 KB n = 8
12 Correct 0 ms 340 KB n = 8
13 Correct 0 ms 304 KB n = 8
14 Correct 1 ms 308 KB n = 8
15 Correct 1 ms 340 KB n = 8
16 Correct 1 ms 304 KB n = 8
17 Correct 1 ms 340 KB n = 8
18 Correct 1 ms 340 KB n = 8
19 Correct 1 ms 308 KB n = 3
20 Correct 1 ms 340 KB n = 7
21 Correct 1 ms 340 KB n = 8
22 Correct 1 ms 340 KB n = 8
23 Correct 1 ms 340 KB n = 8
24 Correct 1 ms 304 KB n = 8
25 Correct 1 ms 340 KB n = 8
26 Correct 1 ms 340 KB n = 8
27 Correct 1 ms 304 KB n = 8
28 Correct 1 ms 308 KB n = 8
29 Correct 1 ms 312 KB n = 16
30 Correct 1 ms 340 KB n = 16
31 Correct 1 ms 340 KB n = 16
32 Correct 0 ms 340 KB n = 16
33 Correct 1 ms 340 KB n = 16
34 Correct 1 ms 308 KB n = 16
35 Correct 1 ms 304 KB n = 16
36 Correct 1 ms 304 KB n = 15
37 Correct 1 ms 340 KB n = 8
38 Correct 1 ms 340 KB n = 16
39 Correct 1 ms 340 KB n = 16
40 Correct 1 ms 312 KB n = 9
41 Correct 1 ms 340 KB n = 16
42 Correct 1 ms 340 KB n = 16
43 Correct 1 ms 308 KB n = 16
44 Correct 1 ms 308 KB n = 9
45 Correct 1 ms 340 KB n = 15
46 Correct 1 ms 340 KB n = 16
47 Correct 1 ms 304 KB n = 16
48 Correct 1 ms 304 KB n = 16
49 Correct 113 ms 18204 KB n = 199999
50 Correct 124 ms 18216 KB n = 199991
51 Correct 130 ms 18264 KB n = 199993
52 Correct 84 ms 13600 KB n = 152076
53 Correct 52 ms 8612 KB n = 93249
54 Correct 104 ms 15648 KB n = 199910
55 Correct 118 ms 17272 KB n = 199999
56 Correct 98 ms 15780 KB n = 199997
57 Correct 100 ms 15556 KB n = 171294
58 Correct 90 ms 12956 KB n = 140872
59 Correct 104 ms 15748 KB n = 199886
60 Correct 119 ms 17452 KB n = 199996
61 Correct 111 ms 16084 KB n = 200000
62 Correct 120 ms 17332 KB n = 199998
63 Correct 110 ms 17072 KB n = 200000
64 Correct 118 ms 17656 KB n = 199998
65 Correct 122 ms 17452 KB n = 200000
66 Correct 111 ms 17392 KB n = 190000
67 Correct 104 ms 15612 KB n = 177777
68 Correct 56 ms 9232 KB n = 100000
69 Correct 111 ms 18268 KB n = 200000
70 Correct 105 ms 18276 KB n = 200000
71 Correct 110 ms 18224 KB n = 200000
72 Correct 124 ms 18220 KB n = 200000
73 Correct 120 ms 18272 KB n = 200000
74 Correct 114 ms 18208 KB n = 200000
75 Correct 133 ms 17492 KB n = 200000
76 Correct 107 ms 17448 KB n = 200000
77 Correct 85 ms 13472 KB n = 200000
78 Correct 101 ms 14368 KB n = 200000
79 Correct 105 ms 16680 KB n = 184307
80 Correct 45 ms 7148 KB n = 76040
81 Correct 109 ms 15784 KB n = 199981
82 Correct 111 ms 17516 KB n = 199994
83 Correct 114 ms 16160 KB n = 199996
84 Correct 107 ms 17204 KB n = 199998
85 Correct 117 ms 17056 KB n = 200000
86 Correct 117 ms 17780 KB n = 199998
87 Correct 121 ms 17496 KB n = 200000
88 Correct 118 ms 18260 KB n = 200000
89 Correct 108 ms 17440 KB n = 200000
90 Correct 123 ms 18208 KB n = 200000
91 Correct 115 ms 18256 KB n = 200000
92 Correct 107 ms 18220 KB n = 200000