oj.uz

Submission #826296

# Submission time Handle Problem Language Result Execution time Memory
826296 2023-08-15T12:24:41 Z Sohsoh84 Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 229 ms 28188 KB 
#include "railroad.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;

#define all(x)		(x).begin(), (x).end()
#define debug(x)	cerr << #x << ": " << x << endl;
#define sep		' '
#define X		first
#define Y		second

const ll MAXN = 1e6 + 10;
const ll INF = 1e9 + 7;

int n, cnt[MAXN], par[MAXN];
vector<int> comp_vec;
ll k;
int find(int v) {
	return par[v] == v ? v : par[v] = find(par[v]);
}

inline bool unite(int u, int v) {
	int u_ = u, v_ = v;
	u = find(u), v = find(v);
	if (u == v) return false;
	par[u] = v;
	
//	cerr << "unite: " << u_ << " " << v_ << endl;
	return true;
}

inline int ind(int x) {
	return lower_bound(all(comp_vec), x) - comp_vec.begin();
}

ll plan_roller_coaster(vector<int> s, vector<int> t) {
	s.push_back(0);
	t.push_back(1e9 + 7);

	ll ans = 0;
	for (int i = 0; i < int(s.size()); i++) {
		comp_vec.push_back(s[i]);
		comp_vec.push_back(t[i]);
		k += t[i] - s[i];
	}

	sort(all(comp_vec));
	comp_vec.resize(unique(all(comp_vec)) - comp_vec.begin());


	int m = comp_vec.size();
	for (int i = 0; i < m; i++) par[i] = i;

	k -= 1e9 + 7;
	for (int i = 0; i < int(s.size()); i++) {
		cnt[ind(s[i])]++;
		cnt[ind(t[i])]--;
		unite(ind(s[i]), ind(t[i]));
	}


	int tot = -1;
	vector<pair<int, pll>> edges;
	for (int i = 0; i < m - 1; i++) {
		tot += cnt[i];
		if (tot <= 0) {
			//ans += 1ll * (1 - tot) * (comp_vec[i + 1] - comp_vec[i]);
			unite(i, i + 1);
		} else if (tot > 1) {
			unite(i, i + 1);
			ans += 1ll * (tot - 1) * (comp_vec[i + 1] - comp_vec[i]);
		}

		//cerr << tot << sep << comp_vec[i] << sep << ans << endl;
		edges.push_back({comp_vec[i + 1] - comp_vec[i], {i, i + 1}});
	}

	sort(all(edges));
	for (auto [x, e] : edges)
		if (unite(e.X, e.Y)){
		//	cerr << e.X << ' ' << e.Y << ' ' <<  x << endl;
			ans += x;
		}

	return ans;
}

Compilation message

railroad.cpp: In function 'bool unite(int, int)':
railroad.cpp:26:6: warning: unused variable 'u_' [-Wunused-variable]
   26 |  int u_ = u, v_ = v;
      |      ^~
railroad.cpp:26:14: warning: unused variable 'v_' [-Wunused-variable]
   26 |  int u_ = u, v_ = v;
      |              ^~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 2
2 Correct 1 ms 212 KB n = 2
3 Correct 0 ms 212 KB n = 2
4 Correct 0 ms 312 KB n = 2
5 Correct 0 ms 304 KB n = 2
6 Correct 0 ms 212 KB n = 2
7 Correct 0 ms 312 KB n = 3
8 Correct 0 ms 212 KB n = 3
9 Correct 0 ms 212 KB n = 3
10 Correct 0 ms 212 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 0 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8
16 Correct 0 ms 212 KB n = 8
17 Correct 0 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 0 ms 212 KB n = 8
22 Correct 0 ms 212 KB n = 8
23 Correct 0 ms 212 KB n = 8
24 Correct 1 ms 212 KB n = 8
25 Correct 0 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 212 KB n = 2
3 Correct 0 ms 212 KB n = 2
4 Correct 0 ms 312 KB n = 2
5 Correct 0 ms 304 KB n = 2
6 Correct 0 ms 212 KB n = 2
7 Correct 0 ms 312 KB n = 3
8 Correct 0 ms 212 KB n = 3
9 Correct 0 ms 212 KB n = 3
10 Correct 0 ms 212 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 0 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8
16 Correct 0 ms 212 KB n = 8
17 Correct 0 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 0 ms 212 KB n = 8
22 Correct 0 ms 212 KB n = 8
23 Correct 0 ms 212 KB n = 8
24 Correct 1 ms 212 KB n = 8
25 Correct 0 ms 212 KB n = 8
26 Correct 0 ms 212 KB n = 8
27 Correct 0 ms 276 KB n = 8
28 Correct 0 ms 212 KB n = 8
29 Correct 0 ms 212 KB n = 16
30 Correct 0 ms 212 KB n = 16
31 Correct 0 ms 308 KB n = 16
32 Correct 1 ms 212 KB n = 16
33 Correct 1 ms 212 KB n = 16
34 Correct 0 ms 212 KB n = 16
35 Correct 1 ms 304 KB n = 16
36 Correct 1 ms 212 KB n = 15
37 Correct 0 ms 212 KB n = 8
38 Correct 0 ms 212 KB n = 16
39 Correct 0 ms 212 KB n = 16
40 Correct 1 ms 212 KB n = 9
41 Correct 0 ms 212 KB n = 16
42 Correct 0 ms 212 KB n = 16
43 Correct 0 ms 212 KB n = 16
44 Correct 0 ms 312 KB n = 9
45 Correct 0 ms 212 KB n = 15
46 Correct 0 ms 212 KB n = 16
47 Correct 0 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 208 ms 25832 KB n = 199999
2 Correct 219 ms 25828 KB n = 199991
3 Correct 229 ms 25836 KB n = 199993
4 Correct 157 ms 22708 KB n = 152076
5 Correct 93 ms 12708 KB n = 93249
6 Correct 184 ms 24124 KB n = 199910
7 Correct 194 ms 24992 KB n = 199999
8 Correct 184 ms 24220 KB n = 199997
9 Correct 185 ms 24068 KB n = 171294
10 Correct 152 ms 22368 KB n = 140872
11 Correct 188 ms 24148 KB n = 199886
12 Correct 199 ms 25112 KB n = 199996
13 Correct 195 ms 24376 KB n = 200000
14 Correct 195 ms 24916 KB n = 199998
15 Correct 196 ms 24856 KB n = 200000
16 Correct 202 ms 25344 KB n = 199998
17 Correct 207 ms 28188 KB n = 200000
18 Correct 195 ms 25432 KB n = 190000
19 Correct 179 ms 26584 KB n = 177777
20 Correct 96 ms 13104 KB n = 100000
21 Correct 203 ms 25840 KB n = 200000
22 Correct 199 ms 25880 KB n = 200000
23 Correct 199 ms 25840 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 212 KB n = 2
3 Correct 0 ms 212 KB n = 2
4 Correct 0 ms 312 KB n = 2
5 Correct 0 ms 304 KB n = 2
6 Correct 0 ms 212 KB n = 2
7 Correct 0 ms 312 KB n = 3
8 Correct 0 ms 212 KB n = 3
9 Correct 0 ms 212 KB n = 3
10 Correct 0 ms 212 KB n = 8
11 Correct 0 ms 212 KB n = 8
12 Correct 1 ms 212 KB n = 8
13 Correct 0 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8
16 Correct 0 ms 212 KB n = 8
17 Correct 0 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 0 ms 212 KB n = 8
22 Correct 0 ms 212 KB n = 8
23 Correct 0 ms 212 KB n = 8
24 Correct 1 ms 212 KB n = 8
25 Correct 0 ms 212 KB n = 8
26 Correct 0 ms 212 KB n = 8
27 Correct 0 ms 276 KB n = 8
28 Correct 0 ms 212 KB n = 8
29 Correct 0 ms 212 KB n = 16
30 Correct 0 ms 212 KB n = 16
31 Correct 0 ms 308 KB n = 16
32 Correct 1 ms 212 KB n = 16
33 Correct 1 ms 212 KB n = 16
34 Correct 0 ms 212 KB n = 16
35 Correct 1 ms 304 KB n = 16
36 Correct 1 ms 212 KB n = 15
37 Correct 0 ms 212 KB n = 8
38 Correct 0 ms 212 KB n = 16
39 Correct 0 ms 212 KB n = 16
40 Correct 1 ms 212 KB n = 9
41 Correct 0 ms 212 KB n = 16
42 Correct 0 ms 212 KB n = 16
43 Correct 0 ms 212 KB n = 16
44 Correct 0 ms 312 KB n = 9
45 Correct 0 ms 212 KB n = 15
46 Correct 0 ms 212 KB n = 16
47 Correct 0 ms 212 KB n = 16
48 Correct 0 ms 212 KB n = 16
49 Correct 208 ms 25832 KB n = 199999
50 Correct 219 ms 25828 KB n = 199991
51 Correct 229 ms 25836 KB n = 199993
52 Correct 157 ms 22708 KB n = 152076
53 Correct 93 ms 12708 KB n = 93249
54 Correct 184 ms 24124 KB n = 199910
55 Correct 194 ms 24992 KB n = 199999
56 Correct 184 ms 24220 KB n = 199997
57 Correct 185 ms 24068 KB n = 171294
58 Correct 152 ms 22368 KB n = 140872
59 Correct 188 ms 24148 KB n = 199886
60 Correct 199 ms 25112 KB n = 199996
61 Correct 195 ms 24376 KB n = 200000
62 Correct 195 ms 24916 KB n = 199998
63 Correct 196 ms 24856 KB n = 200000
64 Correct 202 ms 25344 KB n = 199998
65 Correct 207 ms 28188 KB n = 200000
66 Correct 195 ms 25432 KB n = 190000
67 Correct 179 ms 26584 KB n = 177777
68 Correct 96 ms 13104 KB n = 100000
69 Correct 203 ms 25840 KB n = 200000
70 Correct 199 ms 25880 KB n = 200000
71 Correct 199 ms 25840 KB n = 200000
72 Correct 208 ms 25884 KB n = 200000
73 Correct 211 ms 25892 KB n = 200000
74 Correct 213 ms 25832 KB n = 200000
75 Correct 199 ms 25832 KB n = 200000
76 Correct 201 ms 25832 KB n = 200000
77 Correct 161 ms 18948 KB n = 200000
78 Correct 177 ms 18136 KB n = 200000
79 Correct 196 ms 24736 KB n = 184307
80 Correct 74 ms 11672 KB n = 76040
81 Correct 185 ms 24156 KB n = 199981
82 Correct 199 ms 25112 KB n = 199994
83 Correct 187 ms 24380 KB n = 199996
84 Correct 195 ms 24968 KB n = 199998
85 Correct 197 ms 24884 KB n = 200000
86 Correct 202 ms 25292 KB n = 199998
87 Correct 201 ms 28168 KB n = 200000
88 Correct 203 ms 26272 KB n = 200000
89 Correct 197 ms 28176 KB n = 200000
90 Correct 203 ms 25888 KB n = 200000
91 Correct 200 ms 25868 KB n = 200000
92 Correct 196 ms 25840 KB n = 200000