oj.uz

답안 #769688

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
769688 2023-06-30T03:18:04 Z SanguineChameleon Split the Attractions (IOI19_split) C++17
100 / 100
 84 ms 19600 KB 
#include "split.h"
#include <bits/stdc++.h>
using namespace std;

const int maxn = 1e5 + 20;
vector<int> adj[maxn];
int sz[maxn];
int par[maxn];
int high[maxn];
int depth[maxn];
bool flag[maxn];
int color[maxn];
int n, m, a, b, c;
pair<int, int> mi;
int cnt;

void dfs1(int u) {
	flag[u] = true;
	sz[u] = 1;
	high[u] = depth[u];
	for (auto v: adj[u]) {
		if (!flag[v]) {
			par[v] = u;
			depth[v] = depth[u] + 1;
			dfs1(v);
			sz[u] += sz[v];
			high[u] = min(high[u], high[v]);
		}
		else {
			high[u] = min(high[u], depth[v]);
		}
	}
	if (sz[u] >= a) {
		mi = min(mi, make_pair(sz[u], u));
	}
}

void dfs2(int u) {
	if (n - mi.first >= a) {
		return;
	}
	if (u != mi.second && high[u] < depth[mi.second]) {
		flag[u] = true;
		mi.first -= sz[u];
		return;
	}
	for (auto v: adj[u]) {
		if (par[v] == u) {
			dfs2(v);
		}
	}
}

void dfs3(int u) {
	if (cnt == a || flag[u]) {
		return;
	}
	color[u] = 1;
	cnt++;
	for (auto v: adj[u]) {
		if (par[v] == u) {
			dfs3(v);
		}
	}
}

vector<int> solve() {
	mi = make_pair(n + 1, -1);
	par[0] = -1;
	dfs1(0);
	for (int i = 0; i < n; i++) {
		flag[i] = false;
	}
	dfs2(mi.second);
	if (n - mi.first < a) {
		return vector<int>(n, 0);
	}
	bool flip = n - mi.first < b;
	if (flip) {
		swap(a, b);
	}
	dfs3(mi.second);
	for (int i = 0; i < n; i++) {
		flag[i] = false;
	}
	for (int i = 0; i < n; i++) {
		if (!color[i] && !flag[i]) {
			flag[i] = true;
			vector<int> comp;
			comp.push_back(i);
			int sz = 1;
			int pt = 0;
			while (pt < sz) {
				int u = comp[pt++];
				for (auto v: adj[u]) {
					if (!color[v] && !flag[v]) {
						flag[v] = true;
						comp.push_back(v);
						sz++;
					}
				}
			}
			if ((int)comp.size() >= b) {
				for (int j = 0; j < b; j++) {
					color[comp[j]] = 2;
				}
			}
		}
	}
	vector<int> res(n);
	for (int i = 0; i < n; i++) {
		res[i] = color[i] ? (color[i] ^ (flip ? 3 : 0)) : 3;
	}
	return res;
}

vector<int> find_split(int _n, int _a, int _b, int _c, vector<int> p, vector<int> q) {
	n = _n;
	m = p.size();
	for (int i = 0; i < m; i++) {
		adj[p[i]].push_back(q[i]);
		adj[q[i]].push_back(p[i]);
	}
	vector<pair<int, int>> order = {{_a, 1}, {_b, 2}, {_c, 3}};
	sort(order.begin(), order.end());
	a = order[0].first;
	b = order[1].first;
	c = order[2].first;
	vector<int> res = solve();
	for (int i = 0; i < n; i++) {
		if (res[i] > 0) {
			res[i] = order[res[i] - 1].second;
		}
	}
	return res;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB ok, correct split
2 Correct 2 ms 2644 KB ok, correct split
3 Correct 2 ms 2656 KB ok, correct split
4 Correct 1 ms 2644 KB ok, correct split
5 Correct 2 ms 2644 KB ok, correct split
6 Correct 2 ms 2644 KB ok, correct split
7 Correct 72 ms 18644 KB ok, correct split
8 Correct 54 ms 15984 KB ok, correct split
9 Correct 73 ms 15548 KB ok, correct split
10 Correct 52 ms 18516 KB ok, correct split
11 Correct 49 ms 18968 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB ok, correct split
2 Correct 2 ms 2636 KB ok, correct split
3 Correct 2 ms 2652 KB ok, correct split
4 Correct 67 ms 16076 KB ok, correct split
5 Correct 44 ms 11080 KB ok, correct split
6 Correct 48 ms 18624 KB ok, correct split
7 Correct 56 ms 16020 KB ok, correct split
8 Correct 71 ms 14356 KB ok, correct split
9 Correct 49 ms 11120 KB ok, correct split
10 Correct 34 ms 11088 KB ok, correct split
11 Correct 40 ms 10988 KB ok, correct split
12 Correct 50 ms 11356 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB ok, correct split
2 Correct 46 ms 11096 KB ok, correct split
3 Correct 16 ms 6104 KB ok, correct split
4 Correct 1 ms 2660 KB ok, correct split
5 Correct 49 ms 13812 KB ok, correct split
6 Correct 41 ms 13544 KB ok, correct split
7 Correct 65 ms 13160 KB ok, correct split
8 Correct 56 ms 14628 KB ok, correct split
9 Correct 60 ms 13020 KB ok, correct split
10 Correct 14 ms 5332 KB ok, no valid answer
11 Correct 20 ms 6628 KB ok, no valid answer
12 Correct 35 ms 10808 KB ok, no valid answer
13 Correct 39 ms 10572 KB ok, no valid answer
14 Correct 33 ms 10848 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB ok, correct split
2 Correct 2 ms 2660 KB ok, no valid answer
3 Correct 1 ms 2644 KB ok, correct split
4 Correct 1 ms 2644 KB ok, correct split
5 Correct 2 ms 2644 KB ok, correct split
6 Correct 2 ms 2644 KB ok, correct split
7 Correct 1 ms 2644 KB ok, correct split
8 Correct 1 ms 2644 KB ok, correct split
9 Correct 3 ms 2924 KB ok, correct split
10 Correct 3 ms 2924 KB ok, correct split
11 Correct 2 ms 2644 KB ok, correct split
12 Correct 3 ms 2900 KB ok, correct split
13 Correct 1 ms 2644 KB ok, correct split
14 Correct 1 ms 2660 KB ok, correct split
15 Correct 1 ms 2660 KB ok, correct split
16 Correct 2 ms 2644 KB ok, correct split
17 Correct 2 ms 2644 KB ok, correct split
18 Correct 1 ms 2660 KB ok, correct split
19 Correct 2 ms 2644 KB ok, correct split
20 Correct 2 ms 2772 KB ok, correct split
21 Correct 2 ms 2900 KB ok, correct split
22 Correct 3 ms 2900 KB ok, correct split
23 Correct 3 ms 2928 KB ok, correct split
24 Correct 3 ms 2824 KB ok, correct split
25 Correct 2 ms 2900 KB ok, correct split
26 Correct 3 ms 2900 KB ok, correct split
27 Correct 3 ms 2900 KB ok, correct split
28 Correct 3 ms 2900 KB ok, correct split
29 Correct 2 ms 2644 KB ok, correct split
30 Correct 3 ms 2900 KB ok, correct split
31 Correct 2 ms 2644 KB ok, correct split
32 Correct 4 ms 2644 KB ok, correct split
33 Correct 2 ms 2644 KB ok, correct split
34 Correct 3 ms 2800 KB ok, correct split
35 Correct 3 ms 2900 KB ok, correct split
36 Correct 3 ms 2800 KB ok, correct split
37 Correct 3 ms 2928 KB ok, correct split
38 Correct 3 ms 2900 KB ok, correct split
39 Correct 3 ms 2900 KB ok, correct split
40 Correct 3 ms 2856 KB ok, correct split
41 Correct 3 ms 2804 KB ok, correct split
42 Correct 2 ms 2796 KB ok, correct split
43 Correct 3 ms 2920 KB ok, correct split
44 Correct 3 ms 2928 KB ok, correct split
45 Correct 3 ms 2928 KB ok, correct split
46 Correct 2 ms 2924 KB ok, correct split
47 Correct 2 ms 2900 KB ok, no valid answer
48 Correct 2 ms 2772 KB ok, correct split
49 Correct 3 ms 2900 KB ok, correct split
50 Correct 2 ms 2644 KB ok, no valid answer
51 Correct 2 ms 2644 KB ok, no valid answer
52 Correct 2 ms 2772 KB ok, no valid answer
53 Correct 3 ms 2900 KB ok, no valid answer
54 Correct 2 ms 2792 KB ok, no valid answer
55 Correct 2 ms 2800 KB ok, no valid answer
56 Correct 2 ms 2900 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB ok, correct split
2 Correct 2 ms 2644 KB ok, correct split
3 Correct 2 ms 2656 KB ok, correct split
4 Correct 1 ms 2644 KB ok, correct split
5 Correct 2 ms 2644 KB ok, correct split
6 Correct 2 ms 2644 KB ok, correct split
7 Correct 72 ms 18644 KB ok, correct split
8 Correct 54 ms 15984 KB ok, correct split
9 Correct 73 ms 15548 KB ok, correct split
10 Correct 52 ms 18516 KB ok, correct split
11 Correct 49 ms 18968 KB ok, correct split
12 Correct 2 ms 2644 KB ok, correct split
13 Correct 2 ms 2636 KB ok, correct split
14 Correct 2 ms 2652 KB ok, correct split
15 Correct 67 ms 16076 KB ok, correct split
16 Correct 44 ms 11080 KB ok, correct split
17 Correct 48 ms 18624 KB ok, correct split
18 Correct 56 ms 16020 KB ok, correct split
19 Correct 71 ms 14356 KB ok, correct split
20 Correct 49 ms 11120 KB ok, correct split
21 Correct 34 ms 11088 KB ok, correct split
22 Correct 40 ms 10988 KB ok, correct split
23 Correct 50 ms 11356 KB ok, correct split
24 Correct 1 ms 2644 KB ok, correct split
25 Correct 46 ms 11096 KB ok, correct split
26 Correct 16 ms 6104 KB ok, correct split
27 Correct 1 ms 2660 KB ok, correct split
28 Correct 49 ms 13812 KB ok, correct split
29 Correct 41 ms 13544 KB ok, correct split
30 Correct 65 ms 13160 KB ok, correct split
31 Correct 56 ms 14628 KB ok, correct split
32 Correct 60 ms 13020 KB ok, correct split
33 Correct 14 ms 5332 KB ok, no valid answer
34 Correct 20 ms 6628 KB ok, no valid answer
35 Correct 35 ms 10808 KB ok, no valid answer
36 Correct 39 ms 10572 KB ok, no valid answer
37 Correct 33 ms 10848 KB ok, no valid answer
38 Correct 2 ms 2644 KB ok, correct split
39 Correct 2 ms 2660 KB ok, no valid answer
40 Correct 1 ms 2644 KB ok, correct split
41 Correct 1 ms 2644 KB ok, correct split
42 Correct 2 ms 2644 KB ok, correct split
43 Correct 2 ms 2644 KB ok, correct split
44 Correct 1 ms 2644 KB ok, correct split
45 Correct 1 ms 2644 KB ok, correct split
46 Correct 3 ms 2924 KB ok, correct split
47 Correct 3 ms 2924 KB ok, correct split
48 Correct 2 ms 2644 KB ok, correct split
49 Correct 3 ms 2900 KB ok, correct split
50 Correct 1 ms 2644 KB ok, correct split
51 Correct 1 ms 2660 KB ok, correct split
52 Correct 1 ms 2660 KB ok, correct split
53 Correct 2 ms 2644 KB ok, correct split
54 Correct 2 ms 2644 KB ok, correct split
55 Correct 1 ms 2660 KB ok, correct split
56 Correct 2 ms 2644 KB ok, correct split
57 Correct 2 ms 2772 KB ok, correct split
58 Correct 2 ms 2900 KB ok, correct split
59 Correct 3 ms 2900 KB ok, correct split
60 Correct 3 ms 2928 KB ok, correct split
61 Correct 3 ms 2824 KB ok, correct split
62 Correct 2 ms 2900 KB ok, correct split
63 Correct 3 ms 2900 KB ok, correct split
64 Correct 3 ms 2900 KB ok, correct split
65 Correct 3 ms 2900 KB ok, correct split
66 Correct 2 ms 2644 KB ok, correct split
67 Correct 3 ms 2900 KB ok, correct split
68 Correct 2 ms 2644 KB ok, correct split
69 Correct 4 ms 2644 KB ok, correct split
70 Correct 2 ms 2644 KB ok, correct split
71 Correct 3 ms 2800 KB ok, correct split
72 Correct 3 ms 2900 KB ok, correct split
73 Correct 3 ms 2800 KB ok, correct split
74 Correct 3 ms 2928 KB ok, correct split
75 Correct 3 ms 2900 KB ok, correct split
76 Correct 3 ms 2900 KB ok, correct split
77 Correct 3 ms 2856 KB ok, correct split
78 Correct 3 ms 2804 KB ok, correct split
79 Correct 2 ms 2796 KB ok, correct split
80 Correct 3 ms 2920 KB ok, correct split
81 Correct 3 ms 2928 KB ok, correct split
82 Correct 3 ms 2928 KB ok, correct split
83 Correct 2 ms 2924 KB ok, correct split
84 Correct 2 ms 2900 KB ok, no valid answer
85 Correct 2 ms 2772 KB ok, correct split
86 Correct 3 ms 2900 KB ok, correct split
87 Correct 2 ms 2644 KB ok, no valid answer
88 Correct 2 ms 2644 KB ok, no valid answer
89 Correct 2 ms 2772 KB ok, no valid answer
90 Correct 3 ms 2900 KB ok, no valid answer
91 Correct 2 ms 2792 KB ok, no valid answer
92 Correct 2 ms 2800 KB ok, no valid answer
93 Correct 2 ms 2900 KB ok, no valid answer
94 Correct 74 ms 14068 KB ok, correct split
95 Correct 84 ms 19600 KB ok, correct split
96 Correct 65 ms 17796 KB ok, correct split
97 Correct 17 ms 6104 KB ok, correct split
98 Correct 18 ms 6204 KB ok, correct split
99 Correct 28 ms 8800 KB ok, correct split
100 Correct 67 ms 15152 KB ok, correct split
101 Correct 69 ms 13904 KB ok, correct split
102 Correct 54 ms 13288 KB ok, correct split
103 Correct 51 ms 12984 KB ok, correct split
104 Correct 55 ms 14808 KB ok, correct split
105 Correct 26 ms 7968 KB ok, correct split
106 Correct 69 ms 14788 KB ok, correct split
107 Correct 42 ms 11216 KB ok, correct split
108 Correct 40 ms 11244 KB ok, correct split
109 Correct 77 ms 14508 KB ok, correct split
110 Correct 65 ms 14408 KB ok, correct split
111 Correct 77 ms 14436 KB ok, correct split
112 Correct 64 ms 14760 KB ok, correct split
113 Correct 67 ms 14768 KB ok, correct split
114 Correct 7 ms 4180 KB ok, correct split
115 Correct 7 ms 3956 KB ok, correct split
116 Correct 75 ms 14352 KB ok, correct split
117 Correct 60 ms 14268 KB ok, correct split
118 Correct 42 ms 11128 KB ok, correct split
119 Correct 42 ms 11236 KB ok, correct split
120 Correct 43 ms 15340 KB ok, correct split
121 Correct 45 ms 10680 KB ok, no valid answer
122 Correct 50 ms 10724 KB ok, no valid answer
123 Correct 68 ms 14788 KB ok, no valid answer
124 Correct 66 ms 14648 KB ok, no valid answer
125 Correct 42 ms 11716 KB ok, no valid answer
126 Correct 30 ms 10124 KB ok, no valid answer
127 Correct 46 ms 12264 KB ok, no valid answer