oj.uz

답안 #518943

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
518943 2022-01-25T08:58:13 Z alireza_kaviani Unique Cities (JOI19_ho_t5) C++11
100 / 100
 1002 ms 56136 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

#define all(x)      (x).begin(),(x).end()
#define X           first
#define Y           second
#define sep         ' '
#define endl        '\n'
#define SZ(x)       ll(x.size())
#define lc          id << 1
#define rc          lc | 1

const ll MAXN = 2e5 + 10;
const ll LOG = 22;
const ll INF = 8e18;
const ll MOD = 1e9 + 7; //998244353; //1e9 + 9;

int n , m , C[MAXN] , dist[MAXN] , mx[MAXN] , up[MAXN], lz[MAXN << 2] , ans[MAXN];
pii seg[MAXN << 2];
vector<int> adj[MAXN] , col[MAXN];

pii Merge(pii L, pii R){
	pii ans = {min(L.X , R.X), 0};
	if(ans.X == L.X)	ans.Y += L.Y;
	if(ans.X == R.X)	ans.Y += R.Y;
	return ans;
}

void build(int id = 1 , int l = 0 , int r = n){
	seg[id] = {0 , r - l};
	lz[id] = 0;
	if(r - l == 1)	return;
	int mid = l + r >> 1;
	build(lc , l , mid);
	build(rc , mid , r);
}

void shift(int id){
	seg[lc].X += lz[id]; lz[lc] += lz[id];
	seg[rc].X += lz[id]; lz[rc] += lz[id];
	lz[id] = 0;
}

void add(int ql , int qr , int val , int id = 1 , int l = 0 , int r = n){
	if(qr <= l || r <= ql)	return;
	if(ql <= l && r <= qr){
		lz[id] += val;
		seg[id].X += val;
		return;
	}
	shift(id);
	int mid = l + r >> 1;
	add(ql , qr , val , lc , l , mid);
	add(ql , qr , val , rc , mid , r);
	seg[id] = Merge(seg[lc], seg[rc]);
}

pii get(int ql , int qr , int id = 1 , int l = 0 , int r = n){
	if(qr <= l || r <= ql)	return {0 , 0};
	if(ql <= l && r <= qr)	return seg[id];
	shift(id);
	int mid = l + r >> 1;
	return Merge(get(ql , qr , lc , l , mid), get(ql , qr , rc , mid , r));
}

int Find(int pos , int id = 1 , int l = 0 , int r = n){
	if(r - l == 1)	return (seg[id].X == 0);
	shift(id);
	int mid = l + r >> 1;
	if(pos < mid)	return Find(pos , lc , l , mid);
	return Find(pos , rc , mid , r);
}

void DistDFS(int v , int p = -1){
	dist[v] = (p == -1 ? 0 : dist[p] + 1);
	for(int u : adj[v]){
		if(u == p)	continue;
		DistDFS(u , v);
	}
}

void PreDFS(int v , int p = -1){
	mx[v] = up[v] = 0;
	for(int u : adj[v]){
		if(u == p)	continue;
		PreDFS(u , v);
		up[u] = mx[v];
		mx[v] = max(mx[v] , mx[u] + 1);
	}
	reverse(all(adj[v]));
	int mxl = 0;
	for(int u : adj[v]){
		if(u == p)	continue;
		up[u] = max(up[u] , mxl);
		mxl = max(mxl , mx[u] + 1);
	}
}

void SolveDFS(int v , int p = -1 , int h = 0){
	for(int u : adj[v]){
		if(u == p)	continue;
		int flag = 1;
		add(h - up[u] , h , 1);
//		cout << "Child " << v << sep << u << sep << h - up[u] << sep << h << endl;
		if(SZ(col[C[v]]) && Find(col[C[v]].back())){
			flag = 0;
//			cout << "Par" << v << sep << u << sep << h << sep << h + 1 << endl;
			add(h , h + 1 , 1);
		}
		else{
			col[C[v]].push_back(h);
		}
		ans[u] = max(ans[u] , get(0 , h + 1 - mx[u]).Y);
		SolveDFS(u , v , h + 1);
		if(flag){
			col[C[v]].pop_back();
		}
		else{
			add(h , h + 1 , -1);
		}
		add(h - up[u] , h , -1);
	}
}

int main() {
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

	cin >> n >> m;
	for(int i = 1 ; i < n ; i++){
		int v , u;
		cin >> v >> u;
		adj[v].push_back(u);
		adj[u].push_back(v);
	}
	for(int i = 1 ; i <= n ; i++){
		cin >> C[i];
	}
	DistDFS(1);
	int v = max_element(dist , dist + MAXN) - dist;
	DistDFS(v);
	int u = max_element(dist , dist + MAXN) - dist;
//	cout << v << sep << u << endl;

	build();
	PreDFS(v);
	SolveDFS(v);

	for(int i = 0 ; i < MAXN ; i++)	col[i].clear();
	build();
	PreDFS(u);
	SolveDFS(u);

	for(int i = 1 ; i <= n ; i++){
		cout << ans[i] << endl;
	}

    return 0;
}
/*

*/

Compilation message

joi2019_ho_t5.cpp: In function 'void build(int, int, int)':
joi2019_ho_t5.cpp:37:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   37 |  int mid = l + r >> 1;
      |            ~~^~~
joi2019_ho_t5.cpp: In function 'void add(int, int, int, int, int, int)':
joi2019_ho_t5.cpp:56:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   56 |  int mid = l + r >> 1;
      |            ~~^~~
joi2019_ho_t5.cpp: In function 'pii get(int, int, int, int, int)':
joi2019_ho_t5.cpp:66:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   66 |  int mid = l + r >> 1;
      |            ~~^~~
joi2019_ho_t5.cpp: In function 'int Find(int, int, int, int)':
joi2019_ho_t5.cpp:73:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   73 |  int mid = l + r >> 1;
      |            ~~^~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 9724 KB Output is correct
2 Correct 10 ms 9920 KB Output is correct
3 Correct 9 ms 9864 KB Output is correct
4 Correct 10 ms 9940 KB Output is correct
5 Correct 12 ms 9940 KB Output is correct
6 Correct 10 ms 10064 KB Output is correct
7 Correct 9 ms 10000 KB Output is correct
8 Correct 9 ms 9916 KB Output is correct
9 Correct 11 ms 9940 KB Output is correct
10 Correct 11 ms 9860 KB Output is correct
11 Correct 11 ms 9932 KB Output is correct
12 Correct 12 ms 9852 KB Output is correct
13 Correct 10 ms 10060 KB Output is correct
14 Correct 11 ms 9972 KB Output is correct
15 Correct 10 ms 9896 KB Output is correct
16 Correct 9 ms 9932 KB Output is correct
17 Correct 13 ms 9980 KB Output is correct
18 Correct 14 ms 10020 KB Output is correct
19 Correct 9 ms 9856 KB Output is correct
20 Correct 13 ms 10156 KB Output is correct
21 Correct 9 ms 10060 KB Output is correct
22 Correct 12 ms 9932 KB Output is correct
23 Correct 13 ms 9980 KB Output is correct
24 Correct 14 ms 9964 KB Output is correct
25 Correct 12 ms 9960 KB Output is correct
26 Correct 9 ms 9932 KB Output is correct
27 Correct 13 ms 10052 KB Output is correct
28 Correct 13 ms 10020 KB Output is correct
29 Correct 10 ms 9956 KB Output is correct
30 Correct 9 ms 9940 KB Output is correct
31 Correct 13 ms 9980 KB Output is correct
32 Correct 10 ms 10060 KB Output is correct

Subtask #2
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 364 ms 20496 KB Output is correct
2 Correct 397 ms 31176 KB Output is correct
3 Correct 109 ms 13668 KB Output is correct
4 Correct 734 ms 29476 KB Output is correct
5 Correct 885 ms 48040 KB Output is correct
6 Correct 776 ms 38752 KB Output is correct
7 Correct 668 ms 29528 KB Output is correct
8 Correct 704 ms 31348 KB Output is correct
9 Correct 667 ms 30768 KB Output is correct
10 Correct 740 ms 30692 KB Output is correct
11 Correct 445 ms 30184 KB Output is correct
12 Correct 840 ms 41188 KB Output is correct
13 Correct 762 ms 38632 KB Output is correct
14 Correct 757 ms 38116 KB Output is correct
15 Correct 363 ms 30048 KB Output is correct
16 Correct 700 ms 42168 KB Output is correct
17 Correct 708 ms 38880 KB Output is correct

Subtask #3
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 455 ms 30140 KB Output is correct
2 Correct 705 ms 54304 KB Output is correct
3 Correct 64 ms 15096 KB Output is correct
4 Correct 608 ms 34000 KB Output is correct
5 Correct 743 ms 56136 KB Output is correct
6 Correct 721 ms 45464 KB Output is correct
7 Correct 573 ms 33796 KB Output is correct
8 Correct 659 ms 38124 KB Output is correct
9 Correct 680 ms 36736 KB Output is correct
10 Correct 625 ms 35524 KB Output is correct
11 Correct 492 ms 33080 KB Output is correct
12 Correct 741 ms 51136 KB Output is correct
13 Correct 651 ms 42432 KB Output is correct
14 Correct 652 ms 43200 KB Output is correct
15 Correct 355 ms 31020 KB Output is correct
16 Correct 648 ms 47764 KB Output is correct
17 Correct 654 ms 44744 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 9724 KB Output is correct
2 Correct 10 ms 9920 KB Output is correct
3 Correct 9 ms 9864 KB Output is correct
4 Correct 10 ms 9940 KB Output is correct
5 Correct 12 ms 9940 KB Output is correct
6 Correct 10 ms 10064 KB Output is correct
7 Correct 9 ms 10000 KB Output is correct
8 Correct 9 ms 9916 KB Output is correct
9 Correct 11 ms 9940 KB Output is correct
10 Correct 11 ms 9860 KB Output is correct
11 Correct 11 ms 9932 KB Output is correct
12 Correct 12 ms 9852 KB Output is correct
13 Correct 10 ms 10060 KB Output is correct
14 Correct 11 ms 9972 KB Output is correct
15 Correct 10 ms 9896 KB Output is correct
16 Correct 9 ms 9932 KB Output is correct
17 Correct 13 ms 9980 KB Output is correct
18 Correct 14 ms 10020 KB Output is correct
19 Correct 9 ms 9856 KB Output is correct
20 Correct 13 ms 10156 KB Output is correct
21 Correct 9 ms 10060 KB Output is correct
22 Correct 12 ms 9932 KB Output is correct
23 Correct 13 ms 9980 KB Output is correct
24 Correct 14 ms 9964 KB Output is correct
25 Correct 12 ms 9960 KB Output is correct
26 Correct 9 ms 9932 KB Output is correct
27 Correct 13 ms 10052 KB Output is correct
28 Correct 13 ms 10020 KB Output is correct
29 Correct 10 ms 9956 KB Output is correct
30 Correct 9 ms 9940 KB Output is correct
31 Correct 13 ms 9980 KB Output is correct
32 Correct 10 ms 10060 KB Output is correct
33 Correct 364 ms 20496 KB Output is correct
34 Correct 397 ms 31176 KB Output is correct
35 Correct 109 ms 13668 KB Output is correct
36 Correct 734 ms 29476 KB Output is correct
37 Correct 885 ms 48040 KB Output is correct
38 Correct 776 ms 38752 KB Output is correct
39 Correct 668 ms 29528 KB Output is correct
40 Correct 704 ms 31348 KB Output is correct
41 Correct 667 ms 30768 KB Output is correct
42 Correct 740 ms 30692 KB Output is correct
43 Correct 445 ms 30184 KB Output is correct
44 Correct 840 ms 41188 KB Output is correct
45 Correct 762 ms 38632 KB Output is correct
46 Correct 757 ms 38116 KB Output is correct
47 Correct 363 ms 30048 KB Output is correct
48 Correct 700 ms 42168 KB Output is correct
49 Correct 708 ms 38880 KB Output is correct
50 Correct 455 ms 30140 KB Output is correct
51 Correct 705 ms 54304 KB Output is correct
52 Correct 64 ms 15096 KB Output is correct
53 Correct 608 ms 34000 KB Output is correct
54 Correct 743 ms 56136 KB Output is correct
55 Correct 721 ms 45464 KB Output is correct
56 Correct 573 ms 33796 KB Output is correct
57 Correct 659 ms 38124 KB Output is correct
58 Correct 680 ms 36736 KB Output is correct
59 Correct 625 ms 35524 KB Output is correct
60 Correct 492 ms 33080 KB Output is correct
61 Correct 741 ms 51136 KB Output is correct
62 Correct 651 ms 42432 KB Output is correct
63 Correct 652 ms 43200 KB Output is correct
64 Correct 355 ms 31020 KB Output is correct
65 Correct 648 ms 47764 KB Output is correct
66 Correct 654 ms 44744 KB Output is correct
67 Correct 52 ms 12740 KB Output is correct
68 Correct 288 ms 28276 KB Output is correct
69 Correct 408 ms 28024 KB Output is correct
70 Correct 585 ms 29380 KB Output is correct
71 Correct 744 ms 48032 KB Output is correct
72 Correct 759 ms 38744 KB Output is correct
73 Correct 578 ms 29516 KB Output is correct
74 Correct 703 ms 32960 KB Output is correct
75 Correct 654 ms 31128 KB Output is correct
76 Correct 649 ms 30844 KB Output is correct
77 Correct 496 ms 29812 KB Output is correct
78 Correct 760 ms 43136 KB Output is correct
79 Correct 679 ms 40844 KB Output is correct
80 Correct 694 ms 37044 KB Output is correct
81 Correct 352 ms 29848 KB Output is correct
82 Correct 681 ms 42228 KB Output is correct
83 Correct 741 ms 38860 KB Output is correct
84 Correct 535 ms 29688 KB Output is correct
85 Correct 805 ms 48764 KB Output is correct
86 Correct 743 ms 39192 KB Output is correct
87 Correct 619 ms 29772 KB Output is correct
88 Correct 820 ms 34028 KB Output is correct
89 Correct 919 ms 32044 KB Output is correct
90 Correct 717 ms 31356 KB Output is correct
91 Correct 562 ms 30192 KB Output is correct
92 Correct 933 ms 48192 KB Output is correct
93 Correct 801 ms 36428 KB Output is correct
94 Correct 845 ms 34648 KB Output is correct
95 Correct 458 ms 30376 KB Output is correct
96 Correct 717 ms 42672 KB Output is correct
97 Correct 767 ms 39444 KB Output is correct
98 Correct 708 ms 33140 KB Output is correct
99 Correct 1002 ms 49256 KB Output is correct
100 Correct 834 ms 42984 KB Output is correct
101 Correct 609 ms 31088 KB Output is correct
102 Correct 737 ms 34228 KB Output is correct
103 Correct 716 ms 33240 KB Output is correct
104 Correct 777 ms 32608 KB Output is correct
105 Correct 562 ms 30820 KB Output is correct
106 Correct 992 ms 43240 KB Output is correct
107 Correct 857 ms 41996 KB Output is correct
108 Correct 774 ms 39028 KB Output is correct
109 Correct 371 ms 30952 KB Output is correct
110 Correct 805 ms 44272 KB Output is correct
111 Correct 776 ms 42160 KB Output is correct