oj.uz

Submission #292254

# Submission time Handle Problem Language Result Execution time Memory
292254 2020-09-06T15:59:16 Z tmwilliamlin168 Roller Coaster Railroad (IOI16_railroad) C++14
100 / 100
 293 ms 21556 KB 
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;

const int mxN=4e5;
int a[mxN], p[mxN];
array<int, 2> e[mxN];

int find(int x) {
	return x^p[x]?p[x]=find(p[x]):x;
}

bool join(int x, int y) {
	if((x=find(x))==(y=find(y)))
		return 0;
	p[x]=y;
	return 1;
}

long long plan_roller_coaster(vector<int> s, vector<int> t) {
	int n=s.size();
	vector<int> x=s;
	x.insert(x.end(), t.begin(), t.end());
	sort(x.begin(), x.end());
	iota(p, p+x.size(), 0);
	for(int i=0; i<n; ++i) {
		s[i]=lower_bound(x.begin(), x.end(), s[i])-x.begin();
		t[i]=lower_bound(x.begin(), x.end(), t[i])-x.begin();
		++a[s[i]];
		--a[t[i]];
		join(s[i], t[i]);
	}
	long long ans=0;
	for(int i=0; i+1<x.size(); ++i) {
		a[i+1]+=a[i];
		ans+=(long long)(x[i+1]-x[i])*max(a[i]-1, 0);
		if(a[i]^1)
			join(i, i+1);
		e[i]={x[i+1]-x[i], i};
	}
	sort(e, e+x.size()-1);
	for(int i=0; i<x.size()-1; ++i)
		if(join(e[i][1], e[i][1]+1))
			ans+=e[i][0];
	return ans;
}

Compilation message

railroad.cpp: In function 'long long int plan_roller_coaster(std::vector<int>, std::vector<int>)':
railroad.cpp:34:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |  for(int i=0; i+1<x.size(); ++i) {
      |               ~~~^~~~~~~~~
railroad.cpp:42:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |  for(int i=0; i<x.size()-1; ++i)
      |               ~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB n = 2
2 Correct 0 ms 384 KB n = 2
3 Correct 0 ms 384 KB n = 2
4 Correct 0 ms 384 KB n = 2
5 Correct 0 ms 384 KB n = 2
6 Correct 0 ms 384 KB n = 2
7 Correct 0 ms 384 KB n = 3
8 Correct 0 ms 384 KB n = 3
9 Correct 0 ms 384 KB n = 3
10 Correct 0 ms 256 KB n = 8
11 Correct 0 ms 384 KB n = 8
12 Correct 0 ms 384 KB n = 8
13 Correct 1 ms 384 KB n = 8
14 Correct 1 ms 384 KB n = 8
15 Correct 0 ms 384 KB n = 8
16 Correct 0 ms 384 KB n = 8
17 Correct 0 ms 384 KB n = 8
18 Correct 0 ms 384 KB n = 8
19 Correct 0 ms 384 KB n = 3
20 Correct 0 ms 384 KB n = 7
21 Correct 1 ms 384 KB n = 8
22 Correct 0 ms 384 KB n = 8
23 Correct 0 ms 384 KB n = 8
24 Correct 0 ms 384 KB n = 8
25 Correct 0 ms 384 KB n = 8

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB n = 2
2 Correct 0 ms 384 KB n = 2
3 Correct 0 ms 384 KB n = 2
4 Correct 0 ms 384 KB n = 2
5 Correct 0 ms 384 KB n = 2
6 Correct 0 ms 384 KB n = 2
7 Correct 0 ms 384 KB n = 3
8 Correct 0 ms 384 KB n = 3
9 Correct 0 ms 384 KB n = 3
10 Correct 0 ms 256 KB n = 8
11 Correct 0 ms 384 KB n = 8
12 Correct 0 ms 384 KB n = 8
13 Correct 1 ms 384 KB n = 8
14 Correct 1 ms 384 KB n = 8
15 Correct 0 ms 384 KB n = 8
16 Correct 0 ms 384 KB n = 8
17 Correct 0 ms 384 KB n = 8
18 Correct 0 ms 384 KB n = 8
19 Correct 0 ms 384 KB n = 3
20 Correct 0 ms 384 KB n = 7
21 Correct 1 ms 384 KB n = 8
22 Correct 0 ms 384 KB n = 8
23 Correct 0 ms 384 KB n = 8
24 Correct 0 ms 384 KB n = 8
25 Correct 0 ms 384 KB n = 8
26 Correct 1 ms 384 KB n = 8
27 Correct 0 ms 384 KB n = 8
28 Correct 0 ms 384 KB n = 8
29 Correct 0 ms 384 KB n = 16
30 Correct 1 ms 384 KB n = 16
31 Correct 0 ms 384 KB n = 16
32 Correct 1 ms 384 KB n = 16
33 Correct 0 ms 384 KB n = 16
34 Correct 1 ms 384 KB n = 16
35 Correct 0 ms 384 KB n = 16
36 Correct 1 ms 384 KB n = 15
37 Correct 0 ms 384 KB n = 8
38 Correct 0 ms 384 KB n = 16
39 Correct 1 ms 384 KB n = 16
40 Correct 0 ms 384 KB n = 9
41 Correct 1 ms 384 KB n = 16
42 Correct 1 ms 384 KB n = 16
43 Correct 1 ms 384 KB n = 16
44 Correct 0 ms 384 KB n = 9
45 Correct 1 ms 256 KB n = 15
46 Correct 1 ms 384 KB n = 16
47 Correct 0 ms 384 KB n = 16
48 Correct 1 ms 384 KB n = 16

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 278 ms 11240 KB n = 199999
2 Correct 292 ms 15208 KB n = 199991
3 Correct 282 ms 15220 KB n = 199993
4 Correct 203 ms 11300 KB n = 152076
5 Correct 121 ms 7256 KB n = 93249
6 Correct 260 ms 14088 KB n = 199910
7 Correct 249 ms 14952 KB n = 199999
8 Correct 245 ms 14696 KB n = 199997
9 Correct 239 ms 12888 KB n = 171294
10 Correct 190 ms 10832 KB n = 140872
11 Correct 252 ms 14056 KB n = 199886
12 Correct 258 ms 15080 KB n = 199996
13 Correct 246 ms 14824 KB n = 200000
14 Correct 262 ms 16232 KB n = 199998
15 Correct 259 ms 15592 KB n = 200000
16 Correct 270 ms 15720 KB n = 199998
17 Correct 270 ms 18280 KB n = 200000
18 Correct 253 ms 14608 KB n = 190000
19 Correct 238 ms 16412 KB n = 177777
20 Correct 127 ms 7792 KB n = 100000
21 Correct 270 ms 15208 KB n = 200000
22 Correct 264 ms 15336 KB n = 200000
23 Correct 256 ms 15084 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB n = 2
2 Correct 0 ms 384 KB n = 2
3 Correct 0 ms 384 KB n = 2
4 Correct 0 ms 384 KB n = 2
5 Correct 0 ms 384 KB n = 2
6 Correct 0 ms 384 KB n = 2
7 Correct 0 ms 384 KB n = 3
8 Correct 0 ms 384 KB n = 3
9 Correct 0 ms 384 KB n = 3
10 Correct 0 ms 256 KB n = 8
11 Correct 0 ms 384 KB n = 8
12 Correct 0 ms 384 KB n = 8
13 Correct 1 ms 384 KB n = 8
14 Correct 1 ms 384 KB n = 8
15 Correct 0 ms 384 KB n = 8
16 Correct 0 ms 384 KB n = 8
17 Correct 0 ms 384 KB n = 8
18 Correct 0 ms 384 KB n = 8
19 Correct 0 ms 384 KB n = 3
20 Correct 0 ms 384 KB n = 7
21 Correct 1 ms 384 KB n = 8
22 Correct 0 ms 384 KB n = 8
23 Correct 0 ms 384 KB n = 8
24 Correct 0 ms 384 KB n = 8
25 Correct 0 ms 384 KB n = 8
26 Correct 1 ms 384 KB n = 8
27 Correct 0 ms 384 KB n = 8
28 Correct 0 ms 384 KB n = 8
29 Correct 0 ms 384 KB n = 16
30 Correct 1 ms 384 KB n = 16
31 Correct 0 ms 384 KB n = 16
32 Correct 1 ms 384 KB n = 16
33 Correct 0 ms 384 KB n = 16
34 Correct 1 ms 384 KB n = 16
35 Correct 0 ms 384 KB n = 16
36 Correct 1 ms 384 KB n = 15
37 Correct 0 ms 384 KB n = 8
38 Correct 0 ms 384 KB n = 16
39 Correct 1 ms 384 KB n = 16
40 Correct 0 ms 384 KB n = 9
41 Correct 1 ms 384 KB n = 16
42 Correct 1 ms 384 KB n = 16
43 Correct 1 ms 384 KB n = 16
44 Correct 0 ms 384 KB n = 9
45 Correct 1 ms 256 KB n = 15
46 Correct 1 ms 384 KB n = 16
47 Correct 0 ms 384 KB n = 16
48 Correct 1 ms 384 KB n = 16
49 Correct 278 ms 11240 KB n = 199999
50 Correct 292 ms 15208 KB n = 199991
51 Correct 282 ms 15220 KB n = 199993
52 Correct 203 ms 11300 KB n = 152076
53 Correct 121 ms 7256 KB n = 93249
54 Correct 260 ms 14088 KB n = 199910
55 Correct 249 ms 14952 KB n = 199999
56 Correct 245 ms 14696 KB n = 199997
57 Correct 239 ms 12888 KB n = 171294
58 Correct 190 ms 10832 KB n = 140872
59 Correct 252 ms 14056 KB n = 199886
60 Correct 258 ms 15080 KB n = 199996
61 Correct 246 ms 14824 KB n = 200000
62 Correct 262 ms 16232 KB n = 199998
63 Correct 259 ms 15592 KB n = 200000
64 Correct 270 ms 15720 KB n = 199998
65 Correct 270 ms 18280 KB n = 200000
66 Correct 253 ms 14608 KB n = 190000
67 Correct 238 ms 16412 KB n = 177777
68 Correct 127 ms 7792 KB n = 100000
69 Correct 270 ms 15208 KB n = 200000
70 Correct 264 ms 15336 KB n = 200000
71 Correct 256 ms 15084 KB n = 200000
72 Correct 282 ms 15340 KB n = 200000
73 Correct 293 ms 15240 KB n = 200000
74 Correct 290 ms 15116 KB n = 200000
75 Correct 266 ms 15336 KB n = 200000
76 Correct 262 ms 15208 KB n = 200000
77 Correct 252 ms 21556 KB n = 200000
78 Correct 236 ms 15208 KB n = 200000
79 Correct 262 ms 13864 KB n = 184307
80 Correct 97 ms 5964 KB n = 76040
81 Correct 255 ms 14088 KB n = 199981
82 Correct 252 ms 15080 KB n = 199994
83 Correct 246 ms 15024 KB n = 199996
84 Correct 259 ms 16240 KB n = 199998
85 Correct 264 ms 15848 KB n = 200000
86 Correct 262 ms 15720 KB n = 199998
87 Correct 260 ms 18280 KB n = 200000
88 Correct 269 ms 15996 KB n = 200000
89 Correct 273 ms 18280 KB n = 200000
90 Correct 276 ms 15208 KB n = 200000
91 Correct 268 ms 15208 KB n = 200000
92 Correct 265 ms 15208 KB n = 200000