oj.uz

Submission #630382

# Submission time Handle Problem Language Result Execution time Memory
630382 2022-08-16T09:49:06 Z Arnch Mergers (JOI19_mergers) C++17
10 / 100
 375 ms 258504 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];

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

	merge(fin[ver[0]], 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();
		
		//cout<<"^^" <<v <<' ' <<p <<endl;
		merge(x, fin[v]);
		while(v != -1 && h[v] >= h[p]) {
			if(h[head[v]] < h[p]) break;
			upd(st[head[v]], st[v] + 1, x);
			v = par[head[v]][0];
		}
		if(v != -1) 
			upd(st[p], st[v] + 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);
		
	total = 5 * n;
	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 134 ms 235216 KB Output is correct
2 Correct 131 ms 235232 KB Output is correct
3 Correct 127 ms 235228 KB Output is correct
4 Correct 125 ms 235184 KB Output is correct
5 Correct 123 ms 235212 KB Output is correct
6 Correct 126 ms 235212 KB Output is correct
7 Correct 125 ms 235216 KB Output is correct
8 Correct 124 ms 235184 KB Output is correct
9 Correct 128 ms 235416 KB Output is correct
10 Correct 144 ms 235152 KB Output is correct
11 Correct 123 ms 235168 KB Output is correct
12 Correct 124 ms 235184 KB Output is correct
13 Correct 126 ms 235168 KB Output is correct
14 Correct 125 ms 235304 KB Output is correct
15 Correct 128 ms 235236 KB Output is correct
16 Correct 127 ms 235192 KB Output is correct
17 Correct 128 ms 235216 KB Output is correct
18 Correct 135 ms 235168 KB Output is correct
19 Correct 127 ms 235112 KB Output is correct
20 Correct 122 ms 235100 KB Output is correct
21 Correct 122 ms 235236 KB Output is correct
22 Correct 127 ms 235228 KB Output is correct
23 Correct 126 ms 235148 KB Output is correct
24 Correct 122 ms 235216 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 235216 KB Output is correct
2 Correct 131 ms 235232 KB Output is correct
3 Correct 127 ms 235228 KB Output is correct
4 Correct 125 ms 235184 KB Output is correct
5 Correct 123 ms 235212 KB Output is correct
6 Correct 126 ms 235212 KB Output is correct
7 Correct 125 ms 235216 KB Output is correct
8 Correct 124 ms 235184 KB Output is correct
9 Correct 128 ms 235416 KB Output is correct
10 Correct 144 ms 235152 KB Output is correct
11 Correct 123 ms 235168 KB Output is correct
12 Correct 124 ms 235184 KB Output is correct
13 Correct 126 ms 235168 KB Output is correct
14 Correct 125 ms 235304 KB Output is correct
15 Correct 128 ms 235236 KB Output is correct
16 Correct 127 ms 235192 KB Output is correct
17 Correct 128 ms 235216 KB Output is correct
18 Correct 135 ms 235168 KB Output is correct
19 Correct 127 ms 235112 KB Output is correct
20 Correct 122 ms 235100 KB Output is correct
21 Correct 122 ms 235236 KB Output is correct
22 Correct 127 ms 235228 KB Output is correct
23 Correct 126 ms 235148 KB Output is correct
24 Correct 122 ms 235216 KB Output is correct
25 Correct 123 ms 235168 KB Output is correct
26 Incorrect 126 ms 235804 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 235216 KB Output is correct
2 Correct 131 ms 235232 KB Output is correct
3 Correct 127 ms 235228 KB Output is correct
4 Correct 125 ms 235184 KB Output is correct
5 Correct 123 ms 235212 KB Output is correct
6 Correct 126 ms 235212 KB Output is correct
7 Correct 125 ms 235216 KB Output is correct
8 Correct 124 ms 235184 KB Output is correct
9 Correct 128 ms 235416 KB Output is correct
10 Correct 144 ms 235152 KB Output is correct
11 Correct 123 ms 235168 KB Output is correct
12 Correct 124 ms 235184 KB Output is correct
13 Correct 126 ms 235168 KB Output is correct
14 Correct 125 ms 235304 KB Output is correct
15 Correct 128 ms 235236 KB Output is correct
16 Correct 127 ms 235192 KB Output is correct
17 Correct 128 ms 235216 KB Output is correct
18 Correct 135 ms 235168 KB Output is correct
19 Correct 127 ms 235112 KB Output is correct
20 Correct 122 ms 235100 KB Output is correct
21 Correct 122 ms 235236 KB Output is correct
22 Correct 127 ms 235228 KB Output is correct
23 Correct 126 ms 235148 KB Output is correct
24 Correct 122 ms 235216 KB Output is correct
25 Correct 126 ms 235188 KB Output is correct
26 Correct 238 ms 252176 KB Output is correct
27 Correct 375 ms 251904 KB Output is correct
28 Incorrect 126 ms 235740 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 246 ms 251924 KB Output is correct
2 Correct 242 ms 258504 KB Output is correct
3 Incorrect 130 ms 235776 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 235216 KB Output is correct
2 Correct 131 ms 235232 KB Output is correct
3 Correct 127 ms 235228 KB Output is correct
4 Correct 125 ms 235184 KB Output is correct
5 Correct 123 ms 235212 KB Output is correct
6 Correct 126 ms 235212 KB Output is correct
7 Correct 125 ms 235216 KB Output is correct
8 Correct 124 ms 235184 KB Output is correct
9 Correct 128 ms 235416 KB Output is correct
10 Correct 144 ms 235152 KB Output is correct
11 Correct 123 ms 235168 KB Output is correct
12 Correct 124 ms 235184 KB Output is correct
13 Correct 126 ms 235168 KB Output is correct
14 Correct 125 ms 235304 KB Output is correct
15 Correct 128 ms 235236 KB Output is correct
16 Correct 127 ms 235192 KB Output is correct
17 Correct 128 ms 235216 KB Output is correct
18 Correct 135 ms 235168 KB Output is correct
19 Correct 127 ms 235112 KB Output is correct
20 Correct 122 ms 235100 KB Output is correct
21 Correct 122 ms 235236 KB Output is correct
22 Correct 127 ms 235228 KB Output is correct
23 Correct 126 ms 235148 KB Output is correct
24 Correct 122 ms 235216 KB Output is correct
25 Correct 123 ms 235168 KB Output is correct
26 Incorrect 126 ms 235804 KB Output isn't correct
27 Halted 0 ms 0 KB -