oj.uz

답안 #153270

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
153270 2019-09-13T06:15:19 Z qkxwsm Roller Coaster Railroad (IOI16_railroad) C++14
100 / 100
 333 ms 28360 KB 
#include "railroad.h"
#include <bits/stdc++.h>

using namespace std;

template<class T, class U>
void ckmin(T &a, U b)
{
	if (a > b) a = b;
}
template<class T, class U>
void ckmax(T &a, U b)
{
	if (a < b) a = b;
}

#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define SZ(x) ((int) ((x).size()))
#define ALL(x) (x).begin(), (x).end()
#define MAXN 400013
#define INF 1000000007
#define LLINF 2696969696969696969

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

int N;
pll arr[MAXN];
ll dp[(1 << 17)][17];
ll ans = 0;
int pref[MAXN];
vl guys;
int dsu[MAXN];
vector<pair<ll, pii> > edges;

int get(int u)
{
	return (u == dsu[u] ? u : dsu[u] = get(dsu[u]));
}
bool merge(int u, int v)
{
	u = get(u); v = get(v);
	if (u == v) return false;
	dsu[u] = v;
	return true;
}

ll plan_roller_coaster(vector<int> s, vector<int> t)
{
	N = SZ(s);
	FOR(i, 0, N)
	{
		arr[i] = {s[i], t[i]};
		arr[i].fi--; arr[i].se--;
	}
	arr[N] = {INF, 0};
	N++;
	FOR(i, 0, N)
	{
		guys.PB(arr[i].fi);
		guys.PB(arr[i].se);
	}
	sort(ALL(guys));
	guys.erase(unique(ALL(guys)), guys.end());
	FOR(i, 0, SZ(guys))
	{
		dsu[i] = i;
	}
	FOR(i, 0, N)
	{
		int lt = arr[i].fi, rt = arr[i].se;
		lt = LB(ALL(guys), lt) - guys.begin();
		rt = LB(ALL(guys), rt) - guys.begin();
		pref[lt]++;
		pref[rt]--;
		merge(lt, rt);
	}
	FOR(i, 1, SZ(guys))
	{
		pref[i] += pref[i - 1];
	}
	FOR(i, 0, SZ(guys) - 1)
	{
		ll dis = guys[i + 1] - guys[i];
		if (pref[i] > 0)
		{
			ans += pref[i] * dis;
		}
		if (pref[i] != 0)
		{
			merge(i, i + 1);
		}
		edges.PB({dis, {i, i + 1}});
	}
	sort(ALL(edges));
	for (auto p : edges)
	{
		if (merge(p.se.fi, p.se.se))
		{
			ans += p.fi;
		}
	}
	return ans;
	//you cannot insert -1s. you can get +1s but it means accelerate.
	//ok mark the guys that are
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 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 2 ms 376 KB n = 2
6 Correct 2 ms 376 KB n = 2
7 Correct 2 ms 376 KB n = 3
8 Correct 2 ms 372 KB n = 3
9 Correct 2 ms 376 KB n = 3
10 Correct 2 ms 376 KB n = 8
11 Correct 2 ms 376 KB n = 8
12 Correct 2 ms 376 KB n = 8
13 Correct 2 ms 376 KB n = 8
14 Correct 2 ms 376 KB n = 8
15 Correct 2 ms 380 KB n = 8
16 Correct 2 ms 376 KB n = 8
17 Correct 2 ms 376 KB n = 8
18 Correct 2 ms 376 KB n = 8
19 Correct 2 ms 376 KB n = 3
20 Correct 2 ms 376 KB n = 7
21 Correct 2 ms 376 KB n = 8
22 Correct 2 ms 400 KB n = 8
23 Correct 2 ms 376 KB n = 8
24 Correct 2 ms 376 KB n = 8
25 Correct 2 ms 376 KB n = 8

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 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 2 ms 376 KB n = 2
6 Correct 2 ms 376 KB n = 2
7 Correct 2 ms 376 KB n = 3
8 Correct 2 ms 372 KB n = 3
9 Correct 2 ms 376 KB n = 3
10 Correct 2 ms 376 KB n = 8
11 Correct 2 ms 376 KB n = 8
12 Correct 2 ms 376 KB n = 8
13 Correct 2 ms 376 KB n = 8
14 Correct 2 ms 376 KB n = 8
15 Correct 2 ms 380 KB n = 8
16 Correct 2 ms 376 KB n = 8
17 Correct 2 ms 376 KB n = 8
18 Correct 2 ms 376 KB n = 8
19 Correct 2 ms 376 KB n = 3
20 Correct 2 ms 376 KB n = 7
21 Correct 2 ms 376 KB n = 8
22 Correct 2 ms 400 KB n = 8
23 Correct 2 ms 376 KB n = 8
24 Correct 2 ms 376 KB n = 8
25 Correct 2 ms 376 KB n = 8
26 Correct 2 ms 348 KB n = 8
27 Correct 2 ms 376 KB n = 8
28 Correct 2 ms 376 KB n = 8
29 Correct 2 ms 376 KB n = 16
30 Correct 2 ms 376 KB n = 16
31 Correct 2 ms 376 KB n = 16
32 Correct 2 ms 376 KB n = 16
33 Correct 2 ms 376 KB n = 16
34 Correct 2 ms 376 KB n = 16
35 Correct 2 ms 420 KB n = 16
36 Correct 2 ms 376 KB n = 15
37 Correct 2 ms 376 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 372 KB n = 16
42 Correct 2 ms 292 KB n = 16
43 Correct 2 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 376 KB n = 16
47 Correct 2 ms 376 KB n = 16
48 Correct 2 ms 376 KB n = 16

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 325 ms 21368 KB n = 199999
2 Correct 333 ms 22016 KB n = 199991
3 Correct 322 ms 21968 KB n = 199993
4 Correct 238 ms 18976 KB n = 152076
5 Correct 141 ms 11172 KB n = 93249
6 Correct 257 ms 21388 KB n = 199910
7 Correct 282 ms 21924 KB n = 199999
8 Correct 252 ms 21416 KB n = 199997
9 Correct 269 ms 20184 KB n = 171294
10 Correct 222 ms 18336 KB n = 140872
11 Correct 258 ms 21360 KB n = 199886
12 Correct 296 ms 21980 KB n = 199996
13 Correct 259 ms 21532 KB n = 200000
14 Correct 281 ms 21908 KB n = 199998
15 Correct 276 ms 21800 KB n = 200000
16 Correct 297 ms 22000 KB n = 199998
17 Correct 297 ms 25056 KB n = 200000
18 Correct 288 ms 21592 KB n = 190000
19 Correct 257 ms 23384 KB n = 177777
20 Correct 143 ms 11592 KB n = 100000
21 Correct 327 ms 21988 KB n = 200000
22 Correct 298 ms 21952 KB n = 200000
23 Correct 287 ms 21972 KB n = 200000

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 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 2 ms 376 KB n = 2
6 Correct 2 ms 376 KB n = 2
7 Correct 2 ms 376 KB n = 3
8 Correct 2 ms 372 KB n = 3
9 Correct 2 ms 376 KB n = 3
10 Correct 2 ms 376 KB n = 8
11 Correct 2 ms 376 KB n = 8
12 Correct 2 ms 376 KB n = 8
13 Correct 2 ms 376 KB n = 8
14 Correct 2 ms 376 KB n = 8
15 Correct 2 ms 380 KB n = 8
16 Correct 2 ms 376 KB n = 8
17 Correct 2 ms 376 KB n = 8
18 Correct 2 ms 376 KB n = 8
19 Correct 2 ms 376 KB n = 3
20 Correct 2 ms 376 KB n = 7
21 Correct 2 ms 376 KB n = 8
22 Correct 2 ms 400 KB n = 8
23 Correct 2 ms 376 KB n = 8
24 Correct 2 ms 376 KB n = 8
25 Correct 2 ms 376 KB n = 8
26 Correct 2 ms 348 KB n = 8
27 Correct 2 ms 376 KB n = 8
28 Correct 2 ms 376 KB n = 8
29 Correct 2 ms 376 KB n = 16
30 Correct 2 ms 376 KB n = 16
31 Correct 2 ms 376 KB n = 16
32 Correct 2 ms 376 KB n = 16
33 Correct 2 ms 376 KB n = 16
34 Correct 2 ms 376 KB n = 16
35 Correct 2 ms 420 KB n = 16
36 Correct 2 ms 376 KB n = 15
37 Correct 2 ms 376 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 372 KB n = 16
42 Correct 2 ms 292 KB n = 16
43 Correct 2 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 376 KB n = 16
47 Correct 2 ms 376 KB n = 16
48 Correct 2 ms 376 KB n = 16
49 Correct 325 ms 21368 KB n = 199999
50 Correct 333 ms 22016 KB n = 199991
51 Correct 322 ms 21968 KB n = 199993
52 Correct 238 ms 18976 KB n = 152076
53 Correct 141 ms 11172 KB n = 93249
54 Correct 257 ms 21388 KB n = 199910
55 Correct 282 ms 21924 KB n = 199999
56 Correct 252 ms 21416 KB n = 199997
57 Correct 269 ms 20184 KB n = 171294
58 Correct 222 ms 18336 KB n = 140872
59 Correct 258 ms 21360 KB n = 199886
60 Correct 296 ms 21980 KB n = 199996
61 Correct 259 ms 21532 KB n = 200000
62 Correct 281 ms 21908 KB n = 199998
63 Correct 276 ms 21800 KB n = 200000
64 Correct 297 ms 22000 KB n = 199998
65 Correct 297 ms 25056 KB n = 200000
66 Correct 288 ms 21592 KB n = 190000
67 Correct 257 ms 23384 KB n = 177777
68 Correct 143 ms 11592 KB n = 100000
69 Correct 327 ms 21988 KB n = 200000
70 Correct 298 ms 21952 KB n = 200000
71 Correct 287 ms 21972 KB n = 200000
72 Correct 322 ms 21984 KB n = 200000
73 Correct 330 ms 21980 KB n = 200000
74 Correct 324 ms 25076 KB n = 200000
75 Correct 296 ms 25184 KB n = 200000
76 Correct 287 ms 25116 KB n = 200000
77 Correct 221 ms 21600 KB n = 200000
78 Correct 221 ms 21360 KB n = 200000
79 Correct 292 ms 23776 KB n = 184307
80 Correct 113 ms 10852 KB n = 76040
81 Correct 259 ms 23384 KB n = 199981
82 Correct 291 ms 24536 KB n = 199994
83 Correct 261 ms 23772 KB n = 199996
84 Correct 284 ms 24280 KB n = 199998
85 Correct 277 ms 24156 KB n = 200000
86 Correct 305 ms 24664 KB n = 199998
87 Correct 304 ms 28200 KB n = 200000
88 Correct 311 ms 25836 KB n = 200000
89 Correct 297 ms 28360 KB n = 200000
90 Correct 311 ms 25180 KB n = 200000
91 Correct 293 ms 25048 KB n = 200000
92 Correct 287 ms 25212 KB n = 200000