oj.uz

답안 #388646

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
388646 2021-04-12T12:12:03 Z alireza_kaviani Roller Coaster Railroad (IOI16_railroad) C++11
100 / 100
 305 ms 24312 KB 
#include <bits/stdc++.h>
#include "railroad.h"
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define all(x)		(x).begin() , (x).end()
#define SZ(x)		int(x.size())
#define sep			' '
#define X			first
#define Y			second

const int MAXN = 5e5 + 10;

ll ps[MAXN] , par[MAXN] , sz[MAXN];
vector<ll> compress;

int Find(int v){
	return (par[v] == -1 ? v : par[v] = Find(par[v]));
}

void Union(int v , int u){
//	cout << "U " << v << sep << u << endl;
	v = Find(v); u = Find(u);
	if(v == u)	return;
	if(sz[v] < sz[u])	swap(v , u);
	par[v] = u;
	sz[v] += sz[u];
}

ll plan_roller_coaster(vector<int> s, vector<int> t) {
	fill(par , par + MAXN , -1);
	fill(sz , sz + MAXN , 1);
	int n = (int) s.size();
	for(int i = 0 ; i < n ; i++){
		compress.push_back(s[i]);
		compress.push_back(t[i]);
	}
	sort(all(compress));
	compress.resize(unique(all(compress)) - compress.begin());
	for(int i = 0 ; i < n ; i++){
//		cout << s[i] << sep << t[i] << endl;
		s[i] = lower_bound(all(compress) , s[i]) - compress.begin();
		t[i] = lower_bound(all(compress) , t[i]) - compress.begin();
		ps[s[i]]++; ps[t[i]]--; Union(s[i] , t[i]);
//		cout << s[i] << sep << t[i] << endl;
	}
	ll ans = 0;
	vector<pii> vec;
	for(int i = 0 ; i + 1 < SZ(compress) ; i++){
		ps[i + 1] += ps[i];
		ans += max(0ll , ps[i] - 1) * (compress[i + 1] - compress[i]);
		if(ps[i] != 1)	Union(i , i + 1);
		else{
			vec.push_back({compress[i + 1] - compress[i] , i});
		}
	}
	sort(all(vec));
	for(pii i : vec){
//		cout << "E " << i.X << sep << i.Y << endl;
		if(Find(i.Y) != Find(i.Y + 1)){
			Union(i.Y , i.Y + 1);
			ans += i.X;
		}
	}
	return ans;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8012 KB n = 2
2 Correct 4 ms 8012 KB n = 2
3 Correct 4 ms 8012 KB n = 2
4 Correct 4 ms 8012 KB n = 2
5 Correct 4 ms 8012 KB n = 2
6 Correct 4 ms 8012 KB n = 2
7 Correct 4 ms 8012 KB n = 3
8 Correct 4 ms 8012 KB n = 3
9 Correct 4 ms 8084 KB n = 3
10 Correct 4 ms 8012 KB n = 8
11 Correct 4 ms 8012 KB n = 8
12 Correct 4 ms 8012 KB n = 8
13 Correct 4 ms 8012 KB n = 8
14 Correct 4 ms 8012 KB n = 8
15 Correct 4 ms 8012 KB n = 8
16 Correct 4 ms 8064 KB n = 8
17 Correct 4 ms 8012 KB n = 8
18 Correct 4 ms 8016 KB n = 8
19 Correct 4 ms 8120 KB n = 3
20 Correct 4 ms 8116 KB n = 7
21 Correct 4 ms 8012 KB n = 8
22 Correct 4 ms 8012 KB n = 8
23 Correct 4 ms 8016 KB n = 8
24 Correct 4 ms 8012 KB n = 8
25 Correct 4 ms 8012 KB n = 8

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 227 ms 17964 KB n = 199999
2 Correct 252 ms 17728 KB n = 199991
3 Correct 236 ms 17728 KB n = 199993
4 Correct 168 ms 15528 KB n = 152076
5 Correct 96 ms 12724 KB n = 93249
6 Correct 190 ms 17156 KB n = 199910
7 Correct 189 ms 17660 KB n = 199999
8 Correct 188 ms 17160 KB n = 199997
9 Correct 197 ms 16288 KB n = 171294
10 Correct 155 ms 14888 KB n = 140872
11 Correct 203 ms 17256 KB n = 199886
12 Correct 197 ms 19084 KB n = 199996
13 Correct 190 ms 18632 KB n = 200000
14 Correct 216 ms 24256 KB n = 199998
15 Correct 214 ms 23112 KB n = 200000
16 Correct 227 ms 22896 KB n = 199998
17 Correct 212 ms 24052 KB n = 200000
18 Correct 203 ms 17640 KB n = 190000
19 Correct 185 ms 22228 KB n = 177777
20 Correct 96 ms 13032 KB n = 100000
21 Correct 222 ms 17796 KB n = 200000
22 Correct 264 ms 21108 KB n = 200000
23 Correct 255 ms 21184 KB n = 200000

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8012 KB n = 2
2 Correct 4 ms 8012 KB n = 2
3 Correct 4 ms 8012 KB n = 2
4 Correct 4 ms 8012 KB n = 2
5 Correct 4 ms 8012 KB n = 2
6 Correct 4 ms 8012 KB n = 2
7 Correct 4 ms 8012 KB n = 3
8 Correct 4 ms 8012 KB n = 3
9 Correct 4 ms 8084 KB n = 3
10 Correct 4 ms 8012 KB n = 8
11 Correct 4 ms 8012 KB n = 8
12 Correct 4 ms 8012 KB n = 8
13 Correct 4 ms 8012 KB n = 8
14 Correct 4 ms 8012 KB n = 8
15 Correct 4 ms 8012 KB n = 8
16 Correct 4 ms 8064 KB n = 8
17 Correct 4 ms 8012 KB n = 8
18 Correct 4 ms 8016 KB n = 8
19 Correct 4 ms 8120 KB n = 3
20 Correct 4 ms 8116 KB n = 7
21 Correct 4 ms 8012 KB n = 8
22 Correct 4 ms 8012 KB n = 8
23 Correct 4 ms 8016 KB n = 8
24 Correct 4 ms 8012 KB n = 8
25 Correct 4 ms 8012 KB n = 8
26 Correct 4 ms 8024 KB n = 8
27 Correct 4 ms 8012 KB n = 8
28 Correct 4 ms 8012 KB n = 8
29 Correct 4 ms 8012 KB n = 16
30 Correct 5 ms 8012 KB n = 16
31 Correct 4 ms 8012 KB n = 16
32 Correct 4 ms 8012 KB n = 16
33 Correct 4 ms 8012 KB n = 16
34 Correct 4 ms 8012 KB n = 16
35 Correct 4 ms 8012 KB n = 16
36 Correct 4 ms 8012 KB n = 15
37 Correct 4 ms 8012 KB n = 8
38 Correct 4 ms 8012 KB n = 16
39 Correct 4 ms 8012 KB n = 16
40 Correct 4 ms 8012 KB n = 9
41 Correct 4 ms 8012 KB n = 16
42 Correct 4 ms 8012 KB n = 16
43 Correct 4 ms 8012 KB n = 16
44 Correct 4 ms 8012 KB n = 9
45 Correct 4 ms 8012 KB n = 15
46 Correct 4 ms 8128 KB n = 16
47 Correct 4 ms 8012 KB n = 16
48 Correct 4 ms 8012 KB n = 16
49 Correct 227 ms 17964 KB n = 199999
50 Correct 252 ms 17728 KB n = 199991
51 Correct 236 ms 17728 KB n = 199993
52 Correct 168 ms 15528 KB n = 152076
53 Correct 96 ms 12724 KB n = 93249
54 Correct 190 ms 17156 KB n = 199910
55 Correct 189 ms 17660 KB n = 199999
56 Correct 188 ms 17160 KB n = 199997
57 Correct 197 ms 16288 KB n = 171294
58 Correct 155 ms 14888 KB n = 140872
59 Correct 203 ms 17256 KB n = 199886
60 Correct 197 ms 19084 KB n = 199996
61 Correct 190 ms 18632 KB n = 200000
62 Correct 216 ms 24256 KB n = 199998
63 Correct 214 ms 23112 KB n = 200000
64 Correct 227 ms 22896 KB n = 199998
65 Correct 212 ms 24052 KB n = 200000
66 Correct 203 ms 17640 KB n = 190000
67 Correct 185 ms 22228 KB n = 177777
68 Correct 96 ms 13032 KB n = 100000
69 Correct 222 ms 17796 KB n = 200000
70 Correct 264 ms 21108 KB n = 200000
71 Correct 255 ms 21184 KB n = 200000
72 Correct 231 ms 17656 KB n = 200000
73 Correct 233 ms 17656 KB n = 200000
74 Correct 236 ms 17836 KB n = 200000
75 Correct 208 ms 17612 KB n = 200000
76 Correct 208 ms 17776 KB n = 200000
77 Correct 161 ms 16256 KB n = 200000
78 Correct 191 ms 19664 KB n = 200000
79 Correct 209 ms 16896 KB n = 184307
80 Correct 74 ms 11828 KB n = 76040
81 Correct 194 ms 17324 KB n = 199981
82 Correct 195 ms 19116 KB n = 199994
83 Correct 188 ms 18732 KB n = 199996
84 Correct 217 ms 24312 KB n = 199998
85 Correct 211 ms 23132 KB n = 200000
86 Correct 224 ms 22956 KB n = 199998
87 Correct 208 ms 24000 KB n = 200000
88 Correct 208 ms 19008 KB n = 200000
89 Correct 205 ms 23872 KB n = 200000
90 Correct 209 ms 17668 KB n = 200000
91 Correct 305 ms 21224 KB n = 200000
92 Correct 257 ms 21184 KB n = 200000