oj.uz

Submission #284342

# Submission time Handle Problem Language Result Execution time Memory
284342 2020-08-27T09:00:15 Z user202729 Roller Coaster Railroad (IOI16_railroad) C++17
100 / 100
 257 ms 18552 KB 
// moreflags=grader.cpp
#include "railroad.h"
// 16
// is this cheating?...
// again, I should have solved this problem earlier.

#include<algorithm>
#include<numeric>
#if not LOCAL
#define NDEBUG 1
#endif
#include<cassert>

struct Dsu{
	std::vector<int> data;
	Dsu(int number): data(number){
		while(number--) data[number]=number;
	}
	void join(int first, int sec){
		first=root(first); sec=root(sec);
		data[first]=sec;
	}
	int root(int node){
		return data[node]!=node? data[node]=root(data[node]): node;
	}
};

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
	std::vector<int> values; values.reserve(s.size()+t.size());
	for(auto it: s) values.push_back(it);
	for(auto it: t) values.push_back(it);

	std::sort(begin(values), end(values));
	values.resize(std::unique(begin(values), end(values))-values.begin());

	std::vector<int> degree(values.size());
	Dsu dsu((int)values.size());
	for(int i=0; i<(int)s.size(); ++i){
		auto const a=int(std::lower_bound(begin(values), end(values), s[i])-begin(values));
		auto const b=int(std::lower_bound(begin(values), end(values), t[i])-begin(values));
		degree[a]++;
		degree[b]--;
		dsu.join(a, b);
	}
	degree[0]--; // add a huge edge downward
	dsu.join(0, (int)values.size()-1);

	std::partial_sum(begin(degree), end(degree), degree.begin());
	degree.pop_back();

	struct Edge{int len, first, sec;};
	std::vector<Edge> pending;

	int64_t result{};
	for(int index=0; index<(int)degree.size(); ++index){
		auto const edgeLen=values[index+1]-values[index];
		if(degree[index]>0)
			result+=int64_t(edgeLen)*degree[index];
		if(degree[index]!=0)
			dsu.join(index, index+1);
		else if(dsu.root(index)!=dsu.root(index+1))
			pending.push_back({edgeLen, index, index+1});
	}

	std::sort(begin(pending), end(pending),[&](Edge first, Edge sec){return first.len<sec.len;});
	for(auto [len, first, sec]: pending) if(dsu.root(first)!=dsu.root(sec)){
		dsu.join(first, sec);
		result+=len;
	}

	for(int i=0; i<(int)dsu.data.size(); ++i)
		assert(dsu.root(i)==dsu.root(0));

	return result;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 222 ms 12152 KB n = 199999
2 Correct 208 ms 12024 KB n = 199991
3 Correct 207 ms 12024 KB n = 199993
4 Correct 153 ms 9080 KB n = 152076
5 Correct 99 ms 5852 KB n = 93249
6 Correct 195 ms 10392 KB n = 199910
7 Correct 186 ms 12280 KB n = 199999
8 Correct 173 ms 11256 KB n = 199997
9 Correct 177 ms 10232 KB n = 171294
10 Correct 144 ms 8556 KB n = 140872
11 Correct 188 ms 10492 KB n = 199886
12 Correct 181 ms 12856 KB n = 199996
13 Correct 189 ms 12092 KB n = 200000
14 Correct 184 ms 16108 KB n = 199998
15 Correct 204 ms 14828 KB n = 200000
16 Correct 205 ms 15004 KB n = 199998
17 Correct 194 ms 18552 KB n = 200000
18 Correct 187 ms 12024 KB n = 190000
19 Correct 177 ms 16376 KB n = 177777
20 Correct 91 ms 6136 KB n = 100000
21 Correct 197 ms 12024 KB n = 200000
22 Correct 257 ms 15212 KB n = 200000
23 Correct 233 ms 15336 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB n = 2
2 Correct 0 ms 256 KB n = 2
3 Correct 0 ms 256 KB n = 2
4 Correct 1 ms 256 KB n = 2
5 Correct 0 ms 256 KB n = 2
6 Correct 0 ms 256 KB n = 2
7 Correct 0 ms 256 KB n = 3
8 Correct 0 ms 256 KB n = 3
9 Correct 0 ms 256 KB n = 3
10 Correct 0 ms 360 KB n = 8
11 Correct 0 ms 256 KB n = 8
12 Correct 0 ms 256 KB n = 8
13 Correct 0 ms 256 KB n = 8
14 Correct 0 ms 384 KB n = 8
15 Correct 0 ms 256 KB n = 8
16 Correct 1 ms 256 KB n = 8
17 Correct 0 ms 256 KB n = 8
18 Correct 0 ms 256 KB n = 8
19 Correct 0 ms 256 KB n = 3
20 Correct 1 ms 256 KB n = 7
21 Correct 1 ms 256 KB n = 8
22 Correct 0 ms 256 KB n = 8
23 Correct 0 ms 256 KB n = 8
24 Correct 0 ms 256 KB n = 8
25 Correct 0 ms 256 KB n = 8
26 Correct 1 ms 256 KB n = 8
27 Correct 1 ms 256 KB n = 8
28 Correct 1 ms 256 KB n = 8
29 Correct 1 ms 256 KB n = 16
30 Correct 0 ms 384 KB n = 16
31 Correct 0 ms 256 KB n = 16
32 Correct 1 ms 256 KB n = 16
33 Correct 1 ms 256 KB n = 16
34 Correct 0 ms 256 KB n = 16
35 Correct 0 ms 256 KB n = 16
36 Correct 1 ms 256 KB n = 15
37 Correct 0 ms 256 KB n = 8
38 Correct 1 ms 256 KB n = 16
39 Correct 0 ms 256 KB n = 16
40 Correct 0 ms 256 KB n = 9
41 Correct 0 ms 256 KB n = 16
42 Correct 0 ms 256 KB n = 16
43 Correct 0 ms 256 KB n = 16
44 Correct 0 ms 256 KB n = 9
45 Correct 0 ms 256 KB n = 15
46 Correct 0 ms 256 KB n = 16
47 Correct 0 ms 256 KB n = 16
48 Correct 0 ms 256 KB n = 16
49 Correct 222 ms 12152 KB n = 199999
50 Correct 208 ms 12024 KB n = 199991
51 Correct 207 ms 12024 KB n = 199993
52 Correct 153 ms 9080 KB n = 152076
53 Correct 99 ms 5852 KB n = 93249
54 Correct 195 ms 10392 KB n = 199910
55 Correct 186 ms 12280 KB n = 199999
56 Correct 173 ms 11256 KB n = 199997
57 Correct 177 ms 10232 KB n = 171294
58 Correct 144 ms 8556 KB n = 140872
59 Correct 188 ms 10492 KB n = 199886
60 Correct 181 ms 12856 KB n = 199996
61 Correct 189 ms 12092 KB n = 200000
62 Correct 184 ms 16108 KB n = 199998
63 Correct 204 ms 14828 KB n = 200000
64 Correct 205 ms 15004 KB n = 199998
65 Correct 194 ms 18552 KB n = 200000
66 Correct 187 ms 12024 KB n = 190000
67 Correct 177 ms 16376 KB n = 177777
68 Correct 91 ms 6136 KB n = 100000
69 Correct 197 ms 12024 KB n = 200000
70 Correct 257 ms 15212 KB n = 200000
71 Correct 233 ms 15336 KB n = 200000
72 Correct 210 ms 12044 KB n = 200000
73 Correct 216 ms 12024 KB n = 200000
74 Correct 207 ms 12024 KB n = 200000
75 Correct 189 ms 12024 KB n = 200000
76 Correct 194 ms 12024 KB n = 200000
77 Correct 172 ms 16760 KB n = 200000
78 Correct 194 ms 13804 KB n = 200000
79 Correct 193 ms 11000 KB n = 184307
80 Correct 70 ms 4856 KB n = 76040
81 Correct 185 ms 10648 KB n = 199981
82 Correct 198 ms 12796 KB n = 199994
83 Correct 179 ms 11960 KB n = 199996
84 Correct 184 ms 15884 KB n = 199998
85 Correct 189 ms 14748 KB n = 200000
86 Correct 205 ms 14956 KB n = 199998
87 Correct 192 ms 18296 KB n = 200000
88 Correct 196 ms 13408 KB n = 200000
89 Correct 189 ms 18296 KB n = 200000
90 Correct 214 ms 12164 KB n = 200000
91 Correct 231 ms 15340 KB n = 200000
92 Correct 228 ms 15340 KB n = 200000