oj.uz

Submission #361368

# Submission time Handle Problem Language Result Execution time Memory
361368 2021-01-29T14:13:14 Z ryansee Roller Coaster Railroad (IOI16_railroad) C++14
100 / 100
 297 ms 19924 KB 
#include "railroad.h"

#include "bits/stdc++.h"
using namespace std;

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusive
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

using ll=long long; 
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 

long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (200006)

int n;
vector<int> d, co, p;
void init() { FOR(i,0,siz(p)-1) p[i]=i; }
int find(int x) { return p[x] == x ? x : p[x] = find(p[x]); }
bool merge(int x,int y) { x=find(x), y=find(y); if(x==y) return 0; p[x] = y; return 1; }

long long plan_roller_coaster(vector<int> s, vector<int> t) {
	s.eb(1e9), t.eb(1), n = siz(s);
	FOR(i,0,n-1) {
		d.eb(s[i]), d.eb(t[i]);
	}
	sort(all(d)), d.resize(unique(all(d))-d.begin());
	co.resize(siz(d), 0), p.resize(siz(d), 0), init();
	FOR(i,0,n-1) {
		++ co[lbd(d, s[i])], -- co[lbd(d, t[i])];
		merge(lbd(d, s[i]), lbd(d, t[i]));
	}
	ll ans = 0;
	int cur = 0;
	vector<spi> e;
	DEC(i,siz(d)-1,1) {
		cur += co[i];
		if(cur < 0) {
			ans += ll(d[i] - d[i-1]) * -cur;
			merge(i, i-1);
		} else if(cur > 0) {
			merge(i, i-1);
		} else {
			e.eb(d[i]-d[i-1], pi(i, i-1));
		}
	}
	sort(all(e));
	for(auto i:e) {
		int a = i.s.f, b = i.s.s;
		if(merge(a, b)) ans += i.f;
	}
	return ans;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
23.0 / 23.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 266 ms 13188 KB n = 199999
2 Correct 276 ms 13160 KB n = 199991
3 Correct 261 ms 13000 KB n = 199993
4 Correct 206 ms 10000 KB n = 152076
5 Correct 105 ms 6280 KB n = 93249
6 Correct 231 ms 11464 KB n = 199910
7 Correct 237 ms 12744 KB n = 199999
8 Correct 234 ms 11848 KB n = 199997
9 Correct 219 ms 11400 KB n = 171294
10 Correct 176 ms 8860 KB n = 140872
11 Correct 258 ms 11592 KB n = 199886
12 Correct 239 ms 13128 KB n = 199996
13 Correct 252 ms 12488 KB n = 200000
14 Correct 260 ms 18884 KB n = 199998
15 Correct 256 ms 18884 KB n = 200000
16 Correct 274 ms 19360 KB n = 199998
17 Correct 239 ms 16328 KB n = 200000
18 Correct 230 ms 13020 KB n = 190000
19 Correct 214 ms 14576 KB n = 177777
20 Correct 128 ms 6872 KB n = 100000
21 Correct 255 ms 13128 KB n = 200000
22 Correct 294 ms 19924 KB n = 200000
23 Correct 288 ms 19780 KB n = 200000

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB n = 2
2 Correct 1 ms 364 KB n = 2
3 Correct 1 ms 364 KB n = 2
4 Correct 1 ms 384 KB n = 2
5 Correct 1 ms 364 KB n = 2
6 Correct 1 ms 364 KB n = 2
7 Correct 1 ms 364 KB n = 3
8 Correct 1 ms 364 KB n = 3
9 Correct 1 ms 364 KB n = 3
10 Correct 1 ms 384 KB n = 8
11 Correct 1 ms 364 KB n = 8
12 Correct 1 ms 364 KB n = 8
13 Correct 1 ms 364 KB n = 8
14 Correct 1 ms 364 KB n = 8
15 Correct 1 ms 364 KB n = 8
16 Correct 1 ms 364 KB n = 8
17 Correct 1 ms 364 KB n = 8
18 Correct 1 ms 364 KB n = 8
19 Correct 1 ms 364 KB n = 3
20 Correct 1 ms 364 KB n = 7
21 Correct 1 ms 364 KB n = 8
22 Correct 1 ms 364 KB n = 8
23 Correct 1 ms 364 KB n = 8
24 Correct 1 ms 364 KB n = 8
25 Correct 1 ms 364 KB n = 8
26 Correct 1 ms 364 KB n = 8
27 Correct 1 ms 364 KB n = 8
28 Correct 1 ms 364 KB n = 8
29 Correct 1 ms 364 KB n = 16
30 Correct 1 ms 364 KB n = 16
31 Correct 1 ms 364 KB n = 16
32 Correct 1 ms 364 KB n = 16
33 Correct 1 ms 364 KB n = 16
34 Correct 1 ms 364 KB n = 16
35 Correct 1 ms 364 KB n = 16
36 Correct 1 ms 364 KB n = 15
37 Correct 1 ms 384 KB n = 8
38 Correct 1 ms 364 KB n = 16
39 Correct 1 ms 384 KB n = 16
40 Correct 1 ms 364 KB n = 9
41 Correct 1 ms 364 KB n = 16
42 Correct 1 ms 364 KB n = 16
43 Correct 1 ms 364 KB n = 16
44 Correct 1 ms 364 KB n = 9
45 Correct 1 ms 364 KB n = 15
46 Correct 1 ms 364 KB n = 16
47 Correct 1 ms 364 KB n = 16
48 Correct 1 ms 364 KB n = 16
49 Correct 266 ms 13188 KB n = 199999
50 Correct 276 ms 13160 KB n = 199991
51 Correct 261 ms 13000 KB n = 199993
52 Correct 206 ms 10000 KB n = 152076
53 Correct 105 ms 6280 KB n = 93249
54 Correct 231 ms 11464 KB n = 199910
55 Correct 237 ms 12744 KB n = 199999
56 Correct 234 ms 11848 KB n = 199997
57 Correct 219 ms 11400 KB n = 171294
58 Correct 176 ms 8860 KB n = 140872
59 Correct 258 ms 11592 KB n = 199886
60 Correct 239 ms 13128 KB n = 199996
61 Correct 252 ms 12488 KB n = 200000
62 Correct 260 ms 18884 KB n = 199998
63 Correct 256 ms 18884 KB n = 200000
64 Correct 274 ms 19360 KB n = 199998
65 Correct 239 ms 16328 KB n = 200000
66 Correct 230 ms 13020 KB n = 190000
67 Correct 214 ms 14576 KB n = 177777
68 Correct 128 ms 6872 KB n = 100000
69 Correct 255 ms 13128 KB n = 200000
70 Correct 294 ms 19924 KB n = 200000
71 Correct 288 ms 19780 KB n = 200000
72 Correct 258 ms 13168 KB n = 200000
73 Correct 259 ms 13256 KB n = 200000
74 Correct 257 ms 13256 KB n = 200000
75 Correct 241 ms 13000 KB n = 200000
76 Correct 241 ms 13000 KB n = 200000
77 Correct 224 ms 13640 KB n = 200000
78 Correct 246 ms 18264 KB n = 200000
79 Correct 231 ms 12104 KB n = 184307
80 Correct 88 ms 5012 KB n = 76040
81 Correct 231 ms 11592 KB n = 199981
82 Correct 257 ms 13128 KB n = 199994
83 Correct 227 ms 12488 KB n = 199996
84 Correct 251 ms 19012 KB n = 199998
85 Correct 284 ms 18756 KB n = 200000
86 Correct 270 ms 19396 KB n = 199998
87 Correct 235 ms 16196 KB n = 200000
88 Correct 256 ms 13640 KB n = 200000
89 Correct 239 ms 16200 KB n = 200000
90 Correct 297 ms 13216 KB n = 200000
91 Correct 286 ms 19780 KB n = 200000
92 Correct 288 ms 19780 KB n = 200000