oj.uz

답안 #285256

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
285256 2020-08-28T14:01:09 Z cookiedoth Split the Attractions (IOI19_split) C++14
100 / 100
 272 ms 35944 KB 
/*

Code for problem B by cookiedoth
Generated 28 Aug 2020 at 01.11 PM


СТРОИМ КОММУНИЗМ РАБОТЯГИ!
 
                                    ╦═╩═╦═╩═█
                          ████▄▄▄═╦═╩═╦═╩═╦═█
                  ████████████████▄▄╦═╩═╦═╩═█
█═╦═╩═╦▄████████████████▀▀▀▀█████████▄╦═╩═╦═█
█═╩═╦═████████████████████▄═╦▀█████████═╦═╩═█
█═╦═▄██████████▀╩═╦═╩▄██████▄═╦▀████████▄═╦═█
█═╩═█████████▀╩═╦═╩═█████████▄╩═╦████████═╩═█
█═╦█████████▄═╦═╩═╦═▀█████████╦═╩═████████╦═█
█═╩███████████▄▄██▄═╦═▀████████═╦═████████╩═█
█═██████████████████▄═╦═▀█████▀═╩═█████████═█
█═████████████████████▄═╦═▀███╩═╦═█████████═█
█═╦████████████▀╩▀██████▄═╦═▀═╦═╩█████████╦═█
█═╩█████████▀═╩═╦═╩▀▀███▀▀╩═╦═╩═██████████╩═█
█═╦═██████▀═╦═▄▄█▄▄═╩═╦═╩═╦═╩═╦═╩▀███████═╦═█
█═╩═▀████═╩═▄█████████▄▄▄▄████▄═╦═╩█████▀═╩═█
█═╦═╩═██████████████████████████▄═▄████═╩═╦═█
█═╩═╦═╩▀█████████████████████████████▀╩═╦═╩═█
█═╦═╩═╦═╩▀▀███████████████████████▀▀╩═╦═╩═╦═█
█═╩═╦═╩═╦═╩═▀▀▀███████████████▀▀▀═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═▀▀▀▀▀▀▀▀▀═╩═╦═╩═╦═╩═╦═╩═╦═█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄█

=_=
¯\_(ツ)_/¯
o_O

*/

#include "split.h"
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <string>
#include <queue>
#include <deque>
#include <stack>
#include <complex>
#include <cassert>
#include <random>
#include <cstring>
#include <numeric>
#include <random>
#define ll long long
#define ld long double
#define null NULL
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define debug(a) cerr << #a << " = " << a << endl
#define forn(i, n) for (int i = 0; i < n; ++i)
#define length(a) (int)a.size()

using namespace std;

template<class T> int chkmax(T &a, T b) {
	if (b > a) {
		a = b;
		return 1;
	}
	return 0;
}

template<class T> int chkmin(T &a, T b) {
	if (b < a) {
		a = b;
		return 1;
	}
	return 0;
}

template<class iterator> void output(iterator begin, iterator end, ostream& out = cerr) {
	while (begin != end) {
		out << (*begin) << " ";
		begin++;
	}
	out << endl;
}

template<class T> void output(T x, ostream& out = cerr) {
	output(x.begin(), x.end(), out);
}

void fast_io() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
}

const int mx = 1e5 + 228;
vector<vector<int> > g, g_tree;
vector<int> ans, used;
int n;
vector<pair<int, int> > colors;

void dfs(int v) {
	used[v] = 1;
	for (auto v1 : g[v]) {
		// if (v == 3 && v1 == 5) {
		// 	continue;
		// }
		if (used[v1] == 0) {
			// cerr << "tree_edge " << v << " " << v1 << endl;
			g_tree[v].push_back(v1);
			g_tree[v1].push_back(v);
			dfs(v1);
		}
	}
}

void build_g_tree() {
	used.resize(n);
	g_tree.resize(n);
	dfs(0);
}

int c, sz[mx], subtree_id[mx], subtree_size[mx], subtree_cnt;

void sz_dfs(int v, int pv) {
	sz[v] = 1;
	for (auto v1 : g_tree[v]) {
		if (v1 != pv) {
			sz_dfs(v1, v);
			sz[v] += sz[v1];
		}
	}
}

int find_centroid(int v, int pv) {
	for (auto v1 : g_tree[v]) {
		if (v1 != pv && 2 * sz[v1] >= n) {
			return find_centroid(v1, v);
		}
	}
	return v;
}

void dfs_subtree(int v, int pv) {
	subtree_id[v] = subtree_cnt;
	subtree_size[subtree_cnt]++;
	for (auto v1 : g_tree[v]) {
		if (v1 != pv) {
			dfs_subtree(v1, v);
		}
	}
}

void build_centroid_subtrees() {
	sz_dfs(0, 0);
	c = find_centroid(0, 0);
	for (auto v : g_tree[c]) {
		dfs_subtree(v, c);
		subtree_cnt++;
	}
	subtree_id[c] = subtree_cnt;
	// cerr << "c = " << c << endl;
	// cerr << "subtree_id" << endl;
	// output(subtree_id, subtree_id + n);
	// output(subtree_size, subtree_size + subtree_cnt);
}

int a, b, realm[mx];

void build_cmp(int target, int clr, int &cmp_sz, int v) {
	cmp_sz--;
	ans[v] = clr;
	// cerr << "v = " << v << endl;
	for (auto v1 : g[v]) {
		// cerr << "v1 = " << v1 << endl;
		// cerr << (realm[subtree_id[v1]] == target) << endl;
		// cerr << cmp_sz << endl;
		// cerr << ans[v1] << endl;
		if (cmp_sz && ans[v1] == colors[2].second && realm[subtree_id[v1]] == target) {
			build_cmp(target, clr, cmp_sz, v1);
		}
	}
}

void build_cmp(int target, int clr, int cmp_sz) {
	// cerr << "ans" << endl;
	// output(all(ans));
	for (int i = 0; i < n; ++i) {
		if (realm[subtree_id[i]] == target) {
			// cerr << "buid_cmp " << target << " " << clr << " " << cmp_sz << " " << i << endl;
			build_cmp(target, clr, cmp_sz, i);
			return;
		}
	}
	assert(0);
}

vector<pair<int, int> > edges;
vector<set<int> > sg;

int estimate(int v) {
	int res = subtree_size[v];
	used[v] = 1;
	for (auto v1 : sg[v]) {
		if (used[v1] == 0) {
			res += estimate(v1);
		}
	}
	return res;
}

int cool_dfs(int v, int &sum) {
	sum += subtree_size[v];
	realm[v] = 1;
	if (sum >= a) {
		return 1;
	}
	used[v] = 2;
	for (auto v1 : sg[v]) {
		if (used[v1] != 2) {
			if (cool_dfs(v1, sum)) {
				return 1;
			}
		}
	}
	return 0;
}

void build_cmp() {
	fill(all(ans), colors[2].second);
	build_cmp(1, colors[0].second, a);
	build_cmp(0, colors[1].second, b);
}

void build_ans() {
	a = colors[0].first, b = colors[1].first;
	// cerr << "a, b = " << a << " " << b << endl;
	for (int i = 0; i < subtree_cnt; ++i) {
		if (subtree_size[i] >= a) {
			// cerr << "i = " << i << endl;
			realm[i] = 1;
			build_cmp();
			return;
		}
	}
	sg.resize(subtree_cnt);
	for (auto pp : edges) {
		if (pp.first != c && pp.second != c && subtree_id[pp.first] != subtree_id[pp.second]) {
			sg[subtree_id[pp.first]].insert(subtree_id[pp.second]);
			sg[subtree_id[pp.second]].insert(subtree_id[pp.first]);
			// cerr << "sg_edge " << subtree_id[pp.first] << " " << subtree_id[pp.second] << endl;
		}
	}
	used.assign(subtree_cnt, 0);
	for (int i = 0; i < subtree_cnt; ++i) {
		if (used[i] == 0) {
			// cerr << "kek " << i << endl;
			if (estimate(i) >= a) {
				int sum = 0;
				cool_dfs(i, sum);
				build_cmp();
				return;
			}
		}
	}
}

void solve() {
	build_g_tree();
	build_centroid_subtrees();
	build_ans();
}

vector<int> find_split(int _n, int a, int b, int c, vector<int> p, vector<int> q) {
	n = _n;
	colors.emplace_back(a, 1);
	colors.emplace_back(b, 2);
	colors.emplace_back(c, 3);
	sort(all(colors));
	g.resize(n);
	int m = p.size();
	for (int i = 0; i < m; ++i) {
		g[p[i]].push_back(q[i]);
		g[q[i]].push_back(p[i]);
		edges.emplace_back(p[i], q[i]);
	}
	ans.resize(n);
	g_tree.resize(n);
	solve();
	return ans;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB ok, correct split
2 Correct 0 ms 384 KB ok, correct split
3 Correct 0 ms 384 KB ok, correct split
4 Correct 0 ms 384 KB ok, correct split
5 Correct 1 ms 384 KB ok, correct split
6 Correct 1 ms 384 KB ok, correct split
7 Correct 143 ms 21484 KB ok, correct split
8 Correct 129 ms 19692 KB ok, correct split
9 Correct 141 ms 19180 KB ok, correct split
10 Correct 131 ms 21868 KB ok, correct split
11 Correct 142 ms 21872 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB ok, correct split
2 Correct 0 ms 384 KB ok, correct split
3 Correct 1 ms 416 KB ok, correct split
4 Correct 153 ms 19884 KB ok, correct split
5 Correct 118 ms 15852 KB ok, correct split
6 Correct 132 ms 21996 KB ok, correct split
7 Correct 137 ms 19564 KB ok, correct split
8 Correct 180 ms 18280 KB ok, correct split
9 Correct 141 ms 15692 KB ok, correct split
10 Correct 85 ms 16740 KB ok, correct split
11 Correct 91 ms 16868 KB ok, correct split
12 Correct 86 ms 16740 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB ok, correct split
2 Correct 125 ms 15852 KB ok, correct split
3 Correct 38 ms 6520 KB ok, correct split
4 Correct 0 ms 384 KB ok, correct split
5 Correct 152 ms 17660 KB ok, correct split
6 Correct 149 ms 17516 KB ok, correct split
7 Correct 137 ms 17388 KB ok, correct split
8 Correct 137 ms 18412 KB ok, correct split
9 Correct 135 ms 17132 KB ok, correct split
10 Correct 33 ms 5616 KB ok, no valid answer
11 Correct 52 ms 8176 KB ok, no valid answer
12 Correct 103 ms 19308 KB ok, no valid answer
13 Correct 133 ms 16544 KB ok, no valid answer
14 Correct 90 ms 21476 KB ok, no valid answer

Subtask #4
24.0 / 24.0

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

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB ok, correct split
2 Correct 0 ms 384 KB ok, correct split
3 Correct 0 ms 384 KB ok, correct split
4 Correct 0 ms 384 KB ok, correct split
5 Correct 1 ms 384 KB ok, correct split
6 Correct 1 ms 384 KB ok, correct split
7 Correct 143 ms 21484 KB ok, correct split
8 Correct 129 ms 19692 KB ok, correct split
9 Correct 141 ms 19180 KB ok, correct split
10 Correct 131 ms 21868 KB ok, correct split
11 Correct 142 ms 21872 KB ok, correct split
12 Correct 0 ms 256 KB ok, correct split
13 Correct 0 ms 384 KB ok, correct split
14 Correct 1 ms 416 KB ok, correct split
15 Correct 153 ms 19884 KB ok, correct split
16 Correct 118 ms 15852 KB ok, correct split
17 Correct 132 ms 21996 KB ok, correct split
18 Correct 137 ms 19564 KB ok, correct split
19 Correct 180 ms 18280 KB ok, correct split
20 Correct 141 ms 15692 KB ok, correct split
21 Correct 85 ms 16740 KB ok, correct split
22 Correct 91 ms 16868 KB ok, correct split
23 Correct 86 ms 16740 KB ok, correct split
24 Correct 1 ms 384 KB ok, correct split
25 Correct 125 ms 15852 KB ok, correct split
26 Correct 38 ms 6520 KB ok, correct split
27 Correct 0 ms 384 KB ok, correct split
28 Correct 152 ms 17660 KB ok, correct split
29 Correct 149 ms 17516 KB ok, correct split
30 Correct 137 ms 17388 KB ok, correct split
31 Correct 137 ms 18412 KB ok, correct split
32 Correct 135 ms 17132 KB ok, correct split
33 Correct 33 ms 5616 KB ok, no valid answer
34 Correct 52 ms 8176 KB ok, no valid answer
35 Correct 103 ms 19308 KB ok, no valid answer
36 Correct 133 ms 16544 KB ok, no valid answer
37 Correct 90 ms 21476 KB ok, no valid answer
38 Correct 1 ms 384 KB ok, correct split
39 Correct 0 ms 384 KB ok, no valid answer
40 Correct 0 ms 384 KB ok, correct split
41 Correct 1 ms 384 KB ok, correct split
42 Correct 1 ms 384 KB ok, correct split
43 Correct 0 ms 384 KB ok, correct split
44 Correct 0 ms 384 KB ok, correct split
45 Correct 1 ms 384 KB ok, correct split
46 Correct 3 ms 768 KB ok, correct split
47 Correct 3 ms 768 KB ok, correct split
48 Correct 1 ms 384 KB ok, correct split
49 Correct 4 ms 768 KB ok, correct split
50 Correct 0 ms 384 KB ok, correct split
51 Correct 0 ms 384 KB ok, correct split
52 Correct 0 ms 384 KB ok, correct split
53 Correct 0 ms 384 KB ok, correct split
54 Correct 0 ms 384 KB ok, correct split
55 Correct 0 ms 384 KB ok, correct split
56 Correct 1 ms 384 KB ok, correct split
57 Correct 1 ms 512 KB ok, correct split
58 Correct 2 ms 768 KB ok, correct split
59 Correct 3 ms 768 KB ok, correct split
60 Correct 2 ms 768 KB ok, correct split
61 Correct 2 ms 768 KB ok, correct split
62 Correct 3 ms 768 KB ok, correct split
63 Correct 4 ms 1152 KB ok, correct split
64 Correct 4 ms 1152 KB ok, correct split
65 Correct 4 ms 1152 KB ok, correct split
66 Correct 1 ms 384 KB ok, correct split
67 Correct 3 ms 896 KB ok, correct split
68 Correct 1 ms 384 KB ok, correct split
69 Correct 1 ms 384 KB ok, correct split
70 Correct 1 ms 384 KB ok, correct split
71 Correct 3 ms 896 KB ok, correct split
72 Correct 3 ms 896 KB ok, correct split
73 Correct 3 ms 768 KB ok, correct split
74 Correct 4 ms 896 KB ok, correct split
75 Correct 4 ms 896 KB ok, correct split
76 Correct 4 ms 896 KB ok, correct split
77 Correct 4 ms 768 KB ok, correct split
78 Correct 3 ms 512 KB ok, correct split
79 Correct 2 ms 512 KB ok, correct split
80 Correct 4 ms 896 KB ok, correct split
81 Correct 4 ms 896 KB ok, correct split
82 Correct 4 ms 840 KB ok, correct split
83 Correct 2 ms 768 KB ok, correct split
84 Correct 3 ms 768 KB ok, no valid answer
85 Correct 3 ms 768 KB ok, correct split
86 Correct 3 ms 896 KB ok, correct split
87 Correct 1 ms 384 KB ok, no valid answer
88 Correct 1 ms 384 KB ok, no valid answer
89 Correct 3 ms 768 KB ok, no valid answer
90 Correct 3 ms 896 KB ok, no valid answer
91 Correct 3 ms 896 KB ok, no valid answer
92 Correct 3 ms 896 KB ok, no valid answer
93 Correct 3 ms 896 KB ok, no valid answer
94 Correct 151 ms 19436 KB ok, correct split
95 Correct 211 ms 24732 KB ok, correct split
96 Correct 190 ms 22960 KB ok, correct split
97 Correct 37 ms 7024 KB ok, correct split
98 Correct 45 ms 7152 KB ok, correct split
99 Correct 63 ms 9196 KB ok, correct split
100 Correct 182 ms 21224 KB ok, correct split
101 Correct 176 ms 19944 KB ok, correct split
102 Correct 157 ms 19816 KB ok, correct split
103 Correct 148 ms 19560 KB ok, correct split
104 Correct 152 ms 21736 KB ok, correct split
105 Correct 71 ms 11500 KB ok, correct split
106 Correct 272 ms 35944 KB ok, correct split
107 Correct 117 ms 17132 KB ok, correct split
108 Correct 129 ms 17004 KB ok, correct split
109 Correct 186 ms 20716 KB ok, correct split
110 Correct 200 ms 20968 KB ok, correct split
111 Correct 203 ms 20712 KB ok, correct split
112 Correct 202 ms 21096 KB ok, correct split
113 Correct 194 ms 20968 KB ok, correct split
114 Correct 14 ms 2684 KB ok, correct split
115 Correct 13 ms 2556 KB ok, correct split
116 Correct 198 ms 20744 KB ok, correct split
117 Correct 193 ms 20584 KB ok, correct split
118 Correct 149 ms 16876 KB ok, correct split
119 Correct 150 ms 16748 KB ok, correct split
120 Correct 142 ms 20076 KB ok, correct split
121 Correct 117 ms 17004 KB ok, no valid answer
122 Correct 113 ms 18160 KB ok, no valid answer
123 Correct 178 ms 21352 KB ok, no valid answer
124 Correct 196 ms 21608 KB ok, no valid answer
125 Correct 133 ms 22124 KB ok, no valid answer
126 Correct 96 ms 20460 KB ok, no valid answer
127 Correct 140 ms 21608 KB ok, no valid answer