oj.uz

Submission #306680

# Submission time Handle Problem Language Result Execution time Memory
306680 2020-09-26T06:03:37 Z pit4h Unique Cities (JOI19_ho_t5) C++14
100 / 100
 582 ms 37996 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 2e5+1;
int n, m, c[N], d[N], h[N], diam, v1, v2, root, M[N], distinct;
bool calced[N];
vector<int> g[N], path;
void predfs(int x, int p) {
	d[x] = d[p] + 1;
	h[x] = 0;
	for(int i: g[x]) {
		if(i!=p) {
			predfs(i, x);
			h[x] = max(h[x], h[i] + 1);
		}
	}
}
bool added[N];
void _add(int x) {
	if(added[x]) return;
	M[c[x]]++;
	added[x]=1;
	if(M[c[x]]==1) distinct++;
}
void _del(int x) {
	if(!added[x]) return;
	M[c[x]]--;
	added[x]=0;
	if(M[c[x]]==0) distinct--;
}
int cnt[N];
int ans[N];
void solve(int x, int p) { 
	int len = path.size();
	int max_child = 0;
	for(int i: g[x]) {
		if(i != p && (!max_child || h[max_child] < h[i])) {
			max_child = i;
		}
	}
	for(int i: g[x]) {
		if(i != p && (x == root || i != max_child)) {
			for(int j=max(0, len-h[i]-1); j<len; ++j) {
				cnt[j]++;
				if(cnt[j]==1) {
					_del(path[j]);
				}
			}
		}
	}
	if(x != root) {
		int del1=(len-1)-h[x]-1, del2=del1+1;
		if(del1>=0) {
			cnt[del1]--;
			if(cnt[del1]==0) _add(path[del1]);
		}
		if(del2>=0) {
			cnt[del2]--;
			if(cnt[del2]==0) _add(path[del2]);
		}
		cnt[len-1]++;
		if(cnt[len-1]==1) _del(path[len-1]);
	}
	ans[x] = max(ans[x], distinct);
	path.push_back(x);
	_add(x);
	for(int i: g[x]) {
		if(i != p) {
			solve(i, x);
		}
	}
	for(int i: g[x]) {
		if(i != p && (x == root || i != max_child)) {
			for(int j=max(0, len-h[i]-1); j<len; ++j) {
				cnt[j]--;
				if(cnt[j]==0) {
					_add(path[j]);
				}
			}
		}
	}
	if(x != root) {
		int del1=(len-1)-h[x]-1, del2=del1+1;
		if(del1>=0) {
			cnt[del1]++;
			if(cnt[del1]==1) _del(path[del1]);
		}
		if(del2>=0) {
			cnt[del2]++;
			if(cnt[del2]==1) _del(path[del2]);
		}
		cnt[len-1]--;
		if(cnt[len-1]==0) _add(path[len-1]);
	}
	path.pop_back();
	_del(x);
}            
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin>>n>>m;
	for(int i=0; i<n-1; ++i) {
		int a, b; cin>>a>>b;
		g[a].push_back(b);
		g[b].push_back(a);
	}
	for(int i=1; i<=n; ++i) {
		cin>>c[i];
	}
	predfs(1, 1);
	for(int i=1; i<=n; ++i) {
		if(d[i] > d[v1]) {
			v1 = i;
		}
	}
	diam = d[v1];
	d[v1] = 0;
	predfs(v1, v1);
	for(int i=1; i<=n; ++i) {
		if(d[i] > d[v2]) {
			v2 = i;
		}
	}

	root = v1;
	d[root] = 0;
	predfs(root, root);
	solve(v1, v1);	

	root = v2;
	d[root] = 0;
	predfs(root, root);
	solve(v2, v2);
	for(int i=1; i<=n; ++i) {
		cout<<ans[i]<<'\n';
	}
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 5 ms 5248 KB Output is correct
3 Correct 4 ms 5248 KB Output is correct
4 Correct 6 ms 5248 KB Output is correct
5 Correct 6 ms 5248 KB Output is correct
6 Correct 5 ms 5376 KB Output is correct
7 Correct 5 ms 5248 KB Output is correct
8 Correct 6 ms 5248 KB Output is correct
9 Correct 6 ms 5248 KB Output is correct
10 Correct 6 ms 5248 KB Output is correct
11 Correct 6 ms 5248 KB Output is correct
12 Correct 5 ms 5248 KB Output is correct
13 Correct 6 ms 5376 KB Output is correct
14 Correct 6 ms 5248 KB Output is correct
15 Correct 5 ms 5248 KB Output is correct
16 Correct 5 ms 5248 KB Output is correct
17 Correct 5 ms 5376 KB Output is correct
18 Correct 5 ms 5248 KB Output is correct
19 Correct 5 ms 5248 KB Output is correct
20 Correct 6 ms 5376 KB Output is correct
21 Correct 6 ms 5248 KB Output is correct
22 Correct 5 ms 5248 KB Output is correct
23 Correct 6 ms 5248 KB Output is correct
24 Correct 6 ms 5248 KB Output is correct
25 Correct 6 ms 5248 KB Output is correct
26 Correct 5 ms 5248 KB Output is correct
27 Correct 6 ms 5376 KB Output is correct
28 Correct 6 ms 5376 KB Output is correct
29 Correct 6 ms 5248 KB Output is correct
30 Correct 5 ms 5248 KB Output is correct
31 Correct 5 ms 5376 KB Output is correct
32 Correct 5 ms 5248 KB Output is correct

Subtask #2
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 210 ms 12664 KB Output is correct
2 Correct 277 ms 22512 KB Output is correct
3 Correct 34 ms 8312 KB Output is correct
4 Correct 443 ms 18200 KB Output is correct
5 Correct 578 ms 35436 KB Output is correct
6 Correct 512 ms 26860 KB Output is correct
7 Correct 422 ms 18164 KB Output is correct
8 Correct 461 ms 19964 KB Output is correct
9 Correct 448 ms 19448 KB Output is correct
10 Correct 445 ms 19320 KB Output is correct
11 Correct 246 ms 18796 KB Output is correct
12 Correct 522 ms 29168 KB Output is correct
13 Correct 471 ms 26608 KB Output is correct
14 Correct 484 ms 26224 KB Output is correct
15 Correct 239 ms 18800 KB Output is correct
16 Correct 466 ms 29932 KB Output is correct
17 Correct 485 ms 27132 KB Output is correct

Subtask #3
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 341 ms 16632 KB Output is correct
2 Correct 552 ms 36456 KB Output is correct
3 Correct 40 ms 8824 KB Output is correct
4 Correct 460 ms 19832 KB Output is correct
5 Correct 582 ms 37996 KB Output is correct
6 Correct 542 ms 28652 KB Output is correct
7 Correct 436 ms 19960 KB Output is correct
8 Correct 490 ms 23800 KB Output is correct
9 Correct 466 ms 22436 KB Output is correct
10 Correct 463 ms 21240 KB Output is correct
11 Correct 370 ms 20084 KB Output is correct
12 Correct 565 ms 34408 KB Output is correct
13 Correct 487 ms 27596 KB Output is correct
14 Correct 556 ms 27760 KB Output is correct
15 Correct 281 ms 20584 KB Output is correct
16 Correct 491 ms 32108 KB Output is correct
17 Correct 512 ms 29036 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5120 KB Output is correct
2 Correct 5 ms 5248 KB Output is correct
3 Correct 4 ms 5248 KB Output is correct
4 Correct 6 ms 5248 KB Output is correct
5 Correct 6 ms 5248 KB Output is correct
6 Correct 5 ms 5376 KB Output is correct
7 Correct 5 ms 5248 KB Output is correct
8 Correct 6 ms 5248 KB Output is correct
9 Correct 6 ms 5248 KB Output is correct
10 Correct 6 ms 5248 KB Output is correct
11 Correct 6 ms 5248 KB Output is correct
12 Correct 5 ms 5248 KB Output is correct
13 Correct 6 ms 5376 KB Output is correct
14 Correct 6 ms 5248 KB Output is correct
15 Correct 5 ms 5248 KB Output is correct
16 Correct 5 ms 5248 KB Output is correct
17 Correct 5 ms 5376 KB Output is correct
18 Correct 5 ms 5248 KB Output is correct
19 Correct 5 ms 5248 KB Output is correct
20 Correct 6 ms 5376 KB Output is correct
21 Correct 6 ms 5248 KB Output is correct
22 Correct 5 ms 5248 KB Output is correct
23 Correct 6 ms 5248 KB Output is correct
24 Correct 6 ms 5248 KB Output is correct
25 Correct 6 ms 5248 KB Output is correct
26 Correct 5 ms 5248 KB Output is correct
27 Correct 6 ms 5376 KB Output is correct
28 Correct 6 ms 5376 KB Output is correct
29 Correct 6 ms 5248 KB Output is correct
30 Correct 5 ms 5248 KB Output is correct
31 Correct 5 ms 5376 KB Output is correct
32 Correct 5 ms 5248 KB Output is correct
33 Correct 210 ms 12664 KB Output is correct
34 Correct 277 ms 22512 KB Output is correct
35 Correct 34 ms 8312 KB Output is correct
36 Correct 443 ms 18200 KB Output is correct
37 Correct 578 ms 35436 KB Output is correct
38 Correct 512 ms 26860 KB Output is correct
39 Correct 422 ms 18164 KB Output is correct
40 Correct 461 ms 19964 KB Output is correct
41 Correct 448 ms 19448 KB Output is correct
42 Correct 445 ms 19320 KB Output is correct
43 Correct 246 ms 18796 KB Output is correct
44 Correct 522 ms 29168 KB Output is correct
45 Correct 471 ms 26608 KB Output is correct
46 Correct 484 ms 26224 KB Output is correct
47 Correct 239 ms 18800 KB Output is correct
48 Correct 466 ms 29932 KB Output is correct
49 Correct 485 ms 27132 KB Output is correct
50 Correct 341 ms 16632 KB Output is correct
51 Correct 552 ms 36456 KB Output is correct
52 Correct 40 ms 8824 KB Output is correct
53 Correct 460 ms 19832 KB Output is correct
54 Correct 582 ms 37996 KB Output is correct
55 Correct 542 ms 28652 KB Output is correct
56 Correct 436 ms 19960 KB Output is correct
57 Correct 490 ms 23800 KB Output is correct
58 Correct 466 ms 22436 KB Output is correct
59 Correct 463 ms 21240 KB Output is correct
60 Correct 370 ms 20084 KB Output is correct
61 Correct 565 ms 34408 KB Output is correct
62 Correct 487 ms 27596 KB Output is correct
63 Correct 556 ms 27760 KB Output is correct
64 Correct 281 ms 20584 KB Output is correct
65 Correct 491 ms 32108 KB Output is correct
66 Correct 512 ms 29036 KB Output is correct
67 Correct 32 ms 7040 KB Output is correct
68 Correct 195 ms 18960 KB Output is correct
69 Correct 287 ms 19188 KB Output is correct
70 Correct 442 ms 18040 KB Output is correct
71 Correct 553 ms 35308 KB Output is correct
72 Correct 528 ms 26736 KB Output is correct
73 Correct 427 ms 18168 KB Output is correct
74 Correct 469 ms 21624 KB Output is correct
75 Correct 449 ms 19704 KB Output is correct
76 Correct 456 ms 19576 KB Output is correct
77 Correct 349 ms 18416 KB Output is correct
78 Correct 539 ms 30828 KB Output is correct
79 Correct 477 ms 28820 KB Output is correct
80 Correct 488 ms 25456 KB Output is correct
81 Correct 236 ms 18408 KB Output is correct
82 Correct 467 ms 29804 KB Output is correct
83 Correct 484 ms 27116 KB Output is correct
84 Correct 441 ms 18424 KB Output is correct
85 Correct 557 ms 36076 KB Output is correct
86 Correct 525 ms 27372 KB Output is correct
87 Correct 428 ms 18552 KB Output is correct
88 Correct 472 ms 22388 KB Output is correct
89 Correct 474 ms 20544 KB Output is correct
90 Correct 458 ms 20016 KB Output is correct
91 Correct 357 ms 18800 KB Output is correct
92 Correct 564 ms 35564 KB Output is correct
93 Correct 464 ms 24816 KB Output is correct
94 Correct 485 ms 23020 KB Output is correct
95 Correct 234 ms 19052 KB Output is correct
96 Correct 478 ms 30444 KB Output is correct
97 Correct 489 ms 27564 KB Output is correct
98 Correct 453 ms 19764 KB Output is correct
99 Correct 562 ms 36460 KB Output is correct
100 Correct 524 ms 28656 KB Output is correct
101 Correct 413 ms 18920 KB Output is correct
102 Correct 465 ms 22136 KB Output is correct
103 Correct 463 ms 20856 KB Output is correct
104 Correct 477 ms 20516 KB Output is correct
105 Correct 331 ms 19192 KB Output is correct
106 Correct 537 ms 29420 KB Output is correct
107 Correct 494 ms 29552 KB Output is correct
108 Correct 491 ms 25204 KB Output is correct
109 Correct 244 ms 19964 KB Output is correct
110 Correct 486 ms 31336 KB Output is correct
111 Correct 486 ms 28268 KB Output is correct