oj.uz

Submission #662910

# Submission time Handle Problem Language Result Execution time Memory
662910 2022-11-26T13:22:52 Z Trisanu_Das Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 171 ms 15116 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define all(x) begin(x), end(x)
#define lb(x...) lower_bound(x)
#define eb(x...) emplace_back(x)
 
const int inf = 2e9;
using ll = int64_t;
using vi = vector<int>;
 
vi nxt;
int head(int u) { return nxt[u] != -1 ? nxt[u] = head(nxt[u]) : u; }
bool unite(int u, int v) {
	u = head(u); v = head(v);
	if (u == v) return false;
	nxt[v] = u; return true;
}
 
ll plan_roller_coaster(vi s, vi t) {
	s.eb(inf); t.eb(1); int n = s.size();
	vi p = s; p.insert(end(p), all(t));
	sort(all(p)); p.erase(unique(all(p)), end(p));	
	int m = p.size(); nxt.resize(m, -1);
 
	vi b(m--);
	for(int i = 0; i < n; i++) {
		int l = lb(all(p), s[i]) - begin(p), r = lb(all(p), t[i]) - begin(p);
		unite(l, r); ++b[l]; --b[r];
	}
	for(int i = 0; i < m; i++) b[i + 1] += b[i];
 
	vector<pair<int, int>> e; ll ans = 0;
	for(int i = 0; i < m; i++) {
		ll d = p[i + 1] - p[i];
		if (b[i]) {
			unite(i, i + 1);
			if (b[i] > 0) ans += b[i] * d;
		} else e.eb(d, i);
	}
	sort(all(e));
	for (auto u : e) if (unite(u.second, u.second + 1)) ans += u.first;
 
	return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 2
2 Correct 1 ms 304 KB n = 2
3 Correct 0 ms 212 KB n = 2
4 Correct 1 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Correct 1 ms 212 KB n = 2
7 Correct 1 ms 296 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 0 ms 212 KB n = 3
10 Correct 1 ms 212 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 0 ms 304 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 1 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8
16 Correct 1 ms 212 KB n = 8
17 Correct 1 ms 212 KB n = 8
18 Correct 0 ms 212 KB n = 8
19 Correct 0 ms 212 KB n = 3
20 Correct 0 ms 212 KB n = 7
21 Correct 1 ms 304 KB n = 8
22 Correct 1 ms 212 KB n = 8
23 Correct 0 ms 300 KB n = 8
24 Correct 0 ms 300 KB n = 8
25 Correct 1 ms 212 KB n = 8

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 2
2 Correct 1 ms 304 KB n = 2
3 Correct 0 ms 212 KB n = 2
4 Correct 1 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Correct 1 ms 212 KB n = 2
7 Correct 1 ms 296 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 0 ms 212 KB n = 3
10 Correct 1 ms 212 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 0 ms 304 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 1 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8
16 Correct 1 ms 212 KB n = 8
17 Correct 1 ms 212 KB n = 8
18 Correct 0 ms 212 KB n = 8
19 Correct 0 ms 212 KB n = 3
20 Correct 0 ms 212 KB n = 7
21 Correct 1 ms 304 KB n = 8
22 Correct 1 ms 212 KB n = 8
23 Correct 0 ms 300 KB n = 8
24 Correct 0 ms 300 KB n = 8
25 Correct 1 ms 212 KB n = 8
26 Correct 1 ms 212 KB n = 8
27 Correct 0 ms 212 KB n = 8
28 Correct 0 ms 212 KB n = 8
29 Correct 1 ms 212 KB n = 16
30 Correct 1 ms 300 KB n = 16
31 Correct 0 ms 212 KB n = 16
32 Correct 1 ms 212 KB n = 16
33 Correct 0 ms 212 KB n = 16
34 Correct 0 ms 304 KB n = 16
35 Correct 1 ms 212 KB n = 16
36 Correct 1 ms 212 KB n = 15
37 Correct 1 ms 212 KB n = 8
38 Correct 1 ms 212 KB n = 16
39 Correct 0 ms 212 KB n = 16
40 Correct 1 ms 212 KB n = 9
41 Correct 1 ms 212 KB n = 16
42 Correct 0 ms 212 KB n = 16
43 Correct 1 ms 296 KB n = 16
44 Correct 0 ms 212 KB n = 9
45 Correct 1 ms 212 KB n = 15
46 Correct 1 ms 212 KB n = 16
47 Correct 1 ms 212 KB n = 16
48 Correct 0 ms 212 KB n = 16

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 12788 KB n = 199999
2 Correct 143 ms 12832 KB n = 199991
3 Correct 137 ms 12792 KB n = 199993
4 Correct 104 ms 9536 KB n = 152076
5 Correct 64 ms 6064 KB n = 93249
6 Correct 134 ms 11036 KB n = 199910
7 Correct 130 ms 11928 KB n = 199999
8 Correct 128 ms 11240 KB n = 199997
9 Correct 122 ms 10896 KB n = 171294
10 Correct 97 ms 8956 KB n = 140872
11 Correct 131 ms 11224 KB n = 199886
12 Correct 135 ms 12060 KB n = 199996
13 Correct 130 ms 11328 KB n = 200000
14 Correct 145 ms 14108 KB n = 199998
15 Correct 144 ms 14112 KB n = 200000
16 Correct 156 ms 14636 KB n = 199998
17 Correct 130 ms 12704 KB n = 200000
18 Correct 131 ms 12132 KB n = 190000
19 Correct 115 ms 11308 KB n = 177777
20 Correct 67 ms 6548 KB n = 100000
21 Correct 132 ms 12700 KB n = 200000
22 Correct 171 ms 15116 KB n = 200000
23 Correct 169 ms 14984 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 2
2 Correct 1 ms 304 KB n = 2
3 Correct 0 ms 212 KB n = 2
4 Correct 1 ms 212 KB n = 2
5 Correct 0 ms 212 KB n = 2
6 Correct 1 ms 212 KB n = 2
7 Correct 1 ms 296 KB n = 3
8 Correct 1 ms 212 KB n = 3
9 Correct 0 ms 212 KB n = 3
10 Correct 1 ms 212 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 0 ms 304 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 1 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8
16 Correct 1 ms 212 KB n = 8
17 Correct 1 ms 212 KB n = 8
18 Correct 0 ms 212 KB n = 8
19 Correct 0 ms 212 KB n = 3
20 Correct 0 ms 212 KB n = 7
21 Correct 1 ms 304 KB n = 8
22 Correct 1 ms 212 KB n = 8
23 Correct 0 ms 300 KB n = 8
24 Correct 0 ms 300 KB n = 8
25 Correct 1 ms 212 KB n = 8
26 Correct 1 ms 212 KB n = 8
27 Correct 0 ms 212 KB n = 8
28 Correct 0 ms 212 KB n = 8
29 Correct 1 ms 212 KB n = 16
30 Correct 1 ms 300 KB n = 16
31 Correct 0 ms 212 KB n = 16
32 Correct 1 ms 212 KB n = 16
33 Correct 0 ms 212 KB n = 16
34 Correct 0 ms 304 KB n = 16
35 Correct 1 ms 212 KB n = 16
36 Correct 1 ms 212 KB n = 15
37 Correct 1 ms 212 KB n = 8
38 Correct 1 ms 212 KB n = 16
39 Correct 0 ms 212 KB n = 16
40 Correct 1 ms 212 KB n = 9
41 Correct 1 ms 212 KB n = 16
42 Correct 0 ms 212 KB n = 16
43 Correct 1 ms 296 KB n = 16
44 Correct 0 ms 212 KB n = 9
45 Correct 1 ms 212 KB n = 15
46 Correct 1 ms 212 KB n = 16
47 Correct 1 ms 212 KB n = 16
48 Correct 0 ms 212 KB n = 16
49 Correct 137 ms 12788 KB n = 199999
50 Correct 143 ms 12832 KB n = 199991
51 Correct 137 ms 12792 KB n = 199993
52 Correct 104 ms 9536 KB n = 152076
53 Correct 64 ms 6064 KB n = 93249
54 Correct 134 ms 11036 KB n = 199910
55 Correct 130 ms 11928 KB n = 199999
56 Correct 128 ms 11240 KB n = 199997
57 Correct 122 ms 10896 KB n = 171294
58 Correct 97 ms 8956 KB n = 140872
59 Correct 131 ms 11224 KB n = 199886
60 Correct 135 ms 12060 KB n = 199996
61 Correct 130 ms 11328 KB n = 200000
62 Correct 145 ms 14108 KB n = 199998
63 Correct 144 ms 14112 KB n = 200000
64 Correct 156 ms 14636 KB n = 199998
65 Correct 130 ms 12704 KB n = 200000
66 Correct 131 ms 12132 KB n = 190000
67 Correct 115 ms 11308 KB n = 177777
68 Correct 67 ms 6548 KB n = 100000
69 Correct 132 ms 12700 KB n = 200000
70 Correct 171 ms 15116 KB n = 200000
71 Correct 169 ms 14984 KB n = 200000
72 Correct 134 ms 12792 KB n = 200000
73 Correct 145 ms 12792 KB n = 200000
74 Correct 134 ms 12832 KB n = 200000
75 Correct 133 ms 12784 KB n = 200000
76 Correct 133 ms 12716 KB n = 200000
77 Correct 119 ms 10412 KB n = 200000
78 Correct 143 ms 13592 KB n = 200000
79 Correct 130 ms 11564 KB n = 184307
80 Correct 53 ms 5048 KB n = 76040
81 Correct 126 ms 11032 KB n = 199981
82 Correct 139 ms 12084 KB n = 199994
83 Correct 130 ms 11288 KB n = 199996
84 Correct 144 ms 14108 KB n = 199998
85 Correct 146 ms 14104 KB n = 200000
86 Correct 154 ms 14552 KB n = 199998
87 Correct 138 ms 12784 KB n = 200000
88 Correct 140 ms 12784 KB n = 200000
89 Correct 133 ms 12800 KB n = 200000
90 Correct 134 ms 12696 KB n = 200000
91 Correct 165 ms 15000 KB n = 200000
92 Correct 167 ms 14996 KB n = 200000