oj.uz

Submission #630477

# Submission time Handle Problem Language Result Execution time Memory
630477 2022-08-16T12:12:38 Z Arnch Mergers (JOI19_mergers) C++17
48 / 100
 357 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 = 25;

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);
	}

	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 125 ms 235176 KB Output is correct
2 Correct 127 ms 235220 KB Output is correct
3 Correct 121 ms 235324 KB Output is correct
4 Correct 121 ms 235152 KB Output is correct
5 Correct 120 ms 235208 KB Output is correct
6 Correct 145 ms 235156 KB Output is correct
7 Correct 123 ms 235212 KB Output is correct
8 Correct 122 ms 235128 KB Output is correct
9 Correct 121 ms 235228 KB Output is correct
10 Correct 128 ms 235336 KB Output is correct
11 Correct 126 ms 235184 KB Output is correct
12 Correct 123 ms 235232 KB Output is correct
13 Correct 124 ms 235160 KB Output is correct
14 Correct 134 ms 235228 KB Output is correct
15 Correct 124 ms 235116 KB Output is correct
16 Correct 126 ms 235100 KB Output is correct
17 Correct 126 ms 235168 KB Output is correct
18 Correct 128 ms 235272 KB Output is correct
19 Correct 125 ms 235156 KB Output is correct
20 Correct 123 ms 235336 KB Output is correct
21 Correct 127 ms 235236 KB Output is correct
22 Correct 137 ms 235232 KB Output is correct
23 Correct 124 ms 235160 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 125 ms 235176 KB Output is correct
2 Correct 127 ms 235220 KB Output is correct
3 Correct 121 ms 235324 KB Output is correct
4 Correct 121 ms 235152 KB Output is correct
5 Correct 120 ms 235208 KB Output is correct
6 Correct 145 ms 235156 KB Output is correct
7 Correct 123 ms 235212 KB Output is correct
8 Correct 122 ms 235128 KB Output is correct
9 Correct 121 ms 235228 KB Output is correct
10 Correct 128 ms 235336 KB Output is correct
11 Correct 126 ms 235184 KB Output is correct
12 Correct 123 ms 235232 KB Output is correct
13 Correct 124 ms 235160 KB Output is correct
14 Correct 134 ms 235228 KB Output is correct
15 Correct 124 ms 235116 KB Output is correct
16 Correct 126 ms 235100 KB Output is correct
17 Correct 126 ms 235168 KB Output is correct
18 Correct 128 ms 235272 KB Output is correct
19 Correct 125 ms 235156 KB Output is correct
20 Correct 123 ms 235336 KB Output is correct
21 Correct 127 ms 235236 KB Output is correct
22 Correct 137 ms 235232 KB Output is correct
23 Correct 124 ms 235160 KB Output is correct
24 Correct 121 ms 235216 KB Output is correct
25 Correct 133 ms 235236 KB Output is correct
26 Correct 153 ms 235736 KB Output is correct
27 Correct 133 ms 235760 KB Output is correct
28 Correct 126 ms 235992 KB Output is correct
29 Correct 127 ms 236056 KB Output is correct
30 Correct 133 ms 235772 KB Output is correct
31 Correct 129 ms 235288 KB Output is correct
32 Correct 127 ms 235964 KB Output is correct
33 Correct 142 ms 235152 KB Output is correct
34 Correct 123 ms 235680 KB Output is correct
35 Correct 129 ms 235944 KB Output is correct
36 Correct 133 ms 235720 KB Output is correct
37 Correct 129 ms 235796 KB Output is correct
38 Correct 123 ms 235296 KB Output is correct
39 Correct 129 ms 235680 KB Output is correct
40 Correct 127 ms 235776 KB Output is correct
41 Correct 135 ms 235724 KB Output is correct
42 Correct 123 ms 235820 KB Output is correct
43 Correct 128 ms 236028 KB Output is correct
44 Correct 130 ms 235168 KB Output is correct
45 Correct 129 ms 235840 KB Output is correct
46 Correct 128 ms 235724 KB Output is correct
47 Correct 140 ms 235352 KB Output is correct
48 Correct 131 ms 235720 KB Output is correct
49 Correct 127 ms 235960 KB Output is correct
50 Correct 131 ms 236092 KB Output is correct
51 Correct 133 ms 235864 KB Output is correct
52 Correct 127 ms 235836 KB Output is correct
53 Correct 128 ms 235724 KB Output is correct
54 Correct 126 ms 235728 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 235176 KB Output is correct
2 Correct 127 ms 235220 KB Output is correct
3 Correct 121 ms 235324 KB Output is correct
4 Correct 121 ms 235152 KB Output is correct
5 Correct 120 ms 235208 KB Output is correct
6 Correct 145 ms 235156 KB Output is correct
7 Correct 123 ms 235212 KB Output is correct
8 Correct 122 ms 235128 KB Output is correct
9 Correct 121 ms 235228 KB Output is correct
10 Correct 128 ms 235336 KB Output is correct
11 Correct 126 ms 235184 KB Output is correct
12 Correct 123 ms 235232 KB Output is correct
13 Correct 124 ms 235160 KB Output is correct
14 Correct 134 ms 235228 KB Output is correct
15 Correct 124 ms 235116 KB Output is correct
16 Correct 126 ms 235100 KB Output is correct
17 Correct 126 ms 235168 KB Output is correct
18 Correct 128 ms 235272 KB Output is correct
19 Correct 125 ms 235156 KB Output is correct
20 Correct 123 ms 235336 KB Output is correct
21 Correct 127 ms 235236 KB Output is correct
22 Correct 137 ms 235232 KB Output is correct
23 Correct 124 ms 235160 KB Output is correct
24 Correct 121 ms 235216 KB Output is correct
25 Correct 122 ms 235128 KB Output is correct
26 Correct 254 ms 253288 KB Output is correct
27 Correct 357 ms 252960 KB Output is correct
28 Correct 125 ms 235756 KB Output is correct
29 Correct 134 ms 235112 KB Output is correct
30 Correct 125 ms 235184 KB Output is correct
31 Correct 270 ms 252912 KB Output is correct
32 Correct 144 ms 235656 KB Output is correct
33 Correct 333 ms 260092 KB Output is correct
34 Correct 349 ms 252916 KB Output is correct
35 Correct 126 ms 235724 KB Output is correct
36 Correct 283 ms 253688 KB Output is correct
37 Correct 142 ms 235728 KB Output is correct
38 Correct 132 ms 235728 KB Output is correct
39 Correct 253 ms 253252 KB Output is correct
40 Correct 127 ms 236036 KB Output is correct
41 Correct 323 ms 253956 KB Output is correct
42 Correct 328 ms 255212 KB Output is correct
43 Correct 125 ms 235352 KB Output is correct
44 Correct 321 ms 261348 KB Output is correct
45 Correct 342 ms 256688 KB Output is correct
46 Correct 129 ms 235788 KB Output is correct
47 Correct 138 ms 235696 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 252 ms 253296 KB Output is correct
2 Correct 249 ms 259644 KB Output is correct
3 Correct 134 ms 235832 KB Output is correct
4 Correct 139 ms 235852 KB Output is correct
5 Correct 123 ms 235228 KB Output is correct
6 Correct 133 ms 235248 KB Output is correct
7 Correct 131 ms 235980 KB Output is correct
8 Correct 315 ms 254656 KB Output is correct
9 Correct 132 ms 235760 KB Output is correct
10 Correct 284 ms 253064 KB Output is correct
11 Correct 127 ms 235240 KB Output is correct
12 Correct 273 ms 252984 KB Output is correct
13 Correct 292 ms 254736 KB Output is correct
14 Correct 297 ms 259368 KB Output is correct
15 Correct 268 ms 253252 KB Output is correct
16 Correct 128 ms 235912 KB Output is correct
17 Correct 128 ms 235208 KB Output is correct
18 Correct 252 ms 258956 KB Output is correct
19 Runtime error 254 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 235176 KB Output is correct
2 Correct 127 ms 235220 KB Output is correct
3 Correct 121 ms 235324 KB Output is correct
4 Correct 121 ms 235152 KB Output is correct
5 Correct 120 ms 235208 KB Output is correct
6 Correct 145 ms 235156 KB Output is correct
7 Correct 123 ms 235212 KB Output is correct
8 Correct 122 ms 235128 KB Output is correct
9 Correct 121 ms 235228 KB Output is correct
10 Correct 128 ms 235336 KB Output is correct
11 Correct 126 ms 235184 KB Output is correct
12 Correct 123 ms 235232 KB Output is correct
13 Correct 124 ms 235160 KB Output is correct
14 Correct 134 ms 235228 KB Output is correct
15 Correct 124 ms 235116 KB Output is correct
16 Correct 126 ms 235100 KB Output is correct
17 Correct 126 ms 235168 KB Output is correct
18 Correct 128 ms 235272 KB Output is correct
19 Correct 125 ms 235156 KB Output is correct
20 Correct 123 ms 235336 KB Output is correct
21 Correct 127 ms 235236 KB Output is correct
22 Correct 137 ms 235232 KB Output is correct
23 Correct 124 ms 235160 KB Output is correct
24 Correct 121 ms 235216 KB Output is correct
25 Correct 133 ms 235236 KB Output is correct
26 Correct 153 ms 235736 KB Output is correct
27 Correct 133 ms 235760 KB Output is correct
28 Correct 126 ms 235992 KB Output is correct
29 Correct 127 ms 236056 KB Output is correct
30 Correct 133 ms 235772 KB Output is correct
31 Correct 129 ms 235288 KB Output is correct
32 Correct 127 ms 235964 KB Output is correct
33 Correct 142 ms 235152 KB Output is correct
34 Correct 123 ms 235680 KB Output is correct
35 Correct 129 ms 235944 KB Output is correct
36 Correct 133 ms 235720 KB Output is correct
37 Correct 129 ms 235796 KB Output is correct
38 Correct 123 ms 235296 KB Output is correct
39 Correct 129 ms 235680 KB Output is correct
40 Correct 127 ms 235776 KB Output is correct
41 Correct 135 ms 235724 KB Output is correct
42 Correct 123 ms 235820 KB Output is correct
43 Correct 128 ms 236028 KB Output is correct
44 Correct 130 ms 235168 KB Output is correct
45 Correct 129 ms 235840 KB Output is correct
46 Correct 128 ms 235724 KB Output is correct
47 Correct 140 ms 235352 KB Output is correct
48 Correct 131 ms 235720 KB Output is correct
49 Correct 127 ms 235960 KB Output is correct
50 Correct 131 ms 236092 KB Output is correct
51 Correct 133 ms 235864 KB Output is correct
52 Correct 127 ms 235836 KB Output is correct
53 Correct 128 ms 235724 KB Output is correct
54 Correct 126 ms 235728 KB Output is correct
55 Correct 122 ms 235128 KB Output is correct
56 Correct 254 ms 253288 KB Output is correct
57 Correct 357 ms 252960 KB Output is correct
58 Correct 125 ms 235756 KB Output is correct
59 Correct 134 ms 235112 KB Output is correct
60 Correct 125 ms 235184 KB Output is correct
61 Correct 270 ms 252912 KB Output is correct
62 Correct 144 ms 235656 KB Output is correct
63 Correct 333 ms 260092 KB Output is correct
64 Correct 349 ms 252916 KB Output is correct
65 Correct 126 ms 235724 KB Output is correct
66 Correct 283 ms 253688 KB Output is correct
67 Correct 142 ms 235728 KB Output is correct
68 Correct 132 ms 235728 KB Output is correct
69 Correct 253 ms 253252 KB Output is correct
70 Correct 127 ms 236036 KB Output is correct
71 Correct 323 ms 253956 KB Output is correct
72 Correct 328 ms 255212 KB Output is correct
73 Correct 125 ms 235352 KB Output is correct
74 Correct 321 ms 261348 KB Output is correct
75 Correct 342 ms 256688 KB Output is correct
76 Correct 129 ms 235788 KB Output is correct
77 Correct 138 ms 235696 KB Output is correct
78 Correct 252 ms 253296 KB Output is correct
79 Correct 249 ms 259644 KB Output is correct
80 Correct 134 ms 235832 KB Output is correct
81 Correct 139 ms 235852 KB Output is correct
82 Correct 123 ms 235228 KB Output is correct
83 Correct 133 ms 235248 KB Output is correct
84 Correct 131 ms 235980 KB Output is correct
85 Correct 315 ms 254656 KB Output is correct
86 Correct 132 ms 235760 KB Output is correct
87 Correct 284 ms 253064 KB Output is correct
88 Correct 127 ms 235240 KB Output is correct
89 Correct 273 ms 252984 KB Output is correct
90 Correct 292 ms 254736 KB Output is correct
91 Correct 297 ms 259368 KB Output is correct
92 Correct 268 ms 253252 KB Output is correct
93 Correct 128 ms 235912 KB Output is correct
94 Correct 128 ms 235208 KB Output is correct
95 Correct 252 ms 258956 KB Output is correct
96 Runtime error 254 ms 262144 KB Execution killed with signal 9
97 Halted 0 ms 0 KB -