oj.uz

답안 #405183

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
405183 2021-05-15T20:28:16 Z rainboy Roller Coaster Railroad (IOI16_railroad) C
100 / 100
 212 ms 12824 KB 
#include "railroad_c.h"
#include <string.h>

#define N	200001
#define INF	0x3f3f3f3f

long long min(long long a, long long b) { return a < b ? a : b; }
long long max(long long a, long long b) { return a > b ? a : b; }

unsigned int X = 12345;

int rand_() {
	return (X *= 3) >> 1;
}

int xx[N * 2], uu[N * 2 - 1], vv[N * 2 - 1], ww[N * 2 - 1];

int compare_x(int i, int j) {
	return xx[i] != xx[j] ? xx[i] - xx[j] : (i & 1) - (j & 1);
}

int compare_w(int h1, int h2) {
	return ww[h1] - ww[h2];
}

void sort(int *ii, int l, int r, int (*compare)(int, int)) {
	while (l < r) {
		int i = l, j = l, k = r, i_ = ii[l + rand_() % (r - l)], tmp;

		while (j < k) {
			int c = compare(ii[j], i_);

			if (c == 0)
				j++;
			else if (c < 0) {
				tmp = ii[i], ii[i] = ii[j], ii[j] = tmp;
				i++, j++;
			} else {
				k--;
				tmp = ii[j], ii[j] = ii[k], ii[k] = tmp;
			}
		}
		sort(ii, l, i, compare);
		l = k;
	}
}

int ds[N];

int find(int i) {
	return ds[i] < 0 ? i : (ds[i] = find(ds[i]));
}

int join(int i, int j) {
	i = find(i);
	j = find(j);
	if (i == j)
		return 0;
	if (ds[i] > ds[j])
		ds[i] = j;
	else {
		if (ds[i] == ds[j])
			ds[i]--;
		ds[j] = i;
	}
	return 1;
}

long long plan_roller_coaster(int n, int *aa, int *bb) {
	static int hh[N * 2 - 1], ii[N * 2];
	int m, h, h_, i, j, d;
	long long ans;

	for (i = 0; i < n; i++)
		xx[i << 1 | 0] = bb[i], xx[i << 1 | 1] = aa[i];
	xx[n << 1 | 0] = 0, xx[n << 1 | 1] = INF, n++;
	for (i = 0; i < n * 2; i++)
		ii[i] = i;
	sort(ii, 0, n * 2, compare_x);
	memset(ds, -1, n * sizeof *ds);
	ans = 0;
	for (h = 0, d = 0; h < n * 2; h++) {
		i = ii[h];
		d += (i & 1) == 0 ? 1 : -1;
		if (h + 1 < n * 2) {
			j = ii[h + 1];
			if (d < 0)
				ans += (long long) -d * (xx[j] - xx[i]);
			if (d != 0 && h + 1 < n * 2)
				join(i >> 1, j >> 1);
		}
	}
	m = 0;
	for (h = 1; h < n * 2; h++) {
		i = ii[h], j = ii[h - 1];
		if (find(i >> 1) != find(j >> 1))
			uu[m] = i >> 1, vv[m] = j >> 1, ww[m] = xx[i] - xx[j], m++;
	}
	for (h = 0; h < m; h++)
		hh[h] = h;
	sort(hh, 0, m, compare_w);
	for (h = 0; h < m; h++) {
		h_ = hh[h];
		if (join(uu[h_], vv[h_]))
			ans += ww[h_];
	}
	return ans;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB n = 2
2 Correct 1 ms 280 KB n = 2
3 Correct 1 ms 284 KB n = 2
4 Correct 1 ms 204 KB n = 2
5 Correct 1 ms 220 KB n = 2
6 Correct 1 ms 216 KB n = 2
7 Correct 1 ms 204 KB n = 3
8 Correct 1 ms 284 KB n = 3
9 Correct 1 ms 204 KB n = 3
10 Correct 1 ms 204 KB n = 8
11 Correct 1 ms 204 KB n = 8
12 Correct 1 ms 204 KB n = 8
13 Correct 1 ms 204 KB n = 8
14 Correct 1 ms 204 KB n = 8
15 Correct 1 ms 284 KB n = 8
16 Correct 1 ms 204 KB n = 8
17 Correct 1 ms 204 KB n = 8
18 Correct 1 ms 272 KB n = 8
19 Correct 1 ms 204 KB n = 3
20 Correct 1 ms 204 KB n = 7
21 Correct 1 ms 204 KB n = 8
22 Correct 1 ms 276 KB n = 8
23 Correct 1 ms 204 KB n = 8
24 Correct 1 ms 204 KB n = 8
25 Correct 1 ms 204 KB n = 8

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB n = 2
2 Correct 1 ms 280 KB n = 2
3 Correct 1 ms 284 KB n = 2
4 Correct 1 ms 204 KB n = 2
5 Correct 1 ms 220 KB n = 2
6 Correct 1 ms 216 KB n = 2
7 Correct 1 ms 204 KB n = 3
8 Correct 1 ms 284 KB n = 3
9 Correct 1 ms 204 KB n = 3
10 Correct 1 ms 204 KB n = 8
11 Correct 1 ms 204 KB n = 8
12 Correct 1 ms 204 KB n = 8
13 Correct 1 ms 204 KB n = 8
14 Correct 1 ms 204 KB n = 8
15 Correct 1 ms 284 KB n = 8
16 Correct 1 ms 204 KB n = 8
17 Correct 1 ms 204 KB n = 8
18 Correct 1 ms 272 KB n = 8
19 Correct 1 ms 204 KB n = 3
20 Correct 1 ms 204 KB n = 7
21 Correct 1 ms 204 KB n = 8
22 Correct 1 ms 276 KB n = 8
23 Correct 1 ms 204 KB n = 8
24 Correct 1 ms 204 KB n = 8
25 Correct 1 ms 204 KB n = 8
26 Correct 1 ms 204 KB n = 8
27 Correct 1 ms 204 KB n = 8
28 Correct 1 ms 204 KB n = 8
29 Correct 1 ms 284 KB n = 16
30 Correct 1 ms 208 KB n = 16
31 Correct 1 ms 204 KB n = 16
32 Correct 1 ms 204 KB n = 16
33 Correct 1 ms 204 KB n = 16
34 Correct 1 ms 284 KB n = 16
35 Correct 1 ms 204 KB n = 16
36 Correct 1 ms 204 KB n = 15
37 Correct 1 ms 204 KB n = 8
38 Correct 1 ms 204 KB n = 16
39 Correct 1 ms 284 KB n = 16
40 Correct 1 ms 280 KB n = 9
41 Correct 1 ms 204 KB n = 16
42 Correct 1 ms 204 KB n = 16
43 Correct 1 ms 204 KB n = 16
44 Correct 1 ms 204 KB n = 9
45 Correct 1 ms 204 KB n = 15
46 Correct 1 ms 204 KB n = 16
47 Correct 1 ms 204 KB n = 16
48 Correct 1 ms 204 KB n = 16

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 155 ms 6140 KB n = 199999
2 Correct 161 ms 6064 KB n = 199991
3 Correct 159 ms 5996 KB n = 199993
4 Correct 115 ms 4624 KB n = 152076
5 Correct 68 ms 2992 KB n = 93249
6 Correct 143 ms 6004 KB n = 199910
7 Correct 146 ms 6008 KB n = 199999
8 Correct 152 ms 5932 KB n = 199997
9 Correct 134 ms 5316 KB n = 171294
10 Correct 106 ms 4384 KB n = 140872
11 Correct 175 ms 6016 KB n = 199886
12 Correct 149 ms 5956 KB n = 199996
13 Correct 159 ms 5972 KB n = 200000
14 Correct 197 ms 6804 KB n = 199998
15 Correct 166 ms 6740 KB n = 200000
16 Correct 158 ms 6840 KB n = 199998
17 Correct 159 ms 6008 KB n = 200000
18 Correct 154 ms 5700 KB n = 190000
19 Correct 139 ms 5344 KB n = 177777
20 Correct 78 ms 3264 KB n = 100000
21 Correct 164 ms 6016 KB n = 200000
22 Correct 200 ms 9160 KB n = 200000
23 Correct 167 ms 6004 KB n = 200000

Subtask #4
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB n = 2
2 Correct 1 ms 280 KB n = 2
3 Correct 1 ms 284 KB n = 2
4 Correct 1 ms 204 KB n = 2
5 Correct 1 ms 220 KB n = 2
6 Correct 1 ms 216 KB n = 2
7 Correct 1 ms 204 KB n = 3
8 Correct 1 ms 284 KB n = 3
9 Correct 1 ms 204 KB n = 3
10 Correct 1 ms 204 KB n = 8
11 Correct 1 ms 204 KB n = 8
12 Correct 1 ms 204 KB n = 8
13 Correct 1 ms 204 KB n = 8
14 Correct 1 ms 204 KB n = 8
15 Correct 1 ms 284 KB n = 8
16 Correct 1 ms 204 KB n = 8
17 Correct 1 ms 204 KB n = 8
18 Correct 1 ms 272 KB n = 8
19 Correct 1 ms 204 KB n = 3
20 Correct 1 ms 204 KB n = 7
21 Correct 1 ms 204 KB n = 8
22 Correct 1 ms 276 KB n = 8
23 Correct 1 ms 204 KB n = 8
24 Correct 1 ms 204 KB n = 8
25 Correct 1 ms 204 KB n = 8
26 Correct 1 ms 204 KB n = 8
27 Correct 1 ms 204 KB n = 8
28 Correct 1 ms 204 KB n = 8
29 Correct 1 ms 284 KB n = 16
30 Correct 1 ms 208 KB n = 16
31 Correct 1 ms 204 KB n = 16
32 Correct 1 ms 204 KB n = 16
33 Correct 1 ms 204 KB n = 16
34 Correct 1 ms 284 KB n = 16
35 Correct 1 ms 204 KB n = 16
36 Correct 1 ms 204 KB n = 15
37 Correct 1 ms 204 KB n = 8
38 Correct 1 ms 204 KB n = 16
39 Correct 1 ms 284 KB n = 16
40 Correct 1 ms 280 KB n = 9
41 Correct 1 ms 204 KB n = 16
42 Correct 1 ms 204 KB n = 16
43 Correct 1 ms 204 KB n = 16
44 Correct 1 ms 204 KB n = 9
45 Correct 1 ms 204 KB n = 15
46 Correct 1 ms 204 KB n = 16
47 Correct 1 ms 204 KB n = 16
48 Correct 1 ms 204 KB n = 16
49 Correct 155 ms 6140 KB n = 199999
50 Correct 161 ms 6064 KB n = 199991
51 Correct 159 ms 5996 KB n = 199993
52 Correct 115 ms 4624 KB n = 152076
53 Correct 68 ms 2992 KB n = 93249
54 Correct 143 ms 6004 KB n = 199910
55 Correct 146 ms 6008 KB n = 199999
56 Correct 152 ms 5932 KB n = 199997
57 Correct 134 ms 5316 KB n = 171294
58 Correct 106 ms 4384 KB n = 140872
59 Correct 175 ms 6016 KB n = 199886
60 Correct 149 ms 5956 KB n = 199996
61 Correct 159 ms 5972 KB n = 200000
62 Correct 197 ms 6804 KB n = 199998
63 Correct 166 ms 6740 KB n = 200000
64 Correct 158 ms 6840 KB n = 199998
65 Correct 159 ms 6008 KB n = 200000
66 Correct 154 ms 5700 KB n = 190000
67 Correct 139 ms 5344 KB n = 177777
68 Correct 78 ms 3264 KB n = 100000
69 Correct 164 ms 6016 KB n = 200000
70 Correct 200 ms 9160 KB n = 200000
71 Correct 167 ms 6004 KB n = 200000
72 Correct 176 ms 6004 KB n = 200000
73 Correct 160 ms 5912 KB n = 200000
74 Correct 183 ms 9612 KB n = 200000
75 Correct 174 ms 9616 KB n = 200000
76 Correct 175 ms 9608 KB n = 200000
77 Correct 164 ms 9540 KB n = 200000
78 Correct 212 ms 12684 KB n = 200000
79 Correct 158 ms 8616 KB n = 184307
80 Correct 70 ms 3800 KB n = 76040
81 Correct 155 ms 8528 KB n = 199981
82 Correct 153 ms 8960 KB n = 199994
83 Correct 170 ms 8516 KB n = 199996
84 Correct 155 ms 9584 KB n = 199998
85 Correct 157 ms 9540 KB n = 200000
86 Correct 158 ms 9872 KB n = 199998
87 Correct 172 ms 9532 KB n = 200000
88 Correct 164 ms 9640 KB n = 200000
89 Correct 160 ms 9616 KB n = 200000
90 Correct 184 ms 9524 KB n = 200000
91 Correct 204 ms 12824 KB n = 200000
92 Correct 173 ms 9536 KB n = 200000