oj.uz

Submission #233104

# Submission time Handle Problem Language Result Execution time Memory
233104 2020-05-19T11:02:51 Z islingr Roller Coaster Railroad (IOI16_railroad) C++14
100 / 100
 234 ms 11992 KB 
#include <algorithm>
#include <vector>
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--);
	rep(i, 0, n) {
		int l = lb(all(p), s[i]) - begin(p), r = lb(all(p), t[i]) - begin(p);
		unite(l, r); ++b[l]; --b[r];
	}
	rep(i, 0, m) b[i + 1] += b[i];

	vector<pair<int, int>> e; ll ans = 0;
	rep(i, 0, m) {
		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 5 ms 384 KB n = 2
2 Correct 4 ms 256 KB n = 2
3 Correct 4 ms 256 KB n = 2
4 Correct 5 ms 384 KB n = 2
5 Correct 4 ms 256 KB n = 2
6 Correct 5 ms 384 KB n = 2
7 Correct 4 ms 256 KB n = 3
8 Correct 4 ms 256 KB n = 3
9 Correct 5 ms 256 KB n = 3
10 Correct 5 ms 256 KB n = 8
11 Correct 4 ms 256 KB n = 8
12 Correct 4 ms 384 KB n = 8
13 Correct 4 ms 256 KB n = 8
14 Correct 4 ms 256 KB n = 8
15 Correct 5 ms 256 KB n = 8
16 Correct 5 ms 256 KB n = 8
17 Correct 5 ms 256 KB n = 8
18 Correct 4 ms 256 KB n = 8
19 Correct 4 ms 256 KB n = 3
20 Correct 4 ms 256 KB n = 7
21 Correct 4 ms 256 KB n = 8
22 Correct 5 ms 256 KB n = 8
23 Correct 4 ms 256 KB n = 8
24 Correct 4 ms 256 KB n = 8
25 Correct 4 ms 256 KB n = 8

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 9616 KB n = 199999
2 Correct 202 ms 9432 KB n = 199991
3 Correct 189 ms 9304 KB n = 199993
4 Correct 144 ms 7504 KB n = 152076
5 Correct 86 ms 4888 KB n = 93249
6 Correct 174 ms 8920 KB n = 199910
7 Correct 177 ms 9432 KB n = 199999
8 Correct 175 ms 9076 KB n = 199997
9 Correct 166 ms 8376 KB n = 171294
10 Correct 132 ms 6952 KB n = 140872
11 Correct 177 ms 8920 KB n = 199886
12 Correct 183 ms 9432 KB n = 199996
13 Correct 177 ms 9048 KB n = 200000
14 Correct 196 ms 11736 KB n = 199998
15 Correct 208 ms 11736 KB n = 200000
16 Correct 210 ms 11736 KB n = 199998
17 Correct 189 ms 9432 KB n = 200000
18 Correct 187 ms 9128 KB n = 190000
19 Correct 171 ms 8456 KB n = 177777
20 Correct 94 ms 5096 KB n = 100000
21 Correct 190 ms 9432 KB n = 200000
22 Correct 232 ms 11736 KB n = 200000
23 Correct 224 ms 11736 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB n = 2
2 Correct 4 ms 256 KB n = 2
3 Correct 4 ms 256 KB n = 2
4 Correct 5 ms 384 KB n = 2
5 Correct 4 ms 256 KB n = 2
6 Correct 5 ms 384 KB n = 2
7 Correct 4 ms 256 KB n = 3
8 Correct 4 ms 256 KB n = 3
9 Correct 5 ms 256 KB n = 3
10 Correct 5 ms 256 KB n = 8
11 Correct 4 ms 256 KB n = 8
12 Correct 4 ms 384 KB n = 8
13 Correct 4 ms 256 KB n = 8
14 Correct 4 ms 256 KB n = 8
15 Correct 5 ms 256 KB n = 8
16 Correct 5 ms 256 KB n = 8
17 Correct 5 ms 256 KB n = 8
18 Correct 4 ms 256 KB n = 8
19 Correct 4 ms 256 KB n = 3
20 Correct 4 ms 256 KB n = 7
21 Correct 4 ms 256 KB n = 8
22 Correct 5 ms 256 KB n = 8
23 Correct 4 ms 256 KB n = 8
24 Correct 4 ms 256 KB n = 8
25 Correct 4 ms 256 KB n = 8
26 Correct 4 ms 384 KB n = 8
27 Correct 4 ms 384 KB n = 8
28 Correct 4 ms 384 KB n = 8
29 Correct 4 ms 384 KB n = 16
30 Correct 4 ms 384 KB n = 16
31 Correct 4 ms 256 KB n = 16
32 Correct 4 ms 256 KB n = 16
33 Correct 5 ms 256 KB n = 16
34 Correct 4 ms 256 KB n = 16
35 Correct 5 ms 384 KB n = 16
36 Correct 5 ms 256 KB n = 15
37 Correct 4 ms 256 KB n = 8
38 Correct 5 ms 256 KB n = 16
39 Correct 4 ms 256 KB n = 16
40 Correct 4 ms 256 KB n = 9
41 Correct 4 ms 256 KB n = 16
42 Correct 5 ms 256 KB n = 16
43 Correct 4 ms 256 KB n = 16
44 Correct 4 ms 256 KB n = 9
45 Correct 5 ms 256 KB n = 15
46 Correct 5 ms 256 KB n = 16
47 Correct 4 ms 256 KB n = 16
48 Correct 5 ms 256 KB n = 16
49 Correct 192 ms 9616 KB n = 199999
50 Correct 202 ms 9432 KB n = 199991
51 Correct 189 ms 9304 KB n = 199993
52 Correct 144 ms 7504 KB n = 152076
53 Correct 86 ms 4888 KB n = 93249
54 Correct 174 ms 8920 KB n = 199910
55 Correct 177 ms 9432 KB n = 199999
56 Correct 175 ms 9076 KB n = 199997
57 Correct 166 ms 8376 KB n = 171294
58 Correct 132 ms 6952 KB n = 140872
59 Correct 177 ms 8920 KB n = 199886
60 Correct 183 ms 9432 KB n = 199996
61 Correct 177 ms 9048 KB n = 200000
62 Correct 196 ms 11736 KB n = 199998
63 Correct 208 ms 11736 KB n = 200000
64 Correct 210 ms 11736 KB n = 199998
65 Correct 189 ms 9432 KB n = 200000
66 Correct 187 ms 9128 KB n = 190000
67 Correct 171 ms 8456 KB n = 177777
68 Correct 94 ms 5096 KB n = 100000
69 Correct 190 ms 9432 KB n = 200000
70 Correct 232 ms 11736 KB n = 200000
71 Correct 224 ms 11736 KB n = 200000
72 Correct 191 ms 9432 KB n = 200000
73 Correct 200 ms 9560 KB n = 200000
74 Correct 189 ms 9464 KB n = 200000
75 Correct 192 ms 9432 KB n = 200000
76 Correct 193 ms 9560 KB n = 200000
77 Correct 170 ms 7128 KB n = 200000
78 Correct 195 ms 10200 KB n = 200000
79 Correct 178 ms 8920 KB n = 184307
80 Correct 72 ms 4128 KB n = 76040
81 Correct 179 ms 8920 KB n = 199981
82 Correct 184 ms 9460 KB n = 199994
83 Correct 179 ms 9088 KB n = 199996
84 Correct 196 ms 11644 KB n = 199998
85 Correct 198 ms 11608 KB n = 200000
86 Correct 209 ms 11992 KB n = 199998
87 Correct 187 ms 9432 KB n = 200000
88 Correct 195 ms 9432 KB n = 200000
89 Correct 192 ms 9432 KB n = 200000
90 Correct 191 ms 9560 KB n = 200000
91 Correct 234 ms 11608 KB n = 200000
92 Correct 234 ms 11608 KB n = 200000