oj.uz

Submission #630481

# Submission time Handle Problem Language Result Execution time Memory
630481 2022-08-16T12:16:26 Z Arnch Mergers (JOI19_mergers) C++17
70 / 100
 1435 ms 262144 KB 
// oooo
/*
 har chi delet mikhad bebar ~
 gitar o ba khodet nabar! ~
 ;Amoo_Hasan;
*/

#include<bits/stdc++.h>
//#pragma GCC optimize("O3,no-stack-protector,unroll-loops")
//#pragma GCC target("avx2,fma")

using namespace std;

typedef long long ll;
typedef long double ld;

#define Sz(x) int((x).size())
#define All(x) (x).begin(), (x).end()
#define wtf(x) cout<<#x <<" : " <<x <<endl
#define mak make_pair

//constexpr int PRI = 1000696969;
constexpr int N = 2e6 + 10, MAXN = 5e5 + 10, LOG = 22;

int n, k;
int s[N], sub[MAXN], head[MAXN], link[MAXN], fin[N];
int par[MAXN][LOG], h[MAXN], st[MAXN], fn[MAXN], tim;
int sz[N], pv[N];
int ans, total;
int seg[N];
vector<int> vc[N], adj[MAXN], nei[N], his;

void dfs(int x, int p = -1) {
	par[x][0] = p;
	for(int i = 1; i < LOG; i++) par[x][i] = par[par[x][i - 1]][i - 1];
	h[x] = h[p] + 1;
	sub[x] = 1;
	for(auto j : adj[x]) {
		if(j == p) continue;
		dfs(j, x);
		sub[x] += sub[j];
	}
}
void hld(int x, int p = -1, int hi = 0) {
	link[tim] = x;
	st[x] = tim++;
	head[x] = hi;

	int bz = -1;
	for(auto j : adj[x]) {
		if(j == p) continue;
		if(bz == -1 || sub[bz] < sub[j]) bz = j;
	}
	if(bz == -1) {
		fn[x] = tim;
		return;
	}

	hld(bz, x, hi);
	for(auto j : adj[x]) {
		if(j == p || j == bz) continue;
		hld(j, x, j);
	}
	fn[x] = tim;
}

int get_par(int x, int y) {
	for(int i = 0; i < LOG; i++)
		if((y >> i) & 1)
			x = par[x][i];
	return x;
}
int lca(int x, int y) {
	if(h[x] > h[y]) swap(x, y);
	y = get_par(y, h[y] - h[x]);
	if(x == y) return x;
	for(int i = LOG - 1; i >= 0; i--)
		if(par[x][i] != par[y][i])
			x = par[x][i], y = par[y][i];
	return par[x][0];
}

int find(int x) {
	if(pv[x] == x) return x;
	return pv[x] = find(pv[x]);
}
void merge(int x, int y) {
//	cout<<"^^" <<x <<' ' <<y <<endl;
	int X = find(x), Y = find(y);
	if(X == Y) return;
	if(sz[X] < sz[Y]) swap(X, Y);
	pv[Y] = X, sz[X] += sz[Y];
}

void build(int l = 0, int r = n, int v = 1) {
	seg[v] = -1;
	if(r - l < 2) {
		fin[link[l]] = v;
		return;
	}
	int mid = (l + r) >> 1;
	build(l, mid, 2 * v), build(mid, r, 2 * v + 1);
	total = max(total, v);
}
void upd(int s, int e, int val, int l = 0, int r = n, int v = 1) {
	if(r <= s || l >= e) return;
	if(l >= s && r <= e) {
		if(seg[v] == -1) seg[v] = val;
		else merge(seg[v], val);
		return;
	}
	int mid = (l + r) >> 1;
	upd(s, e, val, l, mid, 2 * v), upd(s, e, val, mid, r, 2 * v + 1);
}
void relax(int l = 0, int r = n, int v = 1) {
	if(r - l < 2) {
		if(seg[v] != -1) merge(seg[v], s[link[l]]);
		return;
	}
	int mid = (l + r) >> 1;
	if(seg[v] != -1) {
		if(seg[2 * v] == -1) seg[2 * v] = seg[v];
		else merge(seg[v], seg[2 * v]);

		if(seg[2 * v + 1] == -1) seg[2 * v + 1] = seg[v];
		else merge(seg[v], seg[2 * v + 1]);
	}
	relax(l, mid, 2 * v), relax(mid, r, 2 * v + 1);
}

bool cmp(int i, int j) {
	return st[i] < st[j];
}
void solve(int x) {
	vector<int> ver;
	for(auto i : vc[x]) ver.push_back(i);
	sort(All(ver), cmp);
	int sz = Sz(ver);
	for(int i = 1; i < sz; i++) {
		ver.push_back(lca(ver[i - 1], ver[i]));
	}
	sort(All(ver), cmp);
	ver.erase(unique(All(ver)), ver.end());

	stack<int> mt;
	mt.push(ver[0]);

	upd(st[ver[0]], st[ver[0]] + 1, x);
	for(int i = 1; i < Sz(ver); i++) {
		int v = ver[i];
		while(fn[mt.top()] < fn[v]) mt.pop();
		int p = mt.top();
	
		upd(st[v], st[v] + 1, x);
	
		int u = v;
		while(u != -1 && h[u] >= h[p]) {
			if(h[head[u]] < h[p]) break;
			upd(st[head[u]], st[u] + 1, x);
			u = par[head[u]][0];
		}
		if(h[u] >= h[p]) {
			upd(st[p], st[u] + 1, x);
		}

		mt.push(v);
	}
}

int main() {
	ios :: sync_with_stdio(0), cin.tie(0); cout.tie(0);

	for(int i = 0; i < N; i++) sz[i] = 1, pv[i] = i;

	cin >>n >>k;
	for(int i = 0; i < n - 1; i++) {
		int u, v; cin >>u >>v;
		--u, --v;
		adj[u].push_back(v), adj[v].push_back(u);
	}
	dfs(0);
	hld(0);
		
	for(int i = 0; i < n; i++) {
		cin >>s[i];
	}
	
	build();
	
	for(int i = 0; i < n; i++) {
		--s[i], s[i] += total;
		vc[s[i]].push_back(i);
	}

	for(int i = total; i < total + k; i++) {
		solve(i);
	}

	relax();

	for(int i = 0; i < N; i++) pv[i] = find(pv[i]);

	for(int i = 0; i < n; i++) {
		int u = s[i];
		for(auto j : adj[i]) {
			int v = s[j];
			if(pv[u] == pv[v]) continue;
			nei[pv[u]].push_back(pv[v]);
			nei[pv[v]].push_back(pv[u]);
		}
	}

	for(int i = 0; i < N; i++) {
		nei[i].erase(unique(All(nei[i])), nei[i].end());
		if(Sz(nei[i]) == 1) ans++;
	}
	cout<<(ans + 1) / 2;

	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 121700 KB Output is correct
2 Correct 66 ms 121632 KB Output is correct
3 Correct 68 ms 121620 KB Output is correct
4 Correct 67 ms 121712 KB Output is correct
5 Correct 67 ms 121704 KB Output is correct
6 Correct 72 ms 121720 KB Output is correct
7 Correct 67 ms 121676 KB Output is correct
8 Correct 76 ms 121620 KB Output is correct
9 Correct 69 ms 121708 KB Output is correct
10 Correct 71 ms 121660 KB Output is correct
11 Correct 68 ms 121676 KB Output is correct
12 Correct 69 ms 121652 KB Output is correct
13 Correct 76 ms 121764 KB Output is correct
14 Correct 67 ms 121712 KB Output is correct
15 Correct 68 ms 121708 KB Output is correct
16 Correct 74 ms 121708 KB Output is correct
17 Correct 70 ms 121708 KB Output is correct
18 Correct 68 ms 121716 KB Output is correct
19 Correct 68 ms 121708 KB Output is correct
20 Correct 78 ms 121696 KB Output is correct
21 Correct 72 ms 121700 KB Output is correct
22 Correct 80 ms 121656 KB Output is correct
23 Correct 70 ms 121752 KB Output is correct
24 Correct 69 ms 121656 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 121700 KB Output is correct
2 Correct 66 ms 121632 KB Output is correct
3 Correct 68 ms 121620 KB Output is correct
4 Correct 67 ms 121712 KB Output is correct
5 Correct 67 ms 121704 KB Output is correct
6 Correct 72 ms 121720 KB Output is correct
7 Correct 67 ms 121676 KB Output is correct
8 Correct 76 ms 121620 KB Output is correct
9 Correct 69 ms 121708 KB Output is correct
10 Correct 71 ms 121660 KB Output is correct
11 Correct 68 ms 121676 KB Output is correct
12 Correct 69 ms 121652 KB Output is correct
13 Correct 76 ms 121764 KB Output is correct
14 Correct 67 ms 121712 KB Output is correct
15 Correct 68 ms 121708 KB Output is correct
16 Correct 74 ms 121708 KB Output is correct
17 Correct 70 ms 121708 KB Output is correct
18 Correct 68 ms 121716 KB Output is correct
19 Correct 68 ms 121708 KB Output is correct
20 Correct 78 ms 121696 KB Output is correct
21 Correct 72 ms 121700 KB Output is correct
22 Correct 80 ms 121656 KB Output is correct
23 Correct 70 ms 121752 KB Output is correct
24 Correct 69 ms 121656 KB Output is correct
25 Correct 69 ms 121720 KB Output is correct
26 Correct 71 ms 122236 KB Output is correct
27 Correct 73 ms 122228 KB Output is correct
28 Correct 76 ms 122420 KB Output is correct
29 Correct 73 ms 122336 KB Output is correct
30 Correct 74 ms 122140 KB Output is correct
31 Correct 68 ms 121716 KB Output is correct
32 Correct 71 ms 122468 KB Output is correct
33 Correct 85 ms 121772 KB Output is correct
34 Correct 73 ms 122176 KB Output is correct
35 Correct 73 ms 122468 KB Output is correct
36 Correct 70 ms 122192 KB Output is correct
37 Correct 74 ms 122236 KB Output is correct
38 Correct 75 ms 121620 KB Output is correct
39 Correct 74 ms 122260 KB Output is correct
40 Correct 73 ms 122188 KB Output is correct
41 Correct 75 ms 122228 KB Output is correct
42 Correct 71 ms 122292 KB Output is correct
43 Correct 81 ms 122412 KB Output is correct
44 Correct 69 ms 121604 KB Output is correct
45 Correct 70 ms 122332 KB Output is correct
46 Correct 72 ms 122188 KB Output is correct
47 Correct 70 ms 121684 KB Output is correct
48 Correct 73 ms 122136 KB Output is correct
49 Correct 74 ms 122544 KB Output is correct
50 Correct 72 ms 122364 KB Output is correct
51 Correct 72 ms 122188 KB Output is correct
52 Correct 71 ms 122264 KB Output is correct
53 Correct 72 ms 122188 KB Output is correct
54 Correct 74 ms 122208 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 121700 KB Output is correct
2 Correct 66 ms 121632 KB Output is correct
3 Correct 68 ms 121620 KB Output is correct
4 Correct 67 ms 121712 KB Output is correct
5 Correct 67 ms 121704 KB Output is correct
6 Correct 72 ms 121720 KB Output is correct
7 Correct 67 ms 121676 KB Output is correct
8 Correct 76 ms 121620 KB Output is correct
9 Correct 69 ms 121708 KB Output is correct
10 Correct 71 ms 121660 KB Output is correct
11 Correct 68 ms 121676 KB Output is correct
12 Correct 69 ms 121652 KB Output is correct
13 Correct 76 ms 121764 KB Output is correct
14 Correct 67 ms 121712 KB Output is correct
15 Correct 68 ms 121708 KB Output is correct
16 Correct 74 ms 121708 KB Output is correct
17 Correct 70 ms 121708 KB Output is correct
18 Correct 68 ms 121716 KB Output is correct
19 Correct 68 ms 121708 KB Output is correct
20 Correct 78 ms 121696 KB Output is correct
21 Correct 72 ms 121700 KB Output is correct
22 Correct 80 ms 121656 KB Output is correct
23 Correct 70 ms 121752 KB Output is correct
24 Correct 69 ms 121656 KB Output is correct
25 Correct 67 ms 121704 KB Output is correct
26 Correct 197 ms 138488 KB Output is correct
27 Correct 288 ms 138300 KB Output is correct
28 Correct 73 ms 122232 KB Output is correct
29 Correct 69 ms 121716 KB Output is correct
30 Correct 70 ms 121624 KB Output is correct
31 Correct 215 ms 138232 KB Output is correct
32 Correct 72 ms 122232 KB Output is correct
33 Correct 281 ms 145316 KB Output is correct
34 Correct 274 ms 138268 KB Output is correct
35 Correct 70 ms 122188 KB Output is correct
36 Correct 245 ms 138956 KB Output is correct
37 Correct 71 ms 122196 KB Output is correct
38 Correct 72 ms 122188 KB Output is correct
39 Correct 219 ms 138572 KB Output is correct
40 Correct 70 ms 122424 KB Output is correct
41 Correct 244 ms 139188 KB Output is correct
42 Correct 282 ms 140544 KB Output is correct
43 Correct 67 ms 121728 KB Output is correct
44 Correct 260 ms 146744 KB Output is correct
45 Correct 320 ms 141996 KB Output is correct
46 Correct 72 ms 122236 KB Output is correct
47 Correct 71 ms 122108 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 138588 KB Output is correct
2 Correct 198 ms 144976 KB Output is correct
3 Correct 71 ms 122312 KB Output is correct
4 Correct 72 ms 122224 KB Output is correct
5 Correct 78 ms 121628 KB Output is correct
6 Correct 69 ms 121712 KB Output is correct
7 Correct 71 ms 122188 KB Output is correct
8 Correct 250 ms 139692 KB Output is correct
9 Correct 71 ms 122188 KB Output is correct
10 Correct 214 ms 138304 KB Output is correct
11 Correct 69 ms 121724 KB Output is correct
12 Correct 209 ms 138236 KB Output is correct
13 Correct 227 ms 140052 KB Output is correct
14 Correct 227 ms 144680 KB Output is correct
15 Correct 196 ms 138564 KB Output is correct
16 Correct 70 ms 122196 KB Output is correct
17 Correct 80 ms 121708 KB Output is correct
18 Correct 190 ms 144284 KB Output is correct
19 Correct 259 ms 147924 KB Output is correct
20 Correct 70 ms 122144 KB Output is correct
21 Correct 70 ms 121676 KB Output is correct
22 Correct 200 ms 140356 KB Output is correct
23 Correct 86 ms 122172 KB Output is correct
24 Correct 210 ms 138800 KB Output is correct
25 Correct 257 ms 147724 KB Output is correct
26 Correct 74 ms 122428 KB Output is correct
27 Correct 78 ms 122428 KB Output is correct
28 Correct 71 ms 122216 KB Output is correct
29 Correct 71 ms 122232 KB Output is correct
30 Correct 76 ms 122164 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 121700 KB Output is correct
2 Correct 66 ms 121632 KB Output is correct
3 Correct 68 ms 121620 KB Output is correct
4 Correct 67 ms 121712 KB Output is correct
5 Correct 67 ms 121704 KB Output is correct
6 Correct 72 ms 121720 KB Output is correct
7 Correct 67 ms 121676 KB Output is correct
8 Correct 76 ms 121620 KB Output is correct
9 Correct 69 ms 121708 KB Output is correct
10 Correct 71 ms 121660 KB Output is correct
11 Correct 68 ms 121676 KB Output is correct
12 Correct 69 ms 121652 KB Output is correct
13 Correct 76 ms 121764 KB Output is correct
14 Correct 67 ms 121712 KB Output is correct
15 Correct 68 ms 121708 KB Output is correct
16 Correct 74 ms 121708 KB Output is correct
17 Correct 70 ms 121708 KB Output is correct
18 Correct 68 ms 121716 KB Output is correct
19 Correct 68 ms 121708 KB Output is correct
20 Correct 78 ms 121696 KB Output is correct
21 Correct 72 ms 121700 KB Output is correct
22 Correct 80 ms 121656 KB Output is correct
23 Correct 70 ms 121752 KB Output is correct
24 Correct 69 ms 121656 KB Output is correct
25 Correct 69 ms 121720 KB Output is correct
26 Correct 71 ms 122236 KB Output is correct
27 Correct 73 ms 122228 KB Output is correct
28 Correct 76 ms 122420 KB Output is correct
29 Correct 73 ms 122336 KB Output is correct
30 Correct 74 ms 122140 KB Output is correct
31 Correct 68 ms 121716 KB Output is correct
32 Correct 71 ms 122468 KB Output is correct
33 Correct 85 ms 121772 KB Output is correct
34 Correct 73 ms 122176 KB Output is correct
35 Correct 73 ms 122468 KB Output is correct
36 Correct 70 ms 122192 KB Output is correct
37 Correct 74 ms 122236 KB Output is correct
38 Correct 75 ms 121620 KB Output is correct
39 Correct 74 ms 122260 KB Output is correct
40 Correct 73 ms 122188 KB Output is correct
41 Correct 75 ms 122228 KB Output is correct
42 Correct 71 ms 122292 KB Output is correct
43 Correct 81 ms 122412 KB Output is correct
44 Correct 69 ms 121604 KB Output is correct
45 Correct 70 ms 122332 KB Output is correct
46 Correct 72 ms 122188 KB Output is correct
47 Correct 70 ms 121684 KB Output is correct
48 Correct 73 ms 122136 KB Output is correct
49 Correct 74 ms 122544 KB Output is correct
50 Correct 72 ms 122364 KB Output is correct
51 Correct 72 ms 122188 KB Output is correct
52 Correct 71 ms 122264 KB Output is correct
53 Correct 72 ms 122188 KB Output is correct
54 Correct 74 ms 122208 KB Output is correct
55 Correct 67 ms 121704 KB Output is correct
56 Correct 197 ms 138488 KB Output is correct
57 Correct 288 ms 138300 KB Output is correct
58 Correct 73 ms 122232 KB Output is correct
59 Correct 69 ms 121716 KB Output is correct
60 Correct 70 ms 121624 KB Output is correct
61 Correct 215 ms 138232 KB Output is correct
62 Correct 72 ms 122232 KB Output is correct
63 Correct 281 ms 145316 KB Output is correct
64 Correct 274 ms 138268 KB Output is correct
65 Correct 70 ms 122188 KB Output is correct
66 Correct 245 ms 138956 KB Output is correct
67 Correct 71 ms 122196 KB Output is correct
68 Correct 72 ms 122188 KB Output is correct
69 Correct 219 ms 138572 KB Output is correct
70 Correct 70 ms 122424 KB Output is correct
71 Correct 244 ms 139188 KB Output is correct
72 Correct 282 ms 140544 KB Output is correct
73 Correct 67 ms 121728 KB Output is correct
74 Correct 260 ms 146744 KB Output is correct
75 Correct 320 ms 141996 KB Output is correct
76 Correct 72 ms 122236 KB Output is correct
77 Correct 71 ms 122108 KB Output is correct
78 Correct 207 ms 138588 KB Output is correct
79 Correct 198 ms 144976 KB Output is correct
80 Correct 71 ms 122312 KB Output is correct
81 Correct 72 ms 122224 KB Output is correct
82 Correct 78 ms 121628 KB Output is correct
83 Correct 69 ms 121712 KB Output is correct
84 Correct 71 ms 122188 KB Output is correct
85 Correct 250 ms 139692 KB Output is correct
86 Correct 71 ms 122188 KB Output is correct
87 Correct 214 ms 138304 KB Output is correct
88 Correct 69 ms 121724 KB Output is correct
89 Correct 209 ms 138236 KB Output is correct
90 Correct 227 ms 140052 KB Output is correct
91 Correct 227 ms 144680 KB Output is correct
92 Correct 196 ms 138564 KB Output is correct
93 Correct 70 ms 122196 KB Output is correct
94 Correct 80 ms 121708 KB Output is correct
95 Correct 190 ms 144284 KB Output is correct
96 Correct 259 ms 147924 KB Output is correct
97 Correct 70 ms 122144 KB Output is correct
98 Correct 70 ms 121676 KB Output is correct
99 Correct 200 ms 140356 KB Output is correct
100 Correct 86 ms 122172 KB Output is correct
101 Correct 210 ms 138800 KB Output is correct
102 Correct 257 ms 147724 KB Output is correct
103 Correct 74 ms 122428 KB Output is correct
104 Correct 78 ms 122428 KB Output is correct
105 Correct 71 ms 122216 KB Output is correct
106 Correct 71 ms 122232 KB Output is correct
107 Correct 76 ms 122164 KB Output is correct
108 Correct 996 ms 210424 KB Output is correct
109 Correct 1435 ms 224712 KB Output is correct
110 Correct 1423 ms 237232 KB Output is correct
111 Runtime error 1142 ms 262144 KB Execution killed with signal 11
112 Halted 0 ms 0 KB -