oj.uz

Submission #424756

# Submission time Handle Problem Language Result Execution time Memory
424756 2021-06-12T09:40:37 Z Kevin_Zhang_TW Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 218 ms 12768 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif

const int MAX_N = 300010;
const ll inf = 1ll << 55;
#include "railroad.h"

struct dsu {
	vector<int> g;
	int F(int i) { return i == g[i] ? i : g[i] = F(g[i]); }
	int operator()(int i) { return F(i); }
	bool M(int a, int b) {
		a = F(a), b = F(b);
		if (a == b) return false;
		return g[b] = a, true;
		//return g[F(b)] = F(a), F(a) != F(b);
	}
	dsu(int n) { g.resize(n + 10), iota(AI(g), 0); }
};
struct lisan : vector<int> {
	void done() { sort(AI()), erase(unique(AI()), end()); }
	int operator ()(int i) {
		return lower_bound(AI(), i) - begin(); 
	}
};

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = (int) s.size() + 1;

	s.pb(1e9);
	t.pb(1);

	lisan lis;
	for (int i = 0;i < n;++i) {
		lis.pb(s[i]), lis.pb(t[i]);
	}
	lis.done();

	int m = lis.size();
	for (int i = 1;i < m;++i) assert(lis[i] > lis[i-1]);

	dsu D(m);

	vector<int> pf(m + 10), suf(m + 10);
	for (int i = 0;i < n;++i) {
		int a = lis(s[i]), b = lis(t[i]);
		D.M(a, b);

		++pf[a], --pf[b];

		assert(a < m && b < m);
	}
	for (int i = 1;i <= m;++i) pf[i] += pf[i-1];

	ll res = 0;

	for (int i = 0;i < m;++i) {
		if (pf[i] != 0) {
			assert(i+1 < m);
			D.M(i, i+1);
			res += max(0, pf[i]) * 1ll * (lis[i+1] - lis[i]);
		}
	}

	vector<pair<int,int>> alle;

	for (int i = 0;i+1 < m;++i) if (D(i) != D(i+1)) {
		alle.pb(lis[i+1] - lis[i], i);
	}

	sort(AI(alle));
	for (auto [w, i] : alle)
		if (D.M(i, i+1))
			res += w;

	return res;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 10720 KB n = 199999
2 Correct 180 ms 10716 KB n = 199991
3 Correct 170 ms 10628 KB n = 199993
4 Correct 127 ms 8344 KB n = 152076
5 Correct 81 ms 5088 KB n = 93249
6 Correct 156 ms 9752 KB n = 199910
7 Correct 158 ms 10516 KB n = 199999
8 Correct 157 ms 9892 KB n = 199997
9 Correct 152 ms 9344 KB n = 171294
10 Correct 122 ms 6944 KB n = 140872
11 Correct 160 ms 9880 KB n = 199886
12 Correct 162 ms 10656 KB n = 199996
13 Correct 162 ms 10148 KB n = 200000
14 Correct 198 ms 10908 KB n = 199998
15 Correct 187 ms 10784 KB n = 200000
16 Correct 191 ms 10912 KB n = 199998
17 Correct 169 ms 10720 KB n = 200000
18 Correct 167 ms 10224 KB n = 190000
19 Correct 192 ms 9676 KB n = 177777
20 Correct 83 ms 5424 KB n = 100000
21 Correct 173 ms 10644 KB n = 200000
22 Correct 216 ms 12768 KB n = 200000
23 Correct 218 ms 10692 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB n = 2
2 Correct 0 ms 204 KB n = 2
3 Correct 0 ms 204 KB n = 2
4 Correct 0 ms 204 KB n = 2
5 Correct 0 ms 204 KB n = 2
6 Correct 0 ms 204 KB n = 2
7 Correct 0 ms 204 KB n = 3
8 Correct 1 ms 204 KB n = 3
9 Correct 1 ms 204 KB n = 3
10 Correct 1 ms 204 KB n = 8
11 Correct 0 ms 204 KB n = 8
12 Correct 0 ms 204 KB n = 8
13 Correct 1 ms 204 KB n = 8
14 Correct 0 ms 204 KB n = 8
15 Correct 1 ms 204 KB n = 8
16 Correct 0 ms 204 KB n = 8
17 Correct 0 ms 204 KB n = 8
18 Correct 0 ms 204 KB n = 8
19 Correct 0 ms 204 KB n = 3
20 Correct 1 ms 204 KB n = 7
21 Correct 0 ms 204 KB n = 8
22 Correct 1 ms 204 KB n = 8
23 Correct 0 ms 204 KB n = 8
24 Correct 0 ms 204 KB n = 8
25 Correct 0 ms 204 KB n = 8
26 Correct 1 ms 204 KB n = 8
27 Correct 0 ms 204 KB n = 8
28 Correct 0 ms 204 KB n = 8
29 Correct 1 ms 204 KB n = 16
30 Correct 0 ms 204 KB n = 16
31 Correct 0 ms 204 KB n = 16
32 Correct 0 ms 204 KB n = 16
33 Correct 0 ms 204 KB n = 16
34 Correct 1 ms 204 KB n = 16
35 Correct 1 ms 204 KB n = 16
36 Correct 1 ms 204 KB n = 15
37 Correct 1 ms 204 KB n = 8
38 Correct 0 ms 204 KB n = 16
39 Correct 1 ms 204 KB n = 16
40 Correct 0 ms 204 KB n = 9
41 Correct 0 ms 204 KB n = 16
42 Correct 0 ms 204 KB n = 16
43 Correct 0 ms 204 KB n = 16
44 Correct 0 ms 204 KB n = 9
45 Correct 0 ms 204 KB n = 15
46 Correct 0 ms 204 KB n = 16
47 Correct 0 ms 204 KB n = 16
48 Correct 1 ms 204 KB n = 16
49 Correct 173 ms 10720 KB n = 199999
50 Correct 180 ms 10716 KB n = 199991
51 Correct 170 ms 10628 KB n = 199993
52 Correct 127 ms 8344 KB n = 152076
53 Correct 81 ms 5088 KB n = 93249
54 Correct 156 ms 9752 KB n = 199910
55 Correct 158 ms 10516 KB n = 199999
56 Correct 157 ms 9892 KB n = 199997
57 Correct 152 ms 9344 KB n = 171294
58 Correct 122 ms 6944 KB n = 140872
59 Correct 160 ms 9880 KB n = 199886
60 Correct 162 ms 10656 KB n = 199996
61 Correct 162 ms 10148 KB n = 200000
62 Correct 198 ms 10908 KB n = 199998
63 Correct 187 ms 10784 KB n = 200000
64 Correct 191 ms 10912 KB n = 199998
65 Correct 169 ms 10720 KB n = 200000
66 Correct 167 ms 10224 KB n = 190000
67 Correct 192 ms 9676 KB n = 177777
68 Correct 83 ms 5424 KB n = 100000
69 Correct 173 ms 10644 KB n = 200000
70 Correct 216 ms 12768 KB n = 200000
71 Correct 218 ms 10692 KB n = 200000
72 Correct 192 ms 10660 KB n = 200000
73 Correct 187 ms 10720 KB n = 200000
74 Correct 175 ms 10632 KB n = 200000
75 Correct 184 ms 10776 KB n = 200000
76 Correct 178 ms 10660 KB n = 200000
77 Correct 147 ms 7332 KB n = 200000
78 Correct 196 ms 10404 KB n = 200000
79 Correct 163 ms 9884 KB n = 184307
80 Correct 62 ms 4000 KB n = 76040
81 Correct 159 ms 9892 KB n = 199981
82 Correct 162 ms 10660 KB n = 199994
83 Correct 159 ms 10140 KB n = 199996
84 Correct 169 ms 10908 KB n = 199998
85 Correct 174 ms 10884 KB n = 200000
86 Correct 181 ms 11044 KB n = 199998
87 Correct 167 ms 10628 KB n = 200000
88 Correct 182 ms 10724 KB n = 200000
89 Correct 171 ms 10640 KB n = 200000
90 Correct 178 ms 10700 KB n = 200000
91 Correct 213 ms 12692 KB n = 200000
92 Correct 177 ms 10656 KB n = 200000