oj.uz

답안 #856018

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
856018 2023-10-02T14:32:53 Z qin Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 501 ms 57848 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define ssize(x) int(x.size())
#define pn printf("\n");
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
int inf = 1e09; ll infll = 1e18;
struct DSU{
		vector<int> rep, sz;
		void init(int n){
				rep.resize(n+1), sz.resize(n+1, 1);
				for(int i = 1; i <= n; ++i) rep[i] = i;
		} int Find(int a){
				int b = a, c;
				while(a != rep[a]) a = rep[a];
				while(b != rep[b]) c = b, b = rep[b], rep[c] = a;
				return a;
		} void Union(int a, int b){
				a = Find(a), b = Find(b);
				if(a == b) return;
				if(sz[a] < sz[b]) swap(a, b);
				rep[b] = a, sz[a] += sz[b];
		}
} DSU;
struct edge{
		int a, b; ll c;
		edge(){}
		edge(int A, int B, ll C) : a(A), b(B), c(C) {}
		bool operator<(const edge &x) const{ return c < x.c; }
};
ll plan_roller_coaster(vector<int> s, vector<int> e){
		s.emplace_back(inf+1), e.emplace_back(1); // dodatkowa stacja
		int m = ssize(s), a, b; // m - ilosc stacji (poczatkowych kr. w grafie, n - ilosc wierzcholkow
		
		set<int> sc; unordered_map<int, int> mp; int n = 0; // skalowanie
		for(int i = 0; i < m; ++i) sc.emplace(s[i]), sc.emplace(e[i]);
		for(int i : sc) mp[i] = ++n;
		vector<int> def_val(n+1);
		for(int i = 0; i < m; ++i) a = mp[s[i]], b = mp[e[i]],
								   def_val[a] = s[i], s[i] = a, def_val[b] = e[i], e[i] = b;//, printf("%d %d\n", a, b);;
		
		DSU.init(n);
		ll result = 0;
		vector<int> pf_sum(n+1); // trzymamy w tym roznice miedzy krawedziami
		for(int i = 0; i < m; ++i) ++pf_sum[s[i]], --pf_sum[e[i]], DSU.Union(s[i], e[i]);//, printf("!%d %d\n", s[i], e[i]);
		for(int i = 1; i < n; ++i){
				pf_sum[i] += pf_sum[i-1];
				if(pf_sum[i] > 0) result += pf_sum[i] * ll(def_val[i+1]-def_val[i]); 
				if(pf_sum[i]) DSU.Union(i, i+1);//, printf("!%d %d\n", i, i+1);
		}// printf("%lld\n", result);
		
		//for(int i = 1; i <= n; ++i) printf("%d ", DSU.Find(i));
		//pn;
		
		vector<edge> MST; //MST
		for(int i = 1; i < n; ++i) if(DSU.Find(i) != DSU.Find(i+1)) MST.emplace_back(i, i+1, def_val[i+1]-def_val[i]);//, printf("%d %d\n", def_val[i], def_val[i+1]);
		sort(MST.begin(), MST.end());
		for(edge i : MST) if(DSU.Find(i.a) != DSU.Find(i.b)) DSU.Union(i.a, i.b), result += i.c;
		
		return result;
}
#ifdef LOCAL
int main(){
		int n; scanf("%d", &n);
		vector<int> s(n), e(n);
		for(int i = 0; i < n; ++i) scanf("%d%d", &s[i], &e[i]);
		printf("%lld\n", plan_roller_coaster(s, e));
		return 0;
}
#endif

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 419 ms 50468 KB n = 199999
2 Correct 420 ms 50736 KB n = 199991
3 Correct 422 ms 50448 KB n = 199993
4 Correct 237 ms 36504 KB n = 152076
5 Correct 129 ms 23952 KB n = 93249
6 Correct 273 ms 39632 KB n = 199910
7 Correct 302 ms 48812 KB n = 199999
8 Correct 251 ms 39868 KB n = 199997
9 Correct 295 ms 41116 KB n = 171294
10 Correct 222 ms 34332 KB n = 140872
11 Correct 269 ms 40408 KB n = 199886
12 Correct 309 ms 49376 KB n = 199996
13 Correct 232 ms 41440 KB n = 200000
14 Correct 309 ms 50736 KB n = 199998
15 Correct 264 ms 50084 KB n = 200000
16 Correct 314 ms 51752 KB n = 199998
17 Correct 386 ms 50568 KB n = 200000
18 Correct 346 ms 48400 KB n = 190000
19 Correct 318 ms 45460 KB n = 177777
20 Correct 120 ms 25436 KB n = 100000
21 Correct 380 ms 50508 KB n = 200000
22 Correct 362 ms 57648 KB n = 200000
23 Correct 400 ms 50468 KB n = 200000

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB n = 2
2 Correct 0 ms 348 KB n = 2
3 Correct 0 ms 348 KB n = 2
4 Correct 1 ms 348 KB n = 2
5 Correct 0 ms 348 KB n = 2
6 Correct 0 ms 348 KB n = 2
7 Correct 0 ms 348 KB n = 3
8 Correct 0 ms 440 KB n = 3
9 Correct 0 ms 348 KB n = 3
10 Correct 0 ms 348 KB n = 8
11 Correct 0 ms 348 KB n = 8
12 Correct 0 ms 348 KB n = 8
13 Correct 0 ms 348 KB n = 8
14 Correct 0 ms 348 KB n = 8
15 Correct 0 ms 436 KB n = 8
16 Correct 1 ms 348 KB n = 8
17 Correct 0 ms 348 KB n = 8
18 Correct 0 ms 348 KB n = 8
19 Correct 0 ms 348 KB n = 3
20 Correct 0 ms 348 KB n = 7
21 Correct 0 ms 348 KB n = 8
22 Correct 0 ms 348 KB n = 8
23 Correct 0 ms 348 KB n = 8
24 Correct 0 ms 348 KB n = 8
25 Correct 0 ms 348 KB n = 8
26 Correct 1 ms 436 KB n = 8
27 Correct 0 ms 348 KB n = 8
28 Correct 0 ms 348 KB n = 8
29 Correct 0 ms 348 KB n = 16
30 Correct 1 ms 436 KB n = 16
31 Correct 1 ms 344 KB n = 16
32 Correct 0 ms 348 KB n = 16
33 Correct 0 ms 344 KB n = 16
34 Correct 0 ms 348 KB n = 16
35 Correct 0 ms 432 KB n = 16
36 Correct 0 ms 348 KB n = 15
37 Correct 0 ms 344 KB n = 8
38 Correct 0 ms 344 KB n = 16
39 Correct 0 ms 348 KB n = 16
40 Correct 0 ms 348 KB n = 9
41 Correct 0 ms 348 KB n = 16
42 Correct 1 ms 348 KB n = 16
43 Correct 0 ms 348 KB n = 16
44 Correct 1 ms 348 KB n = 9
45 Correct 1 ms 348 KB n = 15
46 Correct 0 ms 348 KB n = 16
47 Correct 5 ms 348 KB n = 16
48 Correct 0 ms 348 KB n = 16
49 Correct 419 ms 50468 KB n = 199999
50 Correct 420 ms 50736 KB n = 199991
51 Correct 422 ms 50448 KB n = 199993
52 Correct 237 ms 36504 KB n = 152076
53 Correct 129 ms 23952 KB n = 93249
54 Correct 273 ms 39632 KB n = 199910
55 Correct 302 ms 48812 KB n = 199999
56 Correct 251 ms 39868 KB n = 199997
57 Correct 295 ms 41116 KB n = 171294
58 Correct 222 ms 34332 KB n = 140872
59 Correct 269 ms 40408 KB n = 199886
60 Correct 309 ms 49376 KB n = 199996
61 Correct 232 ms 41440 KB n = 200000
62 Correct 309 ms 50736 KB n = 199998
63 Correct 264 ms 50084 KB n = 200000
64 Correct 314 ms 51752 KB n = 199998
65 Correct 386 ms 50568 KB n = 200000
66 Correct 346 ms 48400 KB n = 190000
67 Correct 318 ms 45460 KB n = 177777
68 Correct 120 ms 25436 KB n = 100000
69 Correct 380 ms 50508 KB n = 200000
70 Correct 362 ms 57648 KB n = 200000
71 Correct 400 ms 50468 KB n = 200000
72 Correct 472 ms 50520 KB n = 200000
73 Correct 384 ms 50344 KB n = 200000
74 Correct 383 ms 50660 KB n = 200000
75 Correct 354 ms 50468 KB n = 200000
76 Correct 352 ms 50512 KB n = 200000
77 Correct 157 ms 28908 KB n = 200000
78 Correct 174 ms 36844 KB n = 200000
79 Correct 342 ms 46772 KB n = 184307
80 Correct 89 ms 18704 KB n = 76040
81 Correct 261 ms 40424 KB n = 199981
82 Correct 326 ms 49344 KB n = 199994
83 Correct 254 ms 41448 KB n = 199996
84 Correct 264 ms 50820 KB n = 199998
85 Correct 266 ms 50076 KB n = 200000
86 Correct 316 ms 51884 KB n = 199998
87 Correct 364 ms 50468 KB n = 200000
88 Correct 445 ms 50432 KB n = 200000
89 Correct 438 ms 50480 KB n = 200000
90 Correct 444 ms 50384 KB n = 200000
91 Correct 459 ms 57848 KB n = 200000
92 Correct 501 ms 50480 KB n = 200000