oj.uz

Submission #630490

# Submission time Handle Problem Language Result Execution time Memory
630490 2022-08-16T12:23:50 Z Arnch Mergers (JOI19_mergers) C++17
70 / 100
 1508 ms 259520 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 = 20;

int n, k;
int s[MAXN], sub[MAXN], head[MAXN], link[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];

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

Compilation message

mergers.cpp: In function 'int main()':
mergers.cpp:36:12: warning: array subscript -1 is below array bounds of 'int [500010]' [-Warray-bounds]
   36 |  h[x] = h[p] + 1;
      |         ~~~^
mergers.cpp:27:21: note: while referencing 'h'
   27 | int par[MAXN][LOG], h[MAXN], st[MAXN], fn[MAXN], tim;
      |                     ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 39460 KB Output is correct
2 Correct 20 ms 39460 KB Output is correct
3 Correct 20 ms 39464 KB Output is correct
4 Correct 21 ms 39456 KB Output is correct
5 Correct 20 ms 39516 KB Output is correct
6 Correct 24 ms 39548 KB Output is correct
7 Correct 20 ms 39500 KB Output is correct
8 Correct 21 ms 39484 KB Output is correct
9 Correct 20 ms 39508 KB Output is correct
10 Correct 20 ms 39508 KB Output is correct
11 Correct 26 ms 39552 KB Output is correct
12 Correct 20 ms 39508 KB Output is correct
13 Correct 20 ms 39532 KB Output is correct
14 Correct 20 ms 39548 KB Output is correct
15 Correct 21 ms 39424 KB Output is correct
16 Correct 21 ms 39516 KB Output is correct
17 Correct 20 ms 39464 KB Output is correct
18 Correct 20 ms 39508 KB Output is correct
19 Correct 21 ms 39444 KB Output is correct
20 Correct 19 ms 39444 KB Output is correct
21 Correct 21 ms 39528 KB Output is correct
22 Correct 21 ms 39508 KB Output is correct
23 Correct 20 ms 39508 KB Output is correct
24 Correct 24 ms 39424 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 39460 KB Output is correct
2 Correct 20 ms 39460 KB Output is correct
3 Correct 20 ms 39464 KB Output is correct
4 Correct 21 ms 39456 KB Output is correct
5 Correct 20 ms 39516 KB Output is correct
6 Correct 24 ms 39548 KB Output is correct
7 Correct 20 ms 39500 KB Output is correct
8 Correct 21 ms 39484 KB Output is correct
9 Correct 20 ms 39508 KB Output is correct
10 Correct 20 ms 39508 KB Output is correct
11 Correct 26 ms 39552 KB Output is correct
12 Correct 20 ms 39508 KB Output is correct
13 Correct 20 ms 39532 KB Output is correct
14 Correct 20 ms 39548 KB Output is correct
15 Correct 21 ms 39424 KB Output is correct
16 Correct 21 ms 39516 KB Output is correct
17 Correct 20 ms 39464 KB Output is correct
18 Correct 20 ms 39508 KB Output is correct
19 Correct 21 ms 39444 KB Output is correct
20 Correct 19 ms 39444 KB Output is correct
21 Correct 21 ms 39528 KB Output is correct
22 Correct 21 ms 39508 KB Output is correct
23 Correct 20 ms 39508 KB Output is correct
24 Correct 24 ms 39424 KB Output is correct
25 Correct 19 ms 39508 KB Output is correct
26 Correct 24 ms 40020 KB Output is correct
27 Correct 22 ms 39892 KB Output is correct
28 Correct 22 ms 40148 KB Output is correct
29 Correct 23 ms 40176 KB Output is correct
30 Correct 22 ms 39892 KB Output is correct
31 Correct 21 ms 39508 KB Output is correct
32 Correct 23 ms 40228 KB Output is correct
33 Correct 21 ms 39540 KB Output is correct
34 Correct 22 ms 40020 KB Output is correct
35 Correct 23 ms 40108 KB Output is correct
36 Correct 24 ms 39936 KB Output is correct
37 Correct 23 ms 40024 KB Output is correct
38 Correct 21 ms 39508 KB Output is correct
39 Correct 24 ms 40020 KB Output is correct
40 Correct 26 ms 40020 KB Output is correct
41 Correct 23 ms 40000 KB Output is correct
42 Correct 24 ms 39996 KB Output is correct
43 Correct 24 ms 40176 KB Output is correct
44 Correct 23 ms 39536 KB Output is correct
45 Correct 23 ms 40124 KB Output is correct
46 Correct 27 ms 40020 KB Output is correct
47 Correct 24 ms 39472 KB Output is correct
48 Correct 23 ms 40008 KB Output is correct
49 Correct 23 ms 40148 KB Output is correct
50 Correct 26 ms 40204 KB Output is correct
51 Correct 23 ms 39916 KB Output is correct
52 Correct 22 ms 40016 KB Output is correct
53 Correct 22 ms 40036 KB Output is correct
54 Correct 29 ms 39892 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 39460 KB Output is correct
2 Correct 20 ms 39460 KB Output is correct
3 Correct 20 ms 39464 KB Output is correct
4 Correct 21 ms 39456 KB Output is correct
5 Correct 20 ms 39516 KB Output is correct
6 Correct 24 ms 39548 KB Output is correct
7 Correct 20 ms 39500 KB Output is correct
8 Correct 21 ms 39484 KB Output is correct
9 Correct 20 ms 39508 KB Output is correct
10 Correct 20 ms 39508 KB Output is correct
11 Correct 26 ms 39552 KB Output is correct
12 Correct 20 ms 39508 KB Output is correct
13 Correct 20 ms 39532 KB Output is correct
14 Correct 20 ms 39548 KB Output is correct
15 Correct 21 ms 39424 KB Output is correct
16 Correct 21 ms 39516 KB Output is correct
17 Correct 20 ms 39464 KB Output is correct
18 Correct 20 ms 39508 KB Output is correct
19 Correct 21 ms 39444 KB Output is correct
20 Correct 19 ms 39444 KB Output is correct
21 Correct 21 ms 39528 KB Output is correct
22 Correct 21 ms 39508 KB Output is correct
23 Correct 20 ms 39508 KB Output is correct
24 Correct 24 ms 39424 KB Output is correct
25 Correct 20 ms 39508 KB Output is correct
26 Correct 129 ms 55220 KB Output is correct
27 Correct 201 ms 54912 KB Output is correct
28 Correct 23 ms 39892 KB Output is correct
29 Correct 21 ms 39468 KB Output is correct
30 Correct 23 ms 39456 KB Output is correct
31 Correct 157 ms 54812 KB Output is correct
32 Correct 23 ms 39892 KB Output is correct
33 Correct 203 ms 61984 KB Output is correct
34 Correct 215 ms 54944 KB Output is correct
35 Correct 22 ms 39892 KB Output is correct
36 Correct 178 ms 55536 KB Output is correct
37 Correct 27 ms 39932 KB Output is correct
38 Correct 22 ms 39896 KB Output is correct
39 Correct 165 ms 55204 KB Output is correct
40 Correct 32 ms 40224 KB Output is correct
41 Correct 235 ms 55824 KB Output is correct
42 Correct 222 ms 57120 KB Output is correct
43 Correct 28 ms 39448 KB Output is correct
44 Correct 260 ms 63392 KB Output is correct
45 Correct 214 ms 58620 KB Output is correct
46 Correct 25 ms 39972 KB Output is correct
47 Correct 25 ms 39988 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 55212 KB Output is correct
2 Correct 140 ms 61572 KB Output is correct
3 Correct 32 ms 40084 KB Output is correct
4 Correct 28 ms 39884 KB Output is correct
5 Correct 28 ms 39508 KB Output is correct
6 Correct 26 ms 39540 KB Output is correct
7 Correct 33 ms 39892 KB Output is correct
8 Correct 260 ms 56316 KB Output is correct
9 Correct 28 ms 39984 KB Output is correct
10 Correct 224 ms 54936 KB Output is correct
11 Correct 24 ms 39432 KB Output is correct
12 Correct 175 ms 54764 KB Output is correct
13 Correct 192 ms 56584 KB Output is correct
14 Correct 215 ms 61208 KB Output is correct
15 Correct 179 ms 55200 KB Output is correct
16 Correct 29 ms 40012 KB Output is correct
17 Correct 27 ms 39472 KB Output is correct
18 Correct 184 ms 60936 KB Output is correct
19 Correct 240 ms 64520 KB Output is correct
20 Correct 30 ms 40020 KB Output is correct
21 Correct 22 ms 39508 KB Output is correct
22 Correct 189 ms 57000 KB Output is correct
23 Correct 30 ms 39892 KB Output is correct
24 Correct 166 ms 55392 KB Output is correct
25 Correct 303 ms 64444 KB Output is correct
26 Correct 24 ms 40124 KB Output is correct
27 Correct 33 ms 40196 KB Output is correct
28 Correct 26 ms 39956 KB Output is correct
29 Correct 24 ms 40012 KB Output is correct
30 Correct 30 ms 40020 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 39460 KB Output is correct
2 Correct 20 ms 39460 KB Output is correct
3 Correct 20 ms 39464 KB Output is correct
4 Correct 21 ms 39456 KB Output is correct
5 Correct 20 ms 39516 KB Output is correct
6 Correct 24 ms 39548 KB Output is correct
7 Correct 20 ms 39500 KB Output is correct
8 Correct 21 ms 39484 KB Output is correct
9 Correct 20 ms 39508 KB Output is correct
10 Correct 20 ms 39508 KB Output is correct
11 Correct 26 ms 39552 KB Output is correct
12 Correct 20 ms 39508 KB Output is correct
13 Correct 20 ms 39532 KB Output is correct
14 Correct 20 ms 39548 KB Output is correct
15 Correct 21 ms 39424 KB Output is correct
16 Correct 21 ms 39516 KB Output is correct
17 Correct 20 ms 39464 KB Output is correct
18 Correct 20 ms 39508 KB Output is correct
19 Correct 21 ms 39444 KB Output is correct
20 Correct 19 ms 39444 KB Output is correct
21 Correct 21 ms 39528 KB Output is correct
22 Correct 21 ms 39508 KB Output is correct
23 Correct 20 ms 39508 KB Output is correct
24 Correct 24 ms 39424 KB Output is correct
25 Correct 19 ms 39508 KB Output is correct
26 Correct 24 ms 40020 KB Output is correct
27 Correct 22 ms 39892 KB Output is correct
28 Correct 22 ms 40148 KB Output is correct
29 Correct 23 ms 40176 KB Output is correct
30 Correct 22 ms 39892 KB Output is correct
31 Correct 21 ms 39508 KB Output is correct
32 Correct 23 ms 40228 KB Output is correct
33 Correct 21 ms 39540 KB Output is correct
34 Correct 22 ms 40020 KB Output is correct
35 Correct 23 ms 40108 KB Output is correct
36 Correct 24 ms 39936 KB Output is correct
37 Correct 23 ms 40024 KB Output is correct
38 Correct 21 ms 39508 KB Output is correct
39 Correct 24 ms 40020 KB Output is correct
40 Correct 26 ms 40020 KB Output is correct
41 Correct 23 ms 40000 KB Output is correct
42 Correct 24 ms 39996 KB Output is correct
43 Correct 24 ms 40176 KB Output is correct
44 Correct 23 ms 39536 KB Output is correct
45 Correct 23 ms 40124 KB Output is correct
46 Correct 27 ms 40020 KB Output is correct
47 Correct 24 ms 39472 KB Output is correct
48 Correct 23 ms 40008 KB Output is correct
49 Correct 23 ms 40148 KB Output is correct
50 Correct 26 ms 40204 KB Output is correct
51 Correct 23 ms 39916 KB Output is correct
52 Correct 22 ms 40016 KB Output is correct
53 Correct 22 ms 40036 KB Output is correct
54 Correct 29 ms 39892 KB Output is correct
55 Correct 20 ms 39508 KB Output is correct
56 Correct 129 ms 55220 KB Output is correct
57 Correct 201 ms 54912 KB Output is correct
58 Correct 23 ms 39892 KB Output is correct
59 Correct 21 ms 39468 KB Output is correct
60 Correct 23 ms 39456 KB Output is correct
61 Correct 157 ms 54812 KB Output is correct
62 Correct 23 ms 39892 KB Output is correct
63 Correct 203 ms 61984 KB Output is correct
64 Correct 215 ms 54944 KB Output is correct
65 Correct 22 ms 39892 KB Output is correct
66 Correct 178 ms 55536 KB Output is correct
67 Correct 27 ms 39932 KB Output is correct
68 Correct 22 ms 39896 KB Output is correct
69 Correct 165 ms 55204 KB Output is correct
70 Correct 32 ms 40224 KB Output is correct
71 Correct 235 ms 55824 KB Output is correct
72 Correct 222 ms 57120 KB Output is correct
73 Correct 28 ms 39448 KB Output is correct
74 Correct 260 ms 63392 KB Output is correct
75 Correct 214 ms 58620 KB Output is correct
76 Correct 25 ms 39972 KB Output is correct
77 Correct 25 ms 39988 KB Output is correct
78 Correct 174 ms 55212 KB Output is correct
79 Correct 140 ms 61572 KB Output is correct
80 Correct 32 ms 40084 KB Output is correct
81 Correct 28 ms 39884 KB Output is correct
82 Correct 28 ms 39508 KB Output is correct
83 Correct 26 ms 39540 KB Output is correct
84 Correct 33 ms 39892 KB Output is correct
85 Correct 260 ms 56316 KB Output is correct
86 Correct 28 ms 39984 KB Output is correct
87 Correct 224 ms 54936 KB Output is correct
88 Correct 24 ms 39432 KB Output is correct
89 Correct 175 ms 54764 KB Output is correct
90 Correct 192 ms 56584 KB Output is correct
91 Correct 215 ms 61208 KB Output is correct
92 Correct 179 ms 55200 KB Output is correct
93 Correct 29 ms 40012 KB Output is correct
94 Correct 27 ms 39472 KB Output is correct
95 Correct 184 ms 60936 KB Output is correct
96 Correct 240 ms 64520 KB Output is correct
97 Correct 30 ms 40020 KB Output is correct
98 Correct 22 ms 39508 KB Output is correct
99 Correct 189 ms 57000 KB Output is correct
100 Correct 30 ms 39892 KB Output is correct
101 Correct 166 ms 55392 KB Output is correct
102 Correct 303 ms 64444 KB Output is correct
103 Correct 24 ms 40124 KB Output is correct
104 Correct 33 ms 40196 KB Output is correct
105 Correct 26 ms 39956 KB Output is correct
106 Correct 24 ms 40012 KB Output is correct
107 Correct 30 ms 40020 KB Output is correct
108 Correct 909 ms 122308 KB Output is correct
109 Correct 1350 ms 136608 KB Output is correct
110 Correct 1366 ms 149228 KB Output is correct
111 Correct 1508 ms 169532 KB Output is correct
112 Correct 1299 ms 151904 KB Output is correct
113 Runtime error 452 ms 259520 KB Execution killed with signal 11
114 Halted 0 ms 0 KB -