oj.uz

답안 #188170

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
188170 2020-01-13T06:22:10 Z oolimry Roller Coaster Railroad (IOI16_railroad) C++14
100 / 100
 330 ms 20916 KB 
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;

long long balance[400005]; int p[400005];
vector<pair<int, pair<int,int> > > edges;

int findSet(int u){
	if(u == p[u]) return u;
	else return p[u] = findSet(p[u]);
}

bool unionSet(int u, int v){
	int x = findSet(u);
	int y = findSet(v);
	if(x == y) return false;
	p[x] = y;
	return true;
}

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
	s.push_back(2e9); t.push_back(1);
    int n = (int) s.size();
	
    vector<long long> points;
    for(int i = 0;i < n;i++) points.push_back(s[i]), points.push_back(t[i]);
    
    sort(points.begin(),points.end());
    points.erase(unique(points.begin(),points.end()), points.end());
    for(int i = 0;i < (int) points.size();i++) p[i] = i;
    
    for(int i = 0;i < n;i++){
		s[i] = lower_bound(points.begin(),points.end(),s[i]) - points.begin();
		t[i] = lower_bound(points.begin(),points.end(),t[i]) - points.begin();
		balance[s[i]]++;
		balance[t[i]]--;
		unionSet(s[i],t[i]);
	}
	
	long long ans = 0, acc = 0;
	for(int i = 0;i < (int) points.size() - 1;i++){
		acc += balance[i];
		if(acc == 0) edges.push_back({points[i+1] - points[i], {i, i+1}});
		else{
			unionSet(i,i+1);
			if(acc > 0) ans += (points[i+1] - points[i]) * acc;
		}
	}
	sort(edges.begin(),edges.end());
	for(auto& e : edges){
		if(unionSet(e.second.first,e.second.second)){
			ans += e.first;
		}
	}
    return ans;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 306 ms 16232 KB n = 199999
2 Correct 283 ms 16204 KB n = 199991
3 Correct 254 ms 16220 KB n = 199993
4 Correct 200 ms 12528 KB n = 152076
5 Correct 104 ms 7804 KB n = 93249
6 Correct 215 ms 14276 KB n = 199910
7 Correct 218 ms 15828 KB n = 199999
8 Correct 204 ms 14736 KB n = 199997
9 Correct 214 ms 14076 KB n = 171294
10 Correct 167 ms 11008 KB n = 140872
11 Correct 213 ms 14392 KB n = 199886
12 Correct 302 ms 16108 KB n = 199996
13 Correct 214 ms 15172 KB n = 200000
14 Correct 240 ms 20892 KB n = 199998
15 Correct 236 ms 20160 KB n = 200000
16 Correct 258 ms 20672 KB n = 199998
17 Correct 298 ms 19320 KB n = 200000
18 Correct 241 ms 15680 KB n = 190000
19 Correct 207 ms 17348 KB n = 177777
20 Correct 108 ms 8352 KB n = 100000
21 Correct 232 ms 16312 KB n = 200000
22 Correct 305 ms 20724 KB n = 200000
23 Correct 286 ms 20660 KB n = 200000

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB n = 2
2 Correct 2 ms 376 KB n = 2
3 Correct 2 ms 376 KB n = 2
4 Correct 2 ms 376 KB n = 2
5 Correct 3 ms 376 KB n = 2
6 Correct 2 ms 376 KB n = 2
7 Correct 8 ms 408 KB n = 3
8 Correct 2 ms 404 KB n = 3
9 Correct 2 ms 376 KB n = 3
10 Correct 2 ms 376 KB n = 8
11 Correct 10 ms 376 KB n = 8
12 Correct 1 ms 376 KB n = 8
13 Correct 0 ms 376 KB n = 8
14 Correct 2 ms 376 KB n = 8
15 Correct 2 ms 252 KB n = 8
16 Correct 4 ms 404 KB n = 8
17 Correct 0 ms 376 KB n = 8
18 Correct 2 ms 348 KB n = 8
19 Correct 2 ms 376 KB n = 3
20 Correct 3 ms 420 KB n = 7
21 Correct 3 ms 376 KB n = 8
22 Correct 2 ms 376 KB n = 8
23 Correct 0 ms 376 KB n = 8
24 Correct 2 ms 380 KB n = 8
25 Correct 2 ms 376 KB n = 8
26 Correct 2 ms 376 KB n = 8
27 Correct 2 ms 376 KB n = 8
28 Correct 2 ms 376 KB n = 8
29 Correct 2 ms 448 KB n = 16
30 Correct 2 ms 376 KB n = 16
31 Correct 10 ms 376 KB n = 16
32 Correct 2 ms 376 KB n = 16
33 Correct 2 ms 376 KB n = 16
34 Correct 7 ms 376 KB n = 16
35 Correct 2 ms 376 KB n = 16
36 Correct 2 ms 368 KB n = 15
37 Correct 2 ms 400 KB n = 8
38 Correct 2 ms 376 KB n = 16
39 Correct 2 ms 376 KB n = 16
40 Correct 2 ms 376 KB n = 9
41 Correct 2 ms 376 KB n = 16
42 Correct 3 ms 376 KB n = 16
43 Correct 3 ms 376 KB n = 16
44 Correct 3 ms 376 KB n = 9
45 Correct 2 ms 376 KB n = 15
46 Correct 2 ms 348 KB n = 16
47 Correct 2 ms 348 KB n = 16
48 Correct 3 ms 376 KB n = 16
49 Correct 306 ms 16232 KB n = 199999
50 Correct 283 ms 16204 KB n = 199991
51 Correct 254 ms 16220 KB n = 199993
52 Correct 200 ms 12528 KB n = 152076
53 Correct 104 ms 7804 KB n = 93249
54 Correct 215 ms 14276 KB n = 199910
55 Correct 218 ms 15828 KB n = 199999
56 Correct 204 ms 14736 KB n = 199997
57 Correct 214 ms 14076 KB n = 171294
58 Correct 167 ms 11008 KB n = 140872
59 Correct 213 ms 14392 KB n = 199886
60 Correct 302 ms 16108 KB n = 199996
61 Correct 214 ms 15172 KB n = 200000
62 Correct 240 ms 20892 KB n = 199998
63 Correct 236 ms 20160 KB n = 200000
64 Correct 258 ms 20672 KB n = 199998
65 Correct 298 ms 19320 KB n = 200000
66 Correct 241 ms 15680 KB n = 190000
67 Correct 207 ms 17348 KB n = 177777
68 Correct 108 ms 8352 KB n = 100000
69 Correct 232 ms 16312 KB n = 200000
70 Correct 305 ms 20724 KB n = 200000
71 Correct 286 ms 20660 KB n = 200000
72 Correct 267 ms 16300 KB n = 200000
73 Correct 265 ms 16260 KB n = 200000
74 Correct 290 ms 16204 KB n = 200000
75 Correct 237 ms 16268 KB n = 200000
76 Correct 239 ms 16160 KB n = 200000
77 Correct 182 ms 17012 KB n = 200000
78 Correct 227 ms 18292 KB n = 200000
79 Correct 246 ms 14940 KB n = 184307
80 Correct 90 ms 6192 KB n = 76040
81 Correct 213 ms 14376 KB n = 199981
82 Correct 230 ms 16092 KB n = 199994
83 Correct 199 ms 15116 KB n = 199996
84 Correct 238 ms 20916 KB n = 199998
85 Correct 237 ms 20216 KB n = 200000
86 Correct 258 ms 20628 KB n = 199998
87 Correct 243 ms 19328 KB n = 200000
88 Correct 278 ms 16872 KB n = 200000
89 Correct 247 ms 19356 KB n = 200000
90 Correct 235 ms 16244 KB n = 200000
91 Correct 330 ms 20648 KB n = 200000
92 Correct 293 ms 20616 KB n = 200000