oj.uz

답안 #430352

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
430352 2021-06-16T13:05:46 Z b00n0rp Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 1254 ms 55800 KB 
#include "railroad.h"
#include<bits/stdc++.h>
using namespace std;
 
#define ll long long
#define REP(i,n) for(int i = 0; i < n; i ++)
#define FOR(i,a,b) for(int i = a; i < b; i ++)
#define vi vector<int>
#define pb push_back
#define pii pair<int,int>
#define F first
#define S second
#define mii unordered_map<int,int>
#define SZ(v) (int)v.size()
 
const int MX = 200005;
 
int n;
mii flux;
mii par;
 
int find(int u){
	if(par[u] == u) return u;
	return par[u] = find(par[u]);
}
 
void merge(int u,int v){
	u = find(u);
	v = find(v);
	if(rand()%2) swap(u,v);
	par[u] = v;
}
 
ll plan_roller_coaster(vi s, vi t){
	s.pb(1000000000);
	t.pb(1);
    n = SZ(s);
    REP(i,n){
    	par[s[i]] = s[i];
    	par[t[i]] = t[i];
    }
    REP(i,n){
    	flux[s[i]]++;
    	flux[t[i]]--;
    	merge(s[i],t[i]);
    }
    vector<pii> gg;
    for(auto x:flux){
    	gg.pb(x);
    }
    sort(gg.begin(),gg.end());
    ll ans = 0,cur = 0;
    vector<pair<int,pii> > edges;
    REP(i,SZ(gg)-1){
    	cur += gg[i].S;
    	if(cur < 0){
    		merge(gg[i].F,gg[i+1].F);
    	}
    	else if(cur == 0){
    		edges.pb({gg[i+1].F-gg[i].F,{gg[i].F,gg[i+1].F}});
    	}
    	else{
    		ans += cur*(gg[i+1].F-gg[i].F);
    		merge(gg[i].F,gg[i+1].F);
    	}
    }
    sort(edges.begin(),edges.end());
    for(auto x:edges){
    	if(find(x.S.F) != find(x.S.S)){
    		ans += x.F;
    		merge(x.S.F,x.S.S);
    	}
    }
    return ans;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1040 ms 47252 KB n = 199999
2 Correct 1004 ms 50976 KB n = 199991
3 Correct 1014 ms 50984 KB n = 199993
4 Correct 648 ms 36036 KB n = 152076
5 Correct 333 ms 24692 KB n = 93249
6 Correct 564 ms 38216 KB n = 199910
7 Correct 742 ms 50928 KB n = 199999
8 Correct 569 ms 38392 KB n = 199997
9 Correct 731 ms 39244 KB n = 171294
10 Correct 594 ms 34436 KB n = 140872
11 Correct 566 ms 38748 KB n = 199886
12 Correct 809 ms 51224 KB n = 199996
13 Correct 617 ms 39508 KB n = 200000
14 Correct 907 ms 55048 KB n = 199998
15 Correct 874 ms 53792 KB n = 200000
16 Correct 1012 ms 54440 KB n = 199998
17 Correct 898 ms 55708 KB n = 200000
18 Correct 852 ms 50060 KB n = 190000
19 Correct 834 ms 51564 KB n = 177777
20 Correct 322 ms 25680 KB n = 100000
21 Correct 929 ms 50956 KB n = 200000
22 Correct 1254 ms 53284 KB n = 200000
23 Correct 1196 ms 53168 KB n = 200000

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB n = 2
2 Correct 1 ms 204 KB n = 2
3 Correct 1 ms 204 KB n = 2
4 Correct 1 ms 204 KB n = 2
5 Correct 1 ms 292 KB n = 2
6 Correct 0 ms 204 KB n = 2
7 Correct 0 ms 204 KB n = 3
8 Correct 1 ms 204 KB n = 3
9 Correct 1 ms 204 KB n = 3
10 Correct 1 ms 204 KB n = 8
11 Correct 1 ms 204 KB n = 8
12 Correct 1 ms 204 KB n = 8
13 Correct 1 ms 204 KB n = 8
14 Correct 1 ms 204 KB n = 8
15 Correct 1 ms 204 KB n = 8
16 Correct 1 ms 204 KB n = 8
17 Correct 0 ms 204 KB n = 8
18 Correct 1 ms 204 KB n = 8
19 Correct 1 ms 204 KB n = 3
20 Correct 1 ms 204 KB n = 7
21 Correct 1 ms 204 KB n = 8
22 Correct 1 ms 204 KB n = 8
23 Correct 1 ms 204 KB n = 8
24 Correct 1 ms 204 KB n = 8
25 Correct 1 ms 204 KB n = 8
26 Correct 1 ms 204 KB n = 8
27 Correct 1 ms 204 KB n = 8
28 Correct 1 ms 204 KB n = 8
29 Correct 1 ms 204 KB n = 16
30 Correct 1 ms 204 KB n = 16
31 Correct 1 ms 204 KB n = 16
32 Correct 1 ms 204 KB n = 16
33 Correct 1 ms 204 KB n = 16
34 Correct 0 ms 204 KB n = 16
35 Correct 1 ms 204 KB n = 16
36 Correct 1 ms 204 KB n = 15
37 Correct 1 ms 204 KB n = 8
38 Correct 1 ms 204 KB n = 16
39 Correct 1 ms 204 KB n = 16
40 Correct 1 ms 204 KB n = 9
41 Correct 1 ms 204 KB n = 16
42 Correct 1 ms 204 KB n = 16
43 Correct 1 ms 204 KB n = 16
44 Correct 1 ms 204 KB n = 9
45 Correct 1 ms 204 KB n = 15
46 Correct 1 ms 204 KB n = 16
47 Correct 1 ms 204 KB n = 16
48 Correct 1 ms 204 KB n = 16
49 Correct 1040 ms 47252 KB n = 199999
50 Correct 1004 ms 50976 KB n = 199991
51 Correct 1014 ms 50984 KB n = 199993
52 Correct 648 ms 36036 KB n = 152076
53 Correct 333 ms 24692 KB n = 93249
54 Correct 564 ms 38216 KB n = 199910
55 Correct 742 ms 50928 KB n = 199999
56 Correct 569 ms 38392 KB n = 199997
57 Correct 731 ms 39244 KB n = 171294
58 Correct 594 ms 34436 KB n = 140872
59 Correct 566 ms 38748 KB n = 199886
60 Correct 809 ms 51224 KB n = 199996
61 Correct 617 ms 39508 KB n = 200000
62 Correct 907 ms 55048 KB n = 199998
63 Correct 874 ms 53792 KB n = 200000
64 Correct 1012 ms 54440 KB n = 199998
65 Correct 898 ms 55708 KB n = 200000
66 Correct 852 ms 50060 KB n = 190000
67 Correct 834 ms 51564 KB n = 177777
68 Correct 322 ms 25680 KB n = 100000
69 Correct 929 ms 50956 KB n = 200000
70 Correct 1254 ms 53284 KB n = 200000
71 Correct 1196 ms 53168 KB n = 200000
72 Correct 1066 ms 50916 KB n = 200000
73 Correct 1071 ms 50940 KB n = 200000
74 Correct 1060 ms 50932 KB n = 200000
75 Correct 871 ms 50876 KB n = 200000
76 Correct 919 ms 50916 KB n = 200000
77 Correct 483 ms 33860 KB n = 200000
78 Correct 505 ms 32264 KB n = 200000
79 Correct 874 ms 48020 KB n = 184307
80 Correct 222 ms 18340 KB n = 76040
81 Correct 570 ms 38760 KB n = 199981
82 Correct 768 ms 51220 KB n = 199994
83 Correct 623 ms 39564 KB n = 199996
84 Correct 932 ms 54896 KB n = 199998
85 Correct 875 ms 53836 KB n = 200000
86 Correct 1097 ms 54484 KB n = 199998
87 Correct 885 ms 55596 KB n = 200000
88 Correct 859 ms 51820 KB n = 200000
89 Correct 893 ms 55800 KB n = 200000
90 Correct 868 ms 50964 KB n = 200000
91 Correct 1143 ms 53312 KB n = 200000
92 Correct 1181 ms 53288 KB n = 200000