oj.uz

Submission #630473

# Submission time Handle Problem Language Result Execution time Memory
630473 2022-08-16T12:10:12 Z Arnch Mergers (JOI19_mergers) C++17
70 / 100
 340 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 ll INF = 1e18, N = 3e6 + 10, MOD = 1e9 + 7, LOG = 20;

int n, k;
int s[N], sub[N], head[N], link[N], fin[N];
int par[N][LOG], h[N], st[N], fn[N], tim;
int sz[N], pv[N];
int ans, total;
int seg[N];
vector<int> vc[N], adj[N], 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);
	}
	
//	assert(0);

	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 123 ms 235212 KB Output is correct
2 Correct 120 ms 235216 KB Output is correct
3 Correct 122 ms 235116 KB Output is correct
4 Correct 122 ms 235216 KB Output is correct
5 Correct 136 ms 235200 KB Output is correct
6 Correct 122 ms 235144 KB Output is correct
7 Correct 122 ms 235340 KB Output is correct
8 Correct 132 ms 235316 KB Output is correct
9 Correct 126 ms 235092 KB Output is correct
10 Correct 124 ms 235208 KB Output is correct
11 Correct 121 ms 235156 KB Output is correct
12 Correct 122 ms 235228 KB Output is correct
13 Correct 124 ms 235140 KB Output is correct
14 Correct 125 ms 235284 KB Output is correct
15 Correct 123 ms 235156 KB Output is correct
16 Correct 135 ms 235200 KB Output is correct
17 Correct 129 ms 235212 KB Output is correct
18 Correct 121 ms 235236 KB Output is correct
19 Correct 119 ms 235092 KB Output is correct
20 Correct 126 ms 235096 KB Output is correct
21 Correct 125 ms 235136 KB Output is correct
22 Correct 122 ms 235156 KB Output is correct
23 Correct 125 ms 235296 KB Output is correct
24 Correct 121 ms 235216 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 235212 KB Output is correct
2 Correct 120 ms 235216 KB Output is correct
3 Correct 122 ms 235116 KB Output is correct
4 Correct 122 ms 235216 KB Output is correct
5 Correct 136 ms 235200 KB Output is correct
6 Correct 122 ms 235144 KB Output is correct
7 Correct 122 ms 235340 KB Output is correct
8 Correct 132 ms 235316 KB Output is correct
9 Correct 126 ms 235092 KB Output is correct
10 Correct 124 ms 235208 KB Output is correct
11 Correct 121 ms 235156 KB Output is correct
12 Correct 122 ms 235228 KB Output is correct
13 Correct 124 ms 235140 KB Output is correct
14 Correct 125 ms 235284 KB Output is correct
15 Correct 123 ms 235156 KB Output is correct
16 Correct 135 ms 235200 KB Output is correct
17 Correct 129 ms 235212 KB Output is correct
18 Correct 121 ms 235236 KB Output is correct
19 Correct 119 ms 235092 KB Output is correct
20 Correct 126 ms 235096 KB Output is correct
21 Correct 125 ms 235136 KB Output is correct
22 Correct 122 ms 235156 KB Output is correct
23 Correct 125 ms 235296 KB Output is correct
24 Correct 121 ms 235216 KB Output is correct
25 Correct 119 ms 235168 KB Output is correct
26 Correct 125 ms 235836 KB Output is correct
27 Correct 127 ms 235616 KB Output is correct
28 Correct 127 ms 235884 KB Output is correct
29 Correct 125 ms 235836 KB Output is correct
30 Correct 127 ms 235744 KB Output is correct
31 Correct 133 ms 235228 KB Output is correct
32 Correct 127 ms 235936 KB Output is correct
33 Correct 122 ms 235224 KB Output is correct
34 Correct 130 ms 235700 KB Output is correct
35 Correct 127 ms 235924 KB Output is correct
36 Correct 125 ms 235732 KB Output is correct
37 Correct 128 ms 235768 KB Output is correct
38 Correct 127 ms 235240 KB Output is correct
39 Correct 129 ms 235760 KB Output is correct
40 Correct 124 ms 235780 KB Output is correct
41 Correct 130 ms 235732 KB Output is correct
42 Correct 129 ms 235888 KB Output is correct
43 Correct 127 ms 235976 KB Output is correct
44 Correct 123 ms 235236 KB Output is correct
45 Correct 131 ms 235832 KB Output is correct
46 Correct 140 ms 235720 KB Output is correct
47 Correct 126 ms 235308 KB Output is correct
48 Correct 131 ms 235724 KB Output is correct
49 Correct 126 ms 236052 KB Output is correct
50 Correct 126 ms 235960 KB Output is correct
51 Correct 126 ms 235736 KB Output is correct
52 Correct 125 ms 235852 KB Output is correct
53 Correct 125 ms 235760 KB Output is correct
54 Correct 128 ms 235696 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 235212 KB Output is correct
2 Correct 120 ms 235216 KB Output is correct
3 Correct 122 ms 235116 KB Output is correct
4 Correct 122 ms 235216 KB Output is correct
5 Correct 136 ms 235200 KB Output is correct
6 Correct 122 ms 235144 KB Output is correct
7 Correct 122 ms 235340 KB Output is correct
8 Correct 132 ms 235316 KB Output is correct
9 Correct 126 ms 235092 KB Output is correct
10 Correct 124 ms 235208 KB Output is correct
11 Correct 121 ms 235156 KB Output is correct
12 Correct 122 ms 235228 KB Output is correct
13 Correct 124 ms 235140 KB Output is correct
14 Correct 125 ms 235284 KB Output is correct
15 Correct 123 ms 235156 KB Output is correct
16 Correct 135 ms 235200 KB Output is correct
17 Correct 129 ms 235212 KB Output is correct
18 Correct 121 ms 235236 KB Output is correct
19 Correct 119 ms 235092 KB Output is correct
20 Correct 126 ms 235096 KB Output is correct
21 Correct 125 ms 235136 KB Output is correct
22 Correct 122 ms 235156 KB Output is correct
23 Correct 125 ms 235296 KB Output is correct
24 Correct 121 ms 235216 KB Output is correct
25 Correct 125 ms 235224 KB Output is correct
26 Correct 260 ms 252520 KB Output is correct
27 Correct 340 ms 252292 KB Output is correct
28 Correct 124 ms 235724 KB Output is correct
29 Correct 120 ms 235152 KB Output is correct
30 Correct 132 ms 235216 KB Output is correct
31 Correct 268 ms 252124 KB Output is correct
32 Correct 128 ms 235692 KB Output is correct
33 Correct 318 ms 259300 KB Output is correct
34 Correct 317 ms 252472 KB Output is correct
35 Correct 143 ms 235728 KB Output is correct
36 Correct 272 ms 253116 KB Output is correct
37 Correct 133 ms 235736 KB Output is correct
38 Correct 124 ms 235764 KB Output is correct
39 Correct 240 ms 252648 KB Output is correct
40 Correct 127 ms 236000 KB Output is correct
41 Correct 290 ms 253276 KB Output is correct
42 Correct 299 ms 254772 KB Output is correct
43 Correct 142 ms 235128 KB Output is correct
44 Correct 302 ms 260852 KB Output is correct
45 Correct 320 ms 256164 KB Output is correct
46 Correct 146 ms 235748 KB Output is correct
47 Correct 127 ms 235684 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 246 ms 252272 KB Output is correct
2 Correct 241 ms 259088 KB Output is correct
3 Correct 124 ms 235832 KB Output is correct
4 Correct 139 ms 235748 KB Output is correct
5 Correct 138 ms 235120 KB Output is correct
6 Correct 139 ms 235272 KB Output is correct
7 Correct 127 ms 235664 KB Output is correct
8 Correct 295 ms 254020 KB Output is correct
9 Correct 124 ms 235732 KB Output is correct
10 Correct 266 ms 252236 KB Output is correct
11 Correct 125 ms 235212 KB Output is correct
12 Correct 257 ms 252108 KB Output is correct
13 Correct 289 ms 253880 KB Output is correct
14 Correct 269 ms 258496 KB Output is correct
15 Correct 246 ms 252468 KB Output is correct
16 Correct 121 ms 235804 KB Output is correct
17 Correct 122 ms 235244 KB Output is correct
18 Correct 256 ms 258164 KB Output is correct
19 Correct 288 ms 261892 KB Output is correct
20 Correct 124 ms 235724 KB Output is correct
21 Correct 123 ms 235236 KB Output is correct
22 Correct 259 ms 254272 KB Output is correct
23 Correct 127 ms 235852 KB Output is correct
24 Correct 281 ms 252568 KB Output is correct
25 Correct 291 ms 261652 KB Output is correct
26 Correct 129 ms 235852 KB Output is correct
27 Correct 136 ms 235980 KB Output is correct
28 Correct 124 ms 235672 KB Output is correct
29 Correct 128 ms 235860 KB Output is correct
30 Correct 127 ms 235836 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 235212 KB Output is correct
2 Correct 120 ms 235216 KB Output is correct
3 Correct 122 ms 235116 KB Output is correct
4 Correct 122 ms 235216 KB Output is correct
5 Correct 136 ms 235200 KB Output is correct
6 Correct 122 ms 235144 KB Output is correct
7 Correct 122 ms 235340 KB Output is correct
8 Correct 132 ms 235316 KB Output is correct
9 Correct 126 ms 235092 KB Output is correct
10 Correct 124 ms 235208 KB Output is correct
11 Correct 121 ms 235156 KB Output is correct
12 Correct 122 ms 235228 KB Output is correct
13 Correct 124 ms 235140 KB Output is correct
14 Correct 125 ms 235284 KB Output is correct
15 Correct 123 ms 235156 KB Output is correct
16 Correct 135 ms 235200 KB Output is correct
17 Correct 129 ms 235212 KB Output is correct
18 Correct 121 ms 235236 KB Output is correct
19 Correct 119 ms 235092 KB Output is correct
20 Correct 126 ms 235096 KB Output is correct
21 Correct 125 ms 235136 KB Output is correct
22 Correct 122 ms 235156 KB Output is correct
23 Correct 125 ms 235296 KB Output is correct
24 Correct 121 ms 235216 KB Output is correct
25 Correct 119 ms 235168 KB Output is correct
26 Correct 125 ms 235836 KB Output is correct
27 Correct 127 ms 235616 KB Output is correct
28 Correct 127 ms 235884 KB Output is correct
29 Correct 125 ms 235836 KB Output is correct
30 Correct 127 ms 235744 KB Output is correct
31 Correct 133 ms 235228 KB Output is correct
32 Correct 127 ms 235936 KB Output is correct
33 Correct 122 ms 235224 KB Output is correct
34 Correct 130 ms 235700 KB Output is correct
35 Correct 127 ms 235924 KB Output is correct
36 Correct 125 ms 235732 KB Output is correct
37 Correct 128 ms 235768 KB Output is correct
38 Correct 127 ms 235240 KB Output is correct
39 Correct 129 ms 235760 KB Output is correct
40 Correct 124 ms 235780 KB Output is correct
41 Correct 130 ms 235732 KB Output is correct
42 Correct 129 ms 235888 KB Output is correct
43 Correct 127 ms 235976 KB Output is correct
44 Correct 123 ms 235236 KB Output is correct
45 Correct 131 ms 235832 KB Output is correct
46 Correct 140 ms 235720 KB Output is correct
47 Correct 126 ms 235308 KB Output is correct
48 Correct 131 ms 235724 KB Output is correct
49 Correct 126 ms 236052 KB Output is correct
50 Correct 126 ms 235960 KB Output is correct
51 Correct 126 ms 235736 KB Output is correct
52 Correct 125 ms 235852 KB Output is correct
53 Correct 125 ms 235760 KB Output is correct
54 Correct 128 ms 235696 KB Output is correct
55 Correct 125 ms 235224 KB Output is correct
56 Correct 260 ms 252520 KB Output is correct
57 Correct 340 ms 252292 KB Output is correct
58 Correct 124 ms 235724 KB Output is correct
59 Correct 120 ms 235152 KB Output is correct
60 Correct 132 ms 235216 KB Output is correct
61 Correct 268 ms 252124 KB Output is correct
62 Correct 128 ms 235692 KB Output is correct
63 Correct 318 ms 259300 KB Output is correct
64 Correct 317 ms 252472 KB Output is correct
65 Correct 143 ms 235728 KB Output is correct
66 Correct 272 ms 253116 KB Output is correct
67 Correct 133 ms 235736 KB Output is correct
68 Correct 124 ms 235764 KB Output is correct
69 Correct 240 ms 252648 KB Output is correct
70 Correct 127 ms 236000 KB Output is correct
71 Correct 290 ms 253276 KB Output is correct
72 Correct 299 ms 254772 KB Output is correct
73 Correct 142 ms 235128 KB Output is correct
74 Correct 302 ms 260852 KB Output is correct
75 Correct 320 ms 256164 KB Output is correct
76 Correct 146 ms 235748 KB Output is correct
77 Correct 127 ms 235684 KB Output is correct
78 Correct 246 ms 252272 KB Output is correct
79 Correct 241 ms 259088 KB Output is correct
80 Correct 124 ms 235832 KB Output is correct
81 Correct 139 ms 235748 KB Output is correct
82 Correct 138 ms 235120 KB Output is correct
83 Correct 139 ms 235272 KB Output is correct
84 Correct 127 ms 235664 KB Output is correct
85 Correct 295 ms 254020 KB Output is correct
86 Correct 124 ms 235732 KB Output is correct
87 Correct 266 ms 252236 KB Output is correct
88 Correct 125 ms 235212 KB Output is correct
89 Correct 257 ms 252108 KB Output is correct
90 Correct 289 ms 253880 KB Output is correct
91 Correct 269 ms 258496 KB Output is correct
92 Correct 246 ms 252468 KB Output is correct
93 Correct 121 ms 235804 KB Output is correct
94 Correct 122 ms 235244 KB Output is correct
95 Correct 256 ms 258164 KB Output is correct
96 Correct 288 ms 261892 KB Output is correct
97 Correct 124 ms 235724 KB Output is correct
98 Correct 123 ms 235236 KB Output is correct
99 Correct 259 ms 254272 KB Output is correct
100 Correct 127 ms 235852 KB Output is correct
101 Correct 281 ms 252568 KB Output is correct
102 Correct 291 ms 261652 KB Output is correct
103 Correct 129 ms 235852 KB Output is correct
104 Correct 136 ms 235980 KB Output is correct
105 Correct 124 ms 235672 KB Output is correct
106 Correct 128 ms 235860 KB Output is correct
107 Correct 127 ms 235836 KB Output is correct
108 Runtime error 233 ms 262144 KB Execution killed with signal 9
109 Halted 0 ms 0 KB -