oj.uz

답안 #588893

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
588893 2022-07-04T07:05:15 Z mahra_IOI Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 480 ms 43256 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

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 11220 KB n = 2
2 Correct 6 ms 11244 KB n = 2
3 Correct 6 ms 11220 KB n = 2
4 Correct 5 ms 11220 KB n = 2
5 Correct 7 ms 11220 KB n = 2
6 Correct 6 ms 11220 KB n = 2
7 Correct 7 ms 11220 KB n = 3
8 Correct 6 ms 11220 KB n = 3
9 Correct 7 ms 11240 KB n = 3
10 Correct 6 ms 11220 KB n = 8
11 Correct 7 ms 11244 KB n = 8
12 Correct 6 ms 11220 KB n = 8
13 Correct 6 ms 11220 KB n = 8
14 Correct 6 ms 11220 KB n = 8
15 Correct 6 ms 11268 KB n = 8
16 Correct 6 ms 11220 KB n = 8
17 Correct 6 ms 11220 KB n = 8
18 Correct 6 ms 11220 KB n = 8
19 Correct 6 ms 11220 KB n = 3
20 Correct 6 ms 11244 KB n = 7
21 Correct 6 ms 11240 KB n = 8
22 Correct 6 ms 11220 KB n = 8
23 Correct 6 ms 11236 KB n = 8
24 Correct 6 ms 11244 KB n = 8
25 Correct 5 ms 11220 KB n = 8

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 11220 KB n = 2
2 Correct 6 ms 11244 KB n = 2
3 Correct 6 ms 11220 KB n = 2
4 Correct 5 ms 11220 KB n = 2
5 Correct 7 ms 11220 KB n = 2
6 Correct 6 ms 11220 KB n = 2
7 Correct 7 ms 11220 KB n = 3
8 Correct 6 ms 11220 KB n = 3
9 Correct 7 ms 11240 KB n = 3
10 Correct 6 ms 11220 KB n = 8
11 Correct 7 ms 11244 KB n = 8
12 Correct 6 ms 11220 KB n = 8
13 Correct 6 ms 11220 KB n = 8
14 Correct 6 ms 11220 KB n = 8
15 Correct 6 ms 11268 KB n = 8
16 Correct 6 ms 11220 KB n = 8
17 Correct 6 ms 11220 KB n = 8
18 Correct 6 ms 11220 KB n = 8
19 Correct 6 ms 11220 KB n = 3
20 Correct 6 ms 11244 KB n = 7
21 Correct 6 ms 11240 KB n = 8
22 Correct 6 ms 11220 KB n = 8
23 Correct 6 ms 11236 KB n = 8
24 Correct 6 ms 11244 KB n = 8
25 Correct 5 ms 11220 KB n = 8
26 Correct 6 ms 11220 KB n = 8
27 Correct 5 ms 11220 KB n = 8
28 Correct 6 ms 11220 KB n = 8
29 Correct 7 ms 11240 KB n = 16
30 Correct 7 ms 11236 KB n = 16
31 Correct 6 ms 11236 KB n = 16
32 Correct 7 ms 11244 KB n = 16
33 Correct 7 ms 11220 KB n = 16
34 Correct 7 ms 11220 KB n = 16
35 Correct 8 ms 11220 KB n = 16
36 Correct 6 ms 11220 KB n = 15
37 Correct 6 ms 11240 KB n = 8
38 Correct 6 ms 11220 KB n = 16
39 Correct 7 ms 11220 KB n = 16
40 Correct 6 ms 11220 KB n = 9
41 Correct 6 ms 11220 KB n = 16
42 Correct 6 ms 11220 KB n = 16
43 Correct 6 ms 11220 KB n = 16
44 Correct 7 ms 11236 KB n = 9
45 Correct 6 ms 11220 KB n = 15
46 Correct 8 ms 11220 KB n = 16
47 Correct 7 ms 11236 KB n = 16
48 Correct 6 ms 11236 KB n = 16

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 428 ms 40188 KB n = 199999
2 Correct 449 ms 40156 KB n = 199991
3 Correct 404 ms 40268 KB n = 199993
4 Correct 311 ms 32916 KB n = 152076
5 Correct 160 ms 24744 KB n = 93249
6 Correct 355 ms 35444 KB n = 199910
7 Correct 366 ms 39020 KB n = 199999
8 Correct 328 ms 35508 KB n = 199997
9 Correct 360 ms 35880 KB n = 171294
10 Correct 279 ms 31608 KB n = 140872
11 Correct 398 ms 35736 KB n = 199886
12 Correct 368 ms 39336 KB n = 199996
13 Correct 357 ms 36372 KB n = 200000
14 Correct 362 ms 40304 KB n = 199998
15 Correct 341 ms 39952 KB n = 200000
16 Correct 373 ms 40896 KB n = 199998
17 Correct 445 ms 40144 KB n = 200000
18 Correct 405 ms 38768 KB n = 190000
19 Correct 371 ms 36968 KB n = 177777
20 Correct 166 ms 25772 KB n = 100000
21 Correct 375 ms 40176 KB n = 200000
22 Correct 454 ms 43256 KB n = 200000
23 Correct 416 ms 40168 KB n = 200000

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 11220 KB n = 2
2 Correct 6 ms 11244 KB n = 2
3 Correct 6 ms 11220 KB n = 2
4 Correct 5 ms 11220 KB n = 2
5 Correct 7 ms 11220 KB n = 2
6 Correct 6 ms 11220 KB n = 2
7 Correct 7 ms 11220 KB n = 3
8 Correct 6 ms 11220 KB n = 3
9 Correct 7 ms 11240 KB n = 3
10 Correct 6 ms 11220 KB n = 8
11 Correct 7 ms 11244 KB n = 8
12 Correct 6 ms 11220 KB n = 8
13 Correct 6 ms 11220 KB n = 8
14 Correct 6 ms 11220 KB n = 8
15 Correct 6 ms 11268 KB n = 8
16 Correct 6 ms 11220 KB n = 8
17 Correct 6 ms 11220 KB n = 8
18 Correct 6 ms 11220 KB n = 8
19 Correct 6 ms 11220 KB n = 3
20 Correct 6 ms 11244 KB n = 7
21 Correct 6 ms 11240 KB n = 8
22 Correct 6 ms 11220 KB n = 8
23 Correct 6 ms 11236 KB n = 8
24 Correct 6 ms 11244 KB n = 8
25 Correct 5 ms 11220 KB n = 8
26 Correct 6 ms 11220 KB n = 8
27 Correct 5 ms 11220 KB n = 8
28 Correct 6 ms 11220 KB n = 8
29 Correct 7 ms 11240 KB n = 16
30 Correct 7 ms 11236 KB n = 16
31 Correct 6 ms 11236 KB n = 16
32 Correct 7 ms 11244 KB n = 16
33 Correct 7 ms 11220 KB n = 16
34 Correct 7 ms 11220 KB n = 16
35 Correct 8 ms 11220 KB n = 16
36 Correct 6 ms 11220 KB n = 15
37 Correct 6 ms 11240 KB n = 8
38 Correct 6 ms 11220 KB n = 16
39 Correct 7 ms 11220 KB n = 16
40 Correct 6 ms 11220 KB n = 9
41 Correct 6 ms 11220 KB n = 16
42 Correct 6 ms 11220 KB n = 16
43 Correct 6 ms 11220 KB n = 16
44 Correct 7 ms 11236 KB n = 9
45 Correct 6 ms 11220 KB n = 15
46 Correct 8 ms 11220 KB n = 16
47 Correct 7 ms 11236 KB n = 16
48 Correct 6 ms 11236 KB n = 16
49 Correct 428 ms 40188 KB n = 199999
50 Correct 449 ms 40156 KB n = 199991
51 Correct 404 ms 40268 KB n = 199993
52 Correct 311 ms 32916 KB n = 152076
53 Correct 160 ms 24744 KB n = 93249
54 Correct 355 ms 35444 KB n = 199910
55 Correct 366 ms 39020 KB n = 199999
56 Correct 328 ms 35508 KB n = 199997
57 Correct 360 ms 35880 KB n = 171294
58 Correct 279 ms 31608 KB n = 140872
59 Correct 398 ms 35736 KB n = 199886
60 Correct 368 ms 39336 KB n = 199996
61 Correct 357 ms 36372 KB n = 200000
62 Correct 362 ms 40304 KB n = 199998
63 Correct 341 ms 39952 KB n = 200000
64 Correct 373 ms 40896 KB n = 199998
65 Correct 445 ms 40144 KB n = 200000
66 Correct 405 ms 38768 KB n = 190000
67 Correct 371 ms 36968 KB n = 177777
68 Correct 166 ms 25772 KB n = 100000
69 Correct 375 ms 40176 KB n = 200000
70 Correct 454 ms 43256 KB n = 200000
71 Correct 416 ms 40168 KB n = 200000
72 Correct 444 ms 40184 KB n = 200000
73 Correct 435 ms 40080 KB n = 200000
74 Correct 417 ms 40268 KB n = 200000
75 Correct 480 ms 40180 KB n = 200000
76 Correct 455 ms 40184 KB n = 200000
77 Correct 217 ms 30008 KB n = 200000
78 Correct 244 ms 32976 KB n = 200000
79 Correct 390 ms 37708 KB n = 184307
80 Correct 119 ms 22152 KB n = 76040
81 Correct 371 ms 35652 KB n = 199981
82 Correct 374 ms 39204 KB n = 199994
83 Correct 326 ms 36428 KB n = 199996
84 Correct 346 ms 40232 KB n = 199998
85 Correct 356 ms 39908 KB n = 200000
86 Correct 377 ms 40900 KB n = 199998
87 Correct 436 ms 40152 KB n = 200000
88 Correct 463 ms 40152 KB n = 200000
89 Correct 476 ms 40152 KB n = 200000
90 Correct 414 ms 40148 KB n = 200000
91 Correct 426 ms 43224 KB n = 200000
92 Correct 455 ms 40240 KB n = 200000