oj.uz

Submission #630485

# Submission time Handle Problem Language Result Execution time Memory
630485 2022-08-16T12:19:33 Z Arnch Mergers (JOI19_mergers) C++17
70 / 100
 1482 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[MAXN], sub[MAXN], head[MAXN], link[MAXN], fin[MAXN];
int par[MAXN][LOG], h[MAXN], st[MAXN], fn[MAXN], tim;
int sz[MAXN], pv[MAXN];
int ans, total;
int seg[N];
vector<int> vc[MAXN], adj[MAXN], nei[MAXN], 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 < MAXN; 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];
		vc[s[i]].push_back(i);
	}

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

	relax();

	for(int i = 0; i < MAXN; 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 < MAXN; 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 21 ms 39508 KB Output is correct
2 Correct 21 ms 39452 KB Output is correct
3 Correct 23 ms 39640 KB Output is correct
4 Correct 23 ms 39464 KB Output is correct
5 Correct 23 ms 39480 KB Output is correct
6 Correct 27 ms 39496 KB Output is correct
7 Correct 24 ms 39444 KB Output is correct
8 Correct 22 ms 39508 KB Output is correct
9 Correct 22 ms 39540 KB Output is correct
10 Correct 22 ms 39536 KB Output is correct
11 Correct 22 ms 39540 KB Output is correct
12 Correct 22 ms 39460 KB Output is correct
13 Correct 21 ms 39528 KB Output is correct
14 Correct 21 ms 39508 KB Output is correct
15 Correct 21 ms 39508 KB Output is correct
16 Correct 23 ms 39508 KB Output is correct
17 Correct 21 ms 39508 KB Output is correct
18 Correct 26 ms 39544 KB Output is correct
19 Correct 25 ms 39444 KB Output is correct
20 Correct 23 ms 39488 KB Output is correct
21 Correct 23 ms 39508 KB Output is correct
22 Correct 22 ms 39508 KB Output is correct
23 Correct 22 ms 39540 KB Output is correct
24 Correct 23 ms 39508 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 39508 KB Output is correct
2 Correct 21 ms 39452 KB Output is correct
3 Correct 23 ms 39640 KB Output is correct
4 Correct 23 ms 39464 KB Output is correct
5 Correct 23 ms 39480 KB Output is correct
6 Correct 27 ms 39496 KB Output is correct
7 Correct 24 ms 39444 KB Output is correct
8 Correct 22 ms 39508 KB Output is correct
9 Correct 22 ms 39540 KB Output is correct
10 Correct 22 ms 39536 KB Output is correct
11 Correct 22 ms 39540 KB Output is correct
12 Correct 22 ms 39460 KB Output is correct
13 Correct 21 ms 39528 KB Output is correct
14 Correct 21 ms 39508 KB Output is correct
15 Correct 21 ms 39508 KB Output is correct
16 Correct 23 ms 39508 KB Output is correct
17 Correct 21 ms 39508 KB Output is correct
18 Correct 26 ms 39544 KB Output is correct
19 Correct 25 ms 39444 KB Output is correct
20 Correct 23 ms 39488 KB Output is correct
21 Correct 23 ms 39508 KB Output is correct
22 Correct 22 ms 39508 KB Output is correct
23 Correct 22 ms 39540 KB Output is correct
24 Correct 23 ms 39508 KB Output is correct
25 Correct 22 ms 39584 KB Output is correct
26 Correct 26 ms 40140 KB Output is correct
27 Correct 26 ms 40052 KB Output is correct
28 Correct 26 ms 40220 KB Output is correct
29 Correct 26 ms 40228 KB Output is correct
30 Correct 26 ms 40020 KB Output is correct
31 Correct 23 ms 39548 KB Output is correct
32 Correct 26 ms 40200 KB Output is correct
33 Correct 22 ms 39540 KB Output is correct
34 Correct 25 ms 40020 KB Output is correct
35 Correct 26 ms 40216 KB Output is correct
36 Correct 25 ms 40044 KB Output is correct
37 Correct 26 ms 40020 KB Output is correct
38 Correct 23 ms 39508 KB Output is correct
39 Correct 26 ms 40080 KB Output is correct
40 Correct 25 ms 39988 KB Output is correct
41 Correct 26 ms 40048 KB Output is correct
42 Correct 24 ms 40008 KB Output is correct
43 Correct 26 ms 40324 KB Output is correct
44 Correct 22 ms 39508 KB Output is correct
45 Correct 28 ms 40152 KB Output is correct
46 Correct 26 ms 40020 KB Output is correct
47 Correct 27 ms 39564 KB Output is correct
48 Correct 27 ms 40040 KB Output is correct
49 Correct 24 ms 40148 KB Output is correct
50 Correct 25 ms 40308 KB Output is correct
51 Correct 24 ms 40020 KB Output is correct
52 Correct 25 ms 39940 KB Output is correct
53 Correct 28 ms 40116 KB Output is correct
54 Correct 26 ms 40000 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 39508 KB Output is correct
2 Correct 21 ms 39452 KB Output is correct
3 Correct 23 ms 39640 KB Output is correct
4 Correct 23 ms 39464 KB Output is correct
5 Correct 23 ms 39480 KB Output is correct
6 Correct 27 ms 39496 KB Output is correct
7 Correct 24 ms 39444 KB Output is correct
8 Correct 22 ms 39508 KB Output is correct
9 Correct 22 ms 39540 KB Output is correct
10 Correct 22 ms 39536 KB Output is correct
11 Correct 22 ms 39540 KB Output is correct
12 Correct 22 ms 39460 KB Output is correct
13 Correct 21 ms 39528 KB Output is correct
14 Correct 21 ms 39508 KB Output is correct
15 Correct 21 ms 39508 KB Output is correct
16 Correct 23 ms 39508 KB Output is correct
17 Correct 21 ms 39508 KB Output is correct
18 Correct 26 ms 39544 KB Output is correct
19 Correct 25 ms 39444 KB Output is correct
20 Correct 23 ms 39488 KB Output is correct
21 Correct 23 ms 39508 KB Output is correct
22 Correct 22 ms 39508 KB Output is correct
23 Correct 22 ms 39540 KB Output is correct
24 Correct 23 ms 39508 KB Output is correct
25 Correct 22 ms 39420 KB Output is correct
26 Correct 170 ms 56332 KB Output is correct
27 Correct 242 ms 56092 KB Output is correct
28 Correct 25 ms 40016 KB Output is correct
29 Correct 22 ms 39480 KB Output is correct
30 Correct 22 ms 39508 KB Output is correct
31 Correct 183 ms 56044 KB Output is correct
32 Correct 25 ms 40020 KB Output is correct
33 Correct 228 ms 63236 KB Output is correct
34 Correct 243 ms 56136 KB Output is correct
35 Correct 29 ms 39912 KB Output is correct
36 Correct 203 ms 56832 KB Output is correct
37 Correct 26 ms 40000 KB Output is correct
38 Correct 27 ms 39924 KB Output is correct
39 Correct 192 ms 56384 KB Output is correct
40 Correct 33 ms 40268 KB Output is correct
41 Correct 201 ms 57156 KB Output is correct
42 Correct 221 ms 58420 KB Output is correct
43 Correct 24 ms 39524 KB Output is correct
44 Correct 218 ms 64472 KB Output is correct
45 Correct 258 ms 59720 KB Output is correct
46 Correct 26 ms 40052 KB Output is correct
47 Correct 26 ms 39944 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 56432 KB Output is correct
2 Correct 143 ms 62780 KB Output is correct
3 Correct 25 ms 40128 KB Output is correct
4 Correct 25 ms 40020 KB Output is correct
5 Correct 21 ms 39516 KB Output is correct
6 Correct 25 ms 39540 KB Output is correct
7 Correct 26 ms 40020 KB Output is correct
8 Correct 209 ms 57508 KB Output is correct
9 Correct 29 ms 40020 KB Output is correct
10 Correct 207 ms 56120 KB Output is correct
11 Correct 22 ms 39508 KB Output is correct
12 Correct 161 ms 56004 KB Output is correct
13 Correct 238 ms 57856 KB Output is correct
14 Correct 192 ms 62432 KB Output is correct
15 Correct 157 ms 56384 KB Output is correct
16 Correct 27 ms 40112 KB Output is correct
17 Correct 25 ms 39508 KB Output is correct
18 Correct 155 ms 62188 KB Output is correct
19 Correct 226 ms 65632 KB Output is correct
20 Correct 26 ms 39992 KB Output is correct
21 Correct 25 ms 39512 KB Output is correct
22 Correct 154 ms 58168 KB Output is correct
23 Correct 31 ms 39948 KB Output is correct
24 Correct 180 ms 56600 KB Output is correct
25 Correct 202 ms 65600 KB Output is correct
26 Correct 25 ms 40148 KB Output is correct
27 Correct 27 ms 40312 KB Output is correct
28 Correct 26 ms 40036 KB Output is correct
29 Correct 26 ms 39976 KB Output is correct
30 Correct 28 ms 40108 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 39508 KB Output is correct
2 Correct 21 ms 39452 KB Output is correct
3 Correct 23 ms 39640 KB Output is correct
4 Correct 23 ms 39464 KB Output is correct
5 Correct 23 ms 39480 KB Output is correct
6 Correct 27 ms 39496 KB Output is correct
7 Correct 24 ms 39444 KB Output is correct
8 Correct 22 ms 39508 KB Output is correct
9 Correct 22 ms 39540 KB Output is correct
10 Correct 22 ms 39536 KB Output is correct
11 Correct 22 ms 39540 KB Output is correct
12 Correct 22 ms 39460 KB Output is correct
13 Correct 21 ms 39528 KB Output is correct
14 Correct 21 ms 39508 KB Output is correct
15 Correct 21 ms 39508 KB Output is correct
16 Correct 23 ms 39508 KB Output is correct
17 Correct 21 ms 39508 KB Output is correct
18 Correct 26 ms 39544 KB Output is correct
19 Correct 25 ms 39444 KB Output is correct
20 Correct 23 ms 39488 KB Output is correct
21 Correct 23 ms 39508 KB Output is correct
22 Correct 22 ms 39508 KB Output is correct
23 Correct 22 ms 39540 KB Output is correct
24 Correct 23 ms 39508 KB Output is correct
25 Correct 22 ms 39584 KB Output is correct
26 Correct 26 ms 40140 KB Output is correct
27 Correct 26 ms 40052 KB Output is correct
28 Correct 26 ms 40220 KB Output is correct
29 Correct 26 ms 40228 KB Output is correct
30 Correct 26 ms 40020 KB Output is correct
31 Correct 23 ms 39548 KB Output is correct
32 Correct 26 ms 40200 KB Output is correct
33 Correct 22 ms 39540 KB Output is correct
34 Correct 25 ms 40020 KB Output is correct
35 Correct 26 ms 40216 KB Output is correct
36 Correct 25 ms 40044 KB Output is correct
37 Correct 26 ms 40020 KB Output is correct
38 Correct 23 ms 39508 KB Output is correct
39 Correct 26 ms 40080 KB Output is correct
40 Correct 25 ms 39988 KB Output is correct
41 Correct 26 ms 40048 KB Output is correct
42 Correct 24 ms 40008 KB Output is correct
43 Correct 26 ms 40324 KB Output is correct
44 Correct 22 ms 39508 KB Output is correct
45 Correct 28 ms 40152 KB Output is correct
46 Correct 26 ms 40020 KB Output is correct
47 Correct 27 ms 39564 KB Output is correct
48 Correct 27 ms 40040 KB Output is correct
49 Correct 24 ms 40148 KB Output is correct
50 Correct 25 ms 40308 KB Output is correct
51 Correct 24 ms 40020 KB Output is correct
52 Correct 25 ms 39940 KB Output is correct
53 Correct 28 ms 40116 KB Output is correct
54 Correct 26 ms 40000 KB Output is correct
55 Correct 22 ms 39420 KB Output is correct
56 Correct 170 ms 56332 KB Output is correct
57 Correct 242 ms 56092 KB Output is correct
58 Correct 25 ms 40016 KB Output is correct
59 Correct 22 ms 39480 KB Output is correct
60 Correct 22 ms 39508 KB Output is correct
61 Correct 183 ms 56044 KB Output is correct
62 Correct 25 ms 40020 KB Output is correct
63 Correct 228 ms 63236 KB Output is correct
64 Correct 243 ms 56136 KB Output is correct
65 Correct 29 ms 39912 KB Output is correct
66 Correct 203 ms 56832 KB Output is correct
67 Correct 26 ms 40000 KB Output is correct
68 Correct 27 ms 39924 KB Output is correct
69 Correct 192 ms 56384 KB Output is correct
70 Correct 33 ms 40268 KB Output is correct
71 Correct 201 ms 57156 KB Output is correct
72 Correct 221 ms 58420 KB Output is correct
73 Correct 24 ms 39524 KB Output is correct
74 Correct 218 ms 64472 KB Output is correct
75 Correct 258 ms 59720 KB Output is correct
76 Correct 26 ms 40052 KB Output is correct
77 Correct 26 ms 39944 KB Output is correct
78 Correct 155 ms 56432 KB Output is correct
79 Correct 143 ms 62780 KB Output is correct
80 Correct 25 ms 40128 KB Output is correct
81 Correct 25 ms 40020 KB Output is correct
82 Correct 21 ms 39516 KB Output is correct
83 Correct 25 ms 39540 KB Output is correct
84 Correct 26 ms 40020 KB Output is correct
85 Correct 209 ms 57508 KB Output is correct
86 Correct 29 ms 40020 KB Output is correct
87 Correct 207 ms 56120 KB Output is correct
88 Correct 22 ms 39508 KB Output is correct
89 Correct 161 ms 56004 KB Output is correct
90 Correct 238 ms 57856 KB Output is correct
91 Correct 192 ms 62432 KB Output is correct
92 Correct 157 ms 56384 KB Output is correct
93 Correct 27 ms 40112 KB Output is correct
94 Correct 25 ms 39508 KB Output is correct
95 Correct 155 ms 62188 KB Output is correct
96 Correct 226 ms 65632 KB Output is correct
97 Correct 26 ms 39992 KB Output is correct
98 Correct 25 ms 39512 KB Output is correct
99 Correct 154 ms 58168 KB Output is correct
100 Correct 31 ms 39948 KB Output is correct
101 Correct 180 ms 56600 KB Output is correct
102 Correct 202 ms 65600 KB Output is correct
103 Correct 25 ms 40148 KB Output is correct
104 Correct 27 ms 40312 KB Output is correct
105 Correct 26 ms 40036 KB Output is correct
106 Correct 26 ms 39976 KB Output is correct
107 Correct 28 ms 40108 KB Output is correct
108 Correct 988 ms 128284 KB Output is correct
109 Correct 1378 ms 142444 KB Output is correct
110 Correct 1482 ms 155040 KB Output is correct
111 Runtime error 1050 ms 262144 KB Execution killed with signal 11
112 Halted 0 ms 0 KB -