oj.uz

Submission #469130

# Submission time Handle Problem Language Result Execution time Memory
469130 2021-08-30T21:17:34 Z Leonardo_Paes Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 528 ms 43168 KB 
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
map<int,int> m;
const int maxn = 4e5 + 10;
vector<int> grafo[maxn];

struct DSU{
	int pai[maxn];
	void init(int n){ for(int i=0; i<maxn; i++) pai[i] = i; }
	int find(int x){ return pai[x] == x ? x : pai[x] = find(pai[x]); }
	bool join(int a, int b){
		a = find(a), b = find(b);
		if(a == b) return 0;
		pai[b] = a; return 1;
	}
}dsu;

long long plan_roller_coaster(vector<int> s, vector<int> t) {
	int n = (int)s.size() + 1;
	s.push_back(1e9);
	t.push_back(1);
	vector<int> v;
	for(int x : s) v.push_back(x);
	for(int x : t) v.push_back(x);
	sort(v.begin(), v.end());
	v.erase(unique(v.begin(), v.end()), v.end());
	int tt = 0;
	for(int x : v) m[x] = tt++;
	vector<int> sum(tt+1, 0);
	dsu.init(tt);
	for(int i=0; i<n; i++){
		int u = m[s[i]], v = m[t[i]];
		if(u == v) continue;
		dsu.join(u, v);
		++sum[u], --sum[v];
	}
	ll ans = 0;
	for(int i=0; i<tt; i++){
		if(i) sum[i] += sum[i-1];
		if(sum[i] != 0){
			dsu.join(i, i+1);
			ans += 1LL * max(sum[i], 0) * (v[i+1] - v[i]);
		}
	}
	vector<pii> q;
	for(int i=0; i+1<tt; i++) if(dsu.find(i) != dsu.find(i+1)) q.push_back({v[i+1] - v[i], i});
	sort(q.begin(), q.end());
	for(auto [w, i] : q) if(dsu.join(i, i+1)) ans += w;
	return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11212 KB n = 2
2 Correct 8 ms 11212 KB n = 2
3 Correct 8 ms 11212 KB n = 2
4 Correct 7 ms 11212 KB n = 2
5 Correct 6 ms 11212 KB n = 2
6 Correct 7 ms 11256 KB n = 2
7 Correct 7 ms 11212 KB n = 3
8 Correct 7 ms 11212 KB n = 3
9 Correct 7 ms 11212 KB n = 3
10 Correct 7 ms 11172 KB n = 8
11 Correct 7 ms 11212 KB n = 8
12 Correct 7 ms 11228 KB n = 8
13 Correct 6 ms 11212 KB n = 8
14 Correct 7 ms 11236 KB n = 8
15 Correct 6 ms 11212 KB n = 8
16 Correct 7 ms 11212 KB n = 8
17 Correct 8 ms 11212 KB n = 8
18 Correct 7 ms 11212 KB n = 8
19 Correct 7 ms 11212 KB n = 3
20 Correct 8 ms 11212 KB n = 7
21 Correct 7 ms 11232 KB n = 8
22 Correct 8 ms 11212 KB n = 8
23 Correct 7 ms 11340 KB n = 8
24 Correct 6 ms 11148 KB n = 8
25 Correct 7 ms 11212 KB n = 8

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 520 ms 36304 KB n = 199999
2 Correct 516 ms 36308 KB n = 199991
3 Correct 499 ms 36312 KB n = 199993
4 Correct 338 ms 30360 KB n = 152076
5 Correct 198 ms 22880 KB n = 93249
6 Correct 432 ms 32604 KB n = 199910
7 Correct 443 ms 35856 KB n = 199999
8 Correct 406 ms 32736 KB n = 199997
9 Correct 440 ms 32720 KB n = 171294
10 Correct 311 ms 28904 KB n = 140872
11 Correct 423 ms 32992 KB n = 199886
12 Correct 418 ms 35992 KB n = 199996
13 Correct 432 ms 33612 KB n = 200000
14 Correct 404 ms 37172 KB n = 199998
15 Correct 416 ms 36876 KB n = 200000
16 Correct 437 ms 37604 KB n = 199998
17 Correct 505 ms 36308 KB n = 200000
18 Correct 487 ms 35056 KB n = 190000
19 Correct 416 ms 33520 KB n = 177777
20 Correct 197 ms 23832 KB n = 100000
21 Correct 461 ms 36316 KB n = 200000
22 Correct 493 ms 39456 KB n = 200000
23 Correct 491 ms 36316 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11212 KB n = 2
2 Correct 8 ms 11212 KB n = 2
3 Correct 8 ms 11212 KB n = 2
4 Correct 7 ms 11212 KB n = 2
5 Correct 6 ms 11212 KB n = 2
6 Correct 7 ms 11256 KB n = 2
7 Correct 7 ms 11212 KB n = 3
8 Correct 7 ms 11212 KB n = 3
9 Correct 7 ms 11212 KB n = 3
10 Correct 7 ms 11172 KB n = 8
11 Correct 7 ms 11212 KB n = 8
12 Correct 7 ms 11228 KB n = 8
13 Correct 6 ms 11212 KB n = 8
14 Correct 7 ms 11236 KB n = 8
15 Correct 6 ms 11212 KB n = 8
16 Correct 7 ms 11212 KB n = 8
17 Correct 8 ms 11212 KB n = 8
18 Correct 7 ms 11212 KB n = 8
19 Correct 7 ms 11212 KB n = 3
20 Correct 8 ms 11212 KB n = 7
21 Correct 7 ms 11232 KB n = 8
22 Correct 8 ms 11212 KB n = 8
23 Correct 7 ms 11340 KB n = 8
24 Correct 6 ms 11148 KB n = 8
25 Correct 7 ms 11212 KB n = 8
26 Correct 7 ms 11232 KB n = 8
27 Correct 7 ms 11212 KB n = 8
28 Correct 7 ms 11212 KB n = 8
29 Correct 8 ms 11212 KB n = 16
30 Correct 9 ms 11232 KB n = 16
31 Correct 7 ms 11212 KB n = 16
32 Correct 7 ms 11236 KB n = 16
33 Correct 7 ms 11232 KB n = 16
34 Correct 8 ms 11236 KB n = 16
35 Correct 8 ms 11212 KB n = 16
36 Correct 7 ms 11212 KB n = 15
37 Correct 7 ms 11212 KB n = 8
38 Correct 7 ms 11212 KB n = 16
39 Correct 7 ms 11236 KB n = 16
40 Correct 7 ms 11212 KB n = 9
41 Correct 7 ms 11212 KB n = 16
42 Correct 8 ms 11212 KB n = 16
43 Correct 8 ms 11260 KB n = 16
44 Correct 7 ms 11212 KB n = 9
45 Correct 7 ms 11212 KB n = 15
46 Correct 9 ms 11212 KB n = 16
47 Correct 7 ms 11212 KB n = 16
48 Correct 8 ms 11212 KB n = 16
49 Correct 520 ms 36304 KB n = 199999
50 Correct 516 ms 36308 KB n = 199991
51 Correct 499 ms 36312 KB n = 199993
52 Correct 338 ms 30360 KB n = 152076
53 Correct 198 ms 22880 KB n = 93249
54 Correct 432 ms 32604 KB n = 199910
55 Correct 443 ms 35856 KB n = 199999
56 Correct 406 ms 32736 KB n = 199997
57 Correct 440 ms 32720 KB n = 171294
58 Correct 311 ms 28904 KB n = 140872
59 Correct 423 ms 32992 KB n = 199886
60 Correct 418 ms 35992 KB n = 199996
61 Correct 432 ms 33612 KB n = 200000
62 Correct 404 ms 37172 KB n = 199998
63 Correct 416 ms 36876 KB n = 200000
64 Correct 437 ms 37604 KB n = 199998
65 Correct 505 ms 36308 KB n = 200000
66 Correct 487 ms 35056 KB n = 190000
67 Correct 416 ms 33520 KB n = 177777
68 Correct 197 ms 23832 KB n = 100000
69 Correct 461 ms 36316 KB n = 200000
70 Correct 493 ms 39456 KB n = 200000
71 Correct 491 ms 36316 KB n = 200000
72 Correct 488 ms 40296 KB n = 200000
73 Correct 497 ms 40280 KB n = 200000
74 Correct 484 ms 40224 KB n = 200000
75 Correct 482 ms 40224 KB n = 200000
76 Correct 523 ms 40164 KB n = 200000
77 Correct 251 ms 30116 KB n = 200000
78 Correct 301 ms 33100 KB n = 200000
79 Correct 445 ms 37832 KB n = 184307
80 Correct 135 ms 22260 KB n = 76040
81 Correct 413 ms 35668 KB n = 199981
82 Correct 447 ms 39208 KB n = 199994
83 Correct 407 ms 36372 KB n = 199996
84 Correct 397 ms 40352 KB n = 199998
85 Correct 385 ms 39840 KB n = 200000
86 Correct 417 ms 40900 KB n = 199998
87 Correct 479 ms 40164 KB n = 200000
88 Correct 491 ms 40224 KB n = 200000
89 Correct 520 ms 40096 KB n = 200000
90 Correct 488 ms 40224 KB n = 200000
91 Correct 528 ms 43168 KB n = 200000
92 Correct 515 ms 40184 KB n = 200000