oj.uz

답안 #443735

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
443735 2021-07-11T20:22:05 Z rainboy Split the Attractions (IOI19_split) C++14
100 / 100
 141 ms 16804 KB 
#include "split.h"
#include <stdlib.h>

using namespace std;

typedef vector<int> vi;

const int N = 100000;

int min(int a, int b) { return a < b ? a : b; }

int *ej[N], eo[N], n;

void append(int i, int j) {
	int o = eo[i]++;

	if (o >= 2 && (o & o - 1) == 0)
		ej[i] = (int *) realloc(ej[i], o * 2 * sizeof *ej[i]);
	ej[i][o] = j;
}

int pp[N], sz[N], ta[N], tb[N], i_;
int a, b, x, y, z;

void dfs1(int p, int i) {
	static int time;
	int o, centroid;

	pp[i] = p, ta[i] = tb[i] = ++time;
	sz[i] = 1, centroid = 1;
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];

		if (!ta[j]) {
			dfs1(i, j);
			if (sz[j] * 2 > n)
				centroid = 0;
			sz[i] += sz[j];
			tb[i] = min(tb[i], tb[j]);
		} else if (j != p)
			tb[i] = min(tb[i], ta[j]);
	}
	if ((n - sz[i]) * 2 > n)
		centroid = 0;
	if (centroid)
		i_ = i;
}

vi xx; int k;

void dfs2(int p, int i, int x, int strict) {
	int o;

	if (xx[i])
		return;
	xx[i] = k-- > 0 ? x : z;
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];

		if (j != p && (!strict || pp[j] == i || pp[i] == j))
			dfs2(i, j, x, strict);
	}
}

vi find_split(int n_, int a_, int b_, int c, vi ii, vi jj) {
	int m = ii.size(), h, i, j, o, tmp;

	n = n_;
	for (i = 0; i < n; i++)
		ej[i] = (int *) malloc(2 * sizeof *ej[i]);
	for (h = 0; h < m; h++)
		append(ii[h], jj[h]), append(jj[h], ii[h]);
	a = a_, b = b_;
	if (a <= c && b <= c)
		x = 1, y = 2;
	else if (a <= b && c <= b)
		b = c, x = 1, y = 3;
	else
		a = c, x = 3, y = 2;
	if (a > b)
		tmp = a, a = b, b = tmp, tmp = x, x = y, y = tmp;
	z = x ^ y;
	dfs1(-1, 0), i = i_;
	if (pp[i] != -1)
		sz[pp[i]] = n - sz[i];
	xx.resize(n);
	for (o = eo[i]; o--; ) {
		j = ej[i][o];
		if ((j == pp[i] || pp[j] == i) && sz[j] >= a) {
			k = a, dfs2(i, j, x, 1);
			k = b, dfs2(j, i, y, 1);
			return xx;
		}
	}
	k = sz[pp[i]];
	for (o = eo[i]; o--; ) {
		j = ej[i][o];
		if (pp[j] == i && tb[j] < ta[i] && (k += sz[j]) >= a) {
			if (k * 2 >= n)
				tmp = a, a = b, b = tmp, tmp = x, x = y, y = tmp;
			k = b - 1, xx[i] = y;
			while (o--) {
				j = ej[i][o];
				if (pp[j] == i)
					dfs2(i, j, y, 1);
			}
			for (o = eo[i]; o--; ) {
				j = ej[i][o];
				if (pp[j] == i && tb[j] >= ta[i])
					dfs2(i, j, y, 1);
			}
			k = a, dfs2(i, pp[i], x, 0);
			return xx;
		}
	}
	fill_n(xx.begin(), n, 0);
	return xx;
}

Compilation message

split.cpp: In function 'void append(int, int)':
split.cpp:17:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   17 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB ok, correct split
2 Correct 0 ms 204 KB ok, correct split
3 Correct 0 ms 204 KB ok, correct split
4 Correct 0 ms 204 KB ok, correct split
5 Correct 0 ms 204 KB ok, correct split
6 Correct 0 ms 204 KB ok, correct split
7 Correct 80 ms 15920 KB ok, correct split
8 Correct 75 ms 13620 KB ok, correct split
9 Correct 88 ms 12948 KB ok, correct split
10 Correct 86 ms 16288 KB ok, correct split
11 Correct 78 ms 16196 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB ok, correct split
2 Correct 0 ms 204 KB ok, correct split
3 Correct 0 ms 204 KB ok, correct split
4 Correct 130 ms 13504 KB ok, correct split
5 Correct 63 ms 8756 KB ok, correct split
6 Correct 94 ms 16308 KB ok, correct split
7 Correct 89 ms 13356 KB ok, correct split
8 Correct 112 ms 11036 KB ok, correct split
9 Correct 65 ms 8624 KB ok, correct split
10 Correct 54 ms 8936 KB ok, correct split
11 Correct 66 ms 8916 KB ok, correct split
12 Correct 76 ms 8824 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB ok, correct split
2 Correct 73 ms 8736 KB ok, correct split
3 Correct 24 ms 3716 KB ok, correct split
4 Correct 0 ms 204 KB ok, correct split
5 Correct 104 ms 11076 KB ok, correct split
6 Correct 83 ms 10828 KB ok, correct split
7 Correct 88 ms 10820 KB ok, correct split
8 Correct 89 ms 11912 KB ok, correct split
9 Correct 78 ms 10804 KB ok, correct split
10 Correct 18 ms 3148 KB ok, no valid answer
11 Correct 27 ms 4524 KB ok, no valid answer
12 Correct 54 ms 8760 KB ok, no valid answer
13 Correct 57 ms 8780 KB ok, no valid answer
14 Correct 58 ms 8880 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB ok, correct split
2 Correct 0 ms 204 KB ok, no valid answer
3 Correct 1 ms 204 KB ok, correct split
4 Correct 0 ms 204 KB ok, correct split
5 Correct 0 ms 236 KB ok, correct split
6 Correct 0 ms 204 KB ok, correct split
7 Correct 0 ms 204 KB ok, correct split
8 Correct 0 ms 204 KB ok, correct split
9 Correct 2 ms 588 KB ok, correct split
10 Correct 2 ms 460 KB ok, correct split
11 Correct 1 ms 332 KB ok, correct split
12 Correct 2 ms 460 KB ok, correct split
13 Correct 0 ms 204 KB ok, correct split
14 Correct 0 ms 204 KB ok, correct split
15 Correct 1 ms 204 KB ok, correct split
16 Correct 0 ms 204 KB ok, correct split
17 Correct 0 ms 204 KB ok, correct split
18 Correct 0 ms 204 KB ok, correct split
19 Correct 1 ms 332 KB ok, correct split
20 Correct 1 ms 332 KB ok, correct split
21 Correct 2 ms 460 KB ok, correct split
22 Correct 2 ms 460 KB ok, correct split
23 Correct 2 ms 588 KB ok, correct split
24 Correct 2 ms 460 KB ok, correct split
25 Correct 2 ms 460 KB ok, correct split
26 Correct 2 ms 460 KB ok, correct split
27 Correct 2 ms 588 KB ok, correct split
28 Correct 2 ms 588 KB ok, correct split
29 Correct 1 ms 332 KB ok, correct split
30 Correct 2 ms 588 KB ok, correct split
31 Correct 1 ms 332 KB ok, correct split
32 Correct 1 ms 296 KB ok, correct split
33 Correct 1 ms 332 KB ok, correct split
34 Correct 2 ms 560 KB ok, correct split
35 Correct 2 ms 460 KB ok, correct split
36 Correct 2 ms 460 KB ok, correct split
37 Correct 3 ms 496 KB ok, correct split
38 Correct 2 ms 588 KB ok, correct split
39 Correct 3 ms 588 KB ok, correct split
40 Correct 2 ms 588 KB ok, correct split
41 Correct 1 ms 460 KB ok, correct split
42 Correct 1 ms 460 KB ok, correct split
43 Correct 2 ms 588 KB ok, correct split
44 Correct 2 ms 588 KB ok, correct split
45 Correct 2 ms 588 KB ok, correct split
46 Correct 2 ms 660 KB ok, correct split
47 Correct 2 ms 460 KB ok, no valid answer
48 Correct 2 ms 460 KB ok, correct split
49 Correct 2 ms 588 KB ok, correct split
50 Correct 0 ms 204 KB ok, no valid answer
51 Correct 0 ms 204 KB ok, no valid answer
52 Correct 2 ms 460 KB ok, no valid answer
53 Correct 3 ms 556 KB ok, no valid answer
54 Correct 2 ms 460 KB ok, no valid answer
55 Correct 2 ms 460 KB ok, no valid answer
56 Correct 2 ms 460 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB ok, correct split
2 Correct 0 ms 204 KB ok, correct split
3 Correct 0 ms 204 KB ok, correct split
4 Correct 0 ms 204 KB ok, correct split
5 Correct 0 ms 204 KB ok, correct split
6 Correct 0 ms 204 KB ok, correct split
7 Correct 80 ms 15920 KB ok, correct split
8 Correct 75 ms 13620 KB ok, correct split
9 Correct 88 ms 12948 KB ok, correct split
10 Correct 86 ms 16288 KB ok, correct split
11 Correct 78 ms 16196 KB ok, correct split
12 Correct 0 ms 204 KB ok, correct split
13 Correct 0 ms 204 KB ok, correct split
14 Correct 0 ms 204 KB ok, correct split
15 Correct 130 ms 13504 KB ok, correct split
16 Correct 63 ms 8756 KB ok, correct split
17 Correct 94 ms 16308 KB ok, correct split
18 Correct 89 ms 13356 KB ok, correct split
19 Correct 112 ms 11036 KB ok, correct split
20 Correct 65 ms 8624 KB ok, correct split
21 Correct 54 ms 8936 KB ok, correct split
22 Correct 66 ms 8916 KB ok, correct split
23 Correct 76 ms 8824 KB ok, correct split
24 Correct 0 ms 204 KB ok, correct split
25 Correct 73 ms 8736 KB ok, correct split
26 Correct 24 ms 3716 KB ok, correct split
27 Correct 0 ms 204 KB ok, correct split
28 Correct 104 ms 11076 KB ok, correct split
29 Correct 83 ms 10828 KB ok, correct split
30 Correct 88 ms 10820 KB ok, correct split
31 Correct 89 ms 11912 KB ok, correct split
32 Correct 78 ms 10804 KB ok, correct split
33 Correct 18 ms 3148 KB ok, no valid answer
34 Correct 27 ms 4524 KB ok, no valid answer
35 Correct 54 ms 8760 KB ok, no valid answer
36 Correct 57 ms 8780 KB ok, no valid answer
37 Correct 58 ms 8880 KB ok, no valid answer
38 Correct 0 ms 204 KB ok, correct split
39 Correct 0 ms 204 KB ok, no valid answer
40 Correct 1 ms 204 KB ok, correct split
41 Correct 0 ms 204 KB ok, correct split
42 Correct 0 ms 236 KB ok, correct split
43 Correct 0 ms 204 KB ok, correct split
44 Correct 0 ms 204 KB ok, correct split
45 Correct 0 ms 204 KB ok, correct split
46 Correct 2 ms 588 KB ok, correct split
47 Correct 2 ms 460 KB ok, correct split
48 Correct 1 ms 332 KB ok, correct split
49 Correct 2 ms 460 KB ok, correct split
50 Correct 0 ms 204 KB ok, correct split
51 Correct 0 ms 204 KB ok, correct split
52 Correct 1 ms 204 KB ok, correct split
53 Correct 0 ms 204 KB ok, correct split
54 Correct 0 ms 204 KB ok, correct split
55 Correct 0 ms 204 KB ok, correct split
56 Correct 1 ms 332 KB ok, correct split
57 Correct 1 ms 332 KB ok, correct split
58 Correct 2 ms 460 KB ok, correct split
59 Correct 2 ms 460 KB ok, correct split
60 Correct 2 ms 588 KB ok, correct split
61 Correct 2 ms 460 KB ok, correct split
62 Correct 2 ms 460 KB ok, correct split
63 Correct 2 ms 460 KB ok, correct split
64 Correct 2 ms 588 KB ok, correct split
65 Correct 2 ms 588 KB ok, correct split
66 Correct 1 ms 332 KB ok, correct split
67 Correct 2 ms 588 KB ok, correct split
68 Correct 1 ms 332 KB ok, correct split
69 Correct 1 ms 296 KB ok, correct split
70 Correct 1 ms 332 KB ok, correct split
71 Correct 2 ms 560 KB ok, correct split
72 Correct 2 ms 460 KB ok, correct split
73 Correct 2 ms 460 KB ok, correct split
74 Correct 3 ms 496 KB ok, correct split
75 Correct 2 ms 588 KB ok, correct split
76 Correct 3 ms 588 KB ok, correct split
77 Correct 2 ms 588 KB ok, correct split
78 Correct 1 ms 460 KB ok, correct split
79 Correct 1 ms 460 KB ok, correct split
80 Correct 2 ms 588 KB ok, correct split
81 Correct 2 ms 588 KB ok, correct split
82 Correct 2 ms 588 KB ok, correct split
83 Correct 2 ms 660 KB ok, correct split
84 Correct 2 ms 460 KB ok, no valid answer
85 Correct 2 ms 460 KB ok, correct split
86 Correct 2 ms 588 KB ok, correct split
87 Correct 0 ms 204 KB ok, no valid answer
88 Correct 0 ms 204 KB ok, no valid answer
89 Correct 2 ms 460 KB ok, no valid answer
90 Correct 3 ms 556 KB ok, no valid answer
91 Correct 2 ms 460 KB ok, no valid answer
92 Correct 2 ms 460 KB ok, no valid answer
93 Correct 2 ms 460 KB ok, no valid answer
94 Correct 84 ms 12096 KB ok, correct split
95 Correct 120 ms 16804 KB ok, correct split
96 Correct 123 ms 15324 KB ok, correct split
97 Correct 23 ms 4140 KB ok, correct split
98 Correct 28 ms 4292 KB ok, correct split
99 Correct 45 ms 6440 KB ok, correct split
100 Correct 141 ms 12300 KB ok, correct split
101 Correct 127 ms 11576 KB ok, correct split
102 Correct 95 ms 10784 KB ok, correct split
103 Correct 94 ms 10692 KB ok, correct split
104 Correct 87 ms 11908 KB ok, correct split
105 Correct 40 ms 6176 KB ok, correct split
106 Correct 101 ms 11668 KB ok, correct split
107 Correct 73 ms 9528 KB ok, correct split
108 Correct 68 ms 9500 KB ok, correct split
109 Correct 133 ms 11844 KB ok, correct split
110 Correct 107 ms 11300 KB ok, correct split
111 Correct 117 ms 11316 KB ok, correct split
112 Correct 111 ms 11784 KB ok, correct split
113 Correct 110 ms 11844 KB ok, correct split
114 Correct 10 ms 1968 KB ok, correct split
115 Correct 9 ms 1740 KB ok, correct split
116 Correct 127 ms 11204 KB ok, correct split
117 Correct 118 ms 11256 KB ok, correct split
118 Correct 74 ms 9284 KB ok, correct split
119 Correct 74 ms 9348 KB ok, correct split
120 Correct 73 ms 12800 KB ok, correct split
121 Correct 81 ms 9372 KB ok, no valid answer
122 Correct 60 ms 9512 KB ok, no valid answer
123 Correct 101 ms 12612 KB ok, no valid answer
124 Correct 111 ms 12500 KB ok, no valid answer
125 Correct 65 ms 10072 KB ok, no valid answer
126 Correct 47 ms 8772 KB ok, no valid answer
127 Correct 73 ms 10480 KB ok, no valid answer