oj.uz

답안 #518999

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
518999 2022-01-25T10:14:02 Z Keshi Unique Cities (JOI19_ho_t5) C++17
100 / 100
 1056 ms 73652 KB 
//In the name of God
#include <bits/stdc++.h>
using namespace std;

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

const int maxn = 2e5 + 100;
const int mod = 1e9 + 7;
const int inf = 1e9;

#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("input.txt", "r+", stdin);freopen("output.txt", "w+", stdout);
#define pb push_back
#define Mp make_pair
#define F first
#define S second
#define Sz(x) ll((x).size())
#define all(x) (x).begin(), (x).end()
#define lc (id << 1)
#define rc (lc | 1)

ll pw(ll a, ll b){
	ll c = 1;
	while(b){
		if(b & 1) c = c * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return c;
}

int n, m, c[maxn], d[maxn], mx, r1, r2, dd[maxn], ans[maxn], prv[maxn];
vector<int> g[maxn];
bool vis[maxn];
int seg[maxn << 2], lz[maxn << 2], cnt[maxn << 2];

void bld(int id, int s, int e){
	seg[id] = lz[id] = 0;
	cnt[id] = e - s;
	if(e - s == 1) return;
	int mid = (s + e) >> 1;
	bld(lc, s, mid);
	bld(rc, mid, e);
	return;
}

void upd(int id, int s, int e, int l, int r, int x){
	if(r <= s || e <= l) return;
	if(l <= s && e <= r){
		seg[id] += x;
		lz[id] += x;
		return;
	}
	int mid = (s + e) >> 1;
	seg[lc] += lz[id];
	lz[lc] += lz[id];
	seg[rc] += lz[id];
	lz[rc] += lz[id];
	lz[id] = 0;
	upd(lc, s, mid, l, r, x);
	upd(rc, mid, e, l, r, x);
	seg[id] = min(seg[lc], seg[rc]);
	cnt[id] = 0;
	if(seg[id] == seg[lc]) cnt[id] += cnt[lc];
	if(seg[id] == seg[rc]) cnt[id] += cnt[rc];
	return;
}
int get(int id, int s, int e, int l, int r){
	if(r <= s || e <= l) return inf;
	if(l <= s && e <= r) return seg[id];
	int mid = (s + e) >> 1;
	seg[lc] += lz[id];
	lz[lc] += lz[id];
	seg[rc] += lz[id];
	lz[rc] += lz[id];
	lz[id] = 0;
	return min(get(lc, s, mid, l, r), get(rc, mid, e, l, r));
}

void difs(int v){
	vis[v] = 1;
	if(d[v] > d[mx]) mx = v;
	for(int u : g[v]){
		if(vis[u]) continue;
		d[u] = d[v] + 1;
		difs(u);
	}
	return;
}
vector<int> gg[maxn];

void prep(int v, int p = -1){
	gg[v].clear();
	dd[v] = d[v];
	for(int u : g[v]){
		if(u == p) continue;
		d[u] = d[v] + 1;
		gg[v].pb(u);
		prep(u, v);
		dd[v] = max(dd[v], dd[u]);
	}
	return;
}

void solve(int v){
	upd(1, 0, n, d[v] - (dd[v] - d[v]), d[v], 1);
	ans[v] = max(ans[v], cnt[1] - (n - d[v]));
	upd(1, 0, n, d[v] - (dd[v] - d[v]), d[v], -1);
	vector<pll> vec;
	vec.pb(Mp(-d[v], v));
	for(int u : gg[v]){
		vec.pb(Mp(-dd[u], u));
	}
	sort(all(vec));
	for(int u : gg[v]){
		int x = d[v] - (-vec[0].F - d[v]);
		if(u == vec[0].S){
			x = d[v] - (-vec[1].F - d[v]);
		}
		upd(1, 0, n, x, d[v], 1);
		int pr = prv[c[v]];
		if(pr == 0 || get(1, 0, n, d[pr], d[pr] + 1) != 0){
			prv[c[v]] = v;
		}
		else{
			upd(1, 0, n, d[v], d[v] + 1, 1);
		}
		solve(u);
		if(prv[c[v]] == v){
			prv[c[v]] = pr;
		}
		else{
			upd(1, 0, n, d[v], d[v] + 1, -1);
		}
		upd(1, 0, n, x, d[v], -1);
	}
	return;
}

int main(){
	fast_io;

	cin >> n >> m;
	for(int i = 1; i < n; i++){
		int v, u;
		cin >> v >> u;
		g[v].pb(u);
		g[u].pb(v);
	}
	for(int i = 1; i <= n; i++){
		cin >> c[i];
	}
	d[1] = 0;
	difs(1);
	r1 = mx;
	fill(vis, vis + n + 10, 0);
	d[r1] = 0;
	difs(r1);
	r2 = mx;
	d[r1] = 0;
	prep(r1);
	bld(1, 0, n);
	solve(r1);
	d[r2] = 0;
	prep(r2);
	bld(1, 0, n);
	solve(r2);

	for(int i = 1; i <= n; i++){
		cout << ans[i] << "\n";
	}
	
	return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9680 KB Output is correct
2 Correct 9 ms 9932 KB Output is correct
3 Correct 7 ms 9980 KB Output is correct
4 Correct 12 ms 10080 KB Output is correct
5 Correct 12 ms 10000 KB Output is correct
6 Correct 10 ms 10316 KB Output is correct
7 Correct 11 ms 10128 KB Output is correct
8 Correct 11 ms 10000 KB Output is correct
9 Correct 10 ms 9956 KB Output is correct
10 Correct 12 ms 9932 KB Output is correct
11 Correct 9 ms 9932 KB Output is correct
12 Correct 10 ms 9932 KB Output is correct
13 Correct 12 ms 10316 KB Output is correct
14 Correct 10 ms 10128 KB Output is correct
15 Correct 16 ms 10116 KB Output is correct
16 Correct 10 ms 9984 KB Output is correct
17 Correct 10 ms 10188 KB Output is correct
18 Correct 10 ms 10184 KB Output is correct
19 Correct 12 ms 9932 KB Output is correct
20 Correct 10 ms 10316 KB Output is correct
21 Correct 9 ms 10188 KB Output is correct
22 Correct 9 ms 9932 KB Output is correct
23 Correct 8 ms 10060 KB Output is correct
24 Correct 13 ms 9932 KB Output is correct
25 Correct 9 ms 9968 KB Output is correct
26 Correct 8 ms 9932 KB Output is correct
27 Correct 9 ms 10260 KB Output is correct
28 Correct 9 ms 10124 KB Output is correct
29 Correct 11 ms 10104 KB Output is correct
30 Correct 10 ms 9932 KB Output is correct
31 Correct 10 ms 10248 KB Output is correct
32 Correct 9 ms 10132 KB Output is correct

Subtask #2
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 404 ms 20904 KB Output is correct
2 Correct 603 ms 44844 KB Output is correct
3 Correct 101 ms 15772 KB Output is correct
4 Correct 845 ms 30960 KB Output is correct
5 Correct 1030 ms 70864 KB Output is correct
6 Correct 1024 ms 51504 KB Output is correct
7 Correct 814 ms 31992 KB Output is correct
8 Correct 866 ms 35256 KB Output is correct
9 Correct 908 ms 33924 KB Output is correct
10 Correct 943 ms 33928 KB Output is correct
11 Correct 612 ms 35460 KB Output is correct
12 Correct 1014 ms 56416 KB Output is correct
13 Correct 941 ms 51664 KB Output is correct
14 Correct 958 ms 49840 KB Output is correct
15 Correct 707 ms 35448 KB Output is correct
16 Correct 902 ms 57948 KB Output is correct
17 Correct 1002 ms 51908 KB Output is correct

Subtask #3
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 504 ms 27468 KB Output is correct
2 Correct 842 ms 68952 KB Output is correct
3 Correct 87 ms 16068 KB Output is correct
4 Correct 660 ms 30548 KB Output is correct
5 Correct 963 ms 71392 KB Output is correct
6 Correct 862 ms 51332 KB Output is correct
7 Correct 709 ms 30972 KB Output is correct
8 Correct 739 ms 39248 KB Output is correct
9 Correct 716 ms 36380 KB Output is correct
10 Correct 725 ms 34060 KB Output is correct
11 Correct 605 ms 33216 KB Output is correct
12 Correct 843 ms 63624 KB Output is correct
13 Correct 741 ms 48404 KB Output is correct
14 Correct 815 ms 49128 KB Output is correct
15 Correct 628 ms 34304 KB Output is correct
16 Correct 790 ms 58060 KB Output is correct
17 Correct 764 ms 51796 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9680 KB Output is correct
2 Correct 9 ms 9932 KB Output is correct
3 Correct 7 ms 9980 KB Output is correct
4 Correct 12 ms 10080 KB Output is correct
5 Correct 12 ms 10000 KB Output is correct
6 Correct 10 ms 10316 KB Output is correct
7 Correct 11 ms 10128 KB Output is correct
8 Correct 11 ms 10000 KB Output is correct
9 Correct 10 ms 9956 KB Output is correct
10 Correct 12 ms 9932 KB Output is correct
11 Correct 9 ms 9932 KB Output is correct
12 Correct 10 ms 9932 KB Output is correct
13 Correct 12 ms 10316 KB Output is correct
14 Correct 10 ms 10128 KB Output is correct
15 Correct 16 ms 10116 KB Output is correct
16 Correct 10 ms 9984 KB Output is correct
17 Correct 10 ms 10188 KB Output is correct
18 Correct 10 ms 10184 KB Output is correct
19 Correct 12 ms 9932 KB Output is correct
20 Correct 10 ms 10316 KB Output is correct
21 Correct 9 ms 10188 KB Output is correct
22 Correct 9 ms 9932 KB Output is correct
23 Correct 8 ms 10060 KB Output is correct
24 Correct 13 ms 9932 KB Output is correct
25 Correct 9 ms 9968 KB Output is correct
26 Correct 8 ms 9932 KB Output is correct
27 Correct 9 ms 10260 KB Output is correct
28 Correct 9 ms 10124 KB Output is correct
29 Correct 11 ms 10104 KB Output is correct
30 Correct 10 ms 9932 KB Output is correct
31 Correct 10 ms 10248 KB Output is correct
32 Correct 9 ms 10132 KB Output is correct
33 Correct 404 ms 20904 KB Output is correct
34 Correct 603 ms 44844 KB Output is correct
35 Correct 101 ms 15772 KB Output is correct
36 Correct 845 ms 30960 KB Output is correct
37 Correct 1030 ms 70864 KB Output is correct
38 Correct 1024 ms 51504 KB Output is correct
39 Correct 814 ms 31992 KB Output is correct
40 Correct 866 ms 35256 KB Output is correct
41 Correct 908 ms 33924 KB Output is correct
42 Correct 943 ms 33928 KB Output is correct
43 Correct 612 ms 35460 KB Output is correct
44 Correct 1014 ms 56416 KB Output is correct
45 Correct 941 ms 51664 KB Output is correct
46 Correct 958 ms 49840 KB Output is correct
47 Correct 707 ms 35448 KB Output is correct
48 Correct 902 ms 57948 KB Output is correct
49 Correct 1002 ms 51908 KB Output is correct
50 Correct 504 ms 27468 KB Output is correct
51 Correct 842 ms 68952 KB Output is correct
52 Correct 87 ms 16068 KB Output is correct
53 Correct 660 ms 30548 KB Output is correct
54 Correct 963 ms 71392 KB Output is correct
55 Correct 862 ms 51332 KB Output is correct
56 Correct 709 ms 30972 KB Output is correct
57 Correct 739 ms 39248 KB Output is correct
58 Correct 716 ms 36380 KB Output is correct
59 Correct 725 ms 34060 KB Output is correct
60 Correct 605 ms 33216 KB Output is correct
61 Correct 843 ms 63624 KB Output is correct
62 Correct 741 ms 48404 KB Output is correct
63 Correct 815 ms 49128 KB Output is correct
64 Correct 628 ms 34304 KB Output is correct
65 Correct 790 ms 58060 KB Output is correct
66 Correct 764 ms 51796 KB Output is correct
67 Correct 64 ms 12940 KB Output is correct
68 Correct 384 ms 38148 KB Output is correct
69 Correct 528 ms 36516 KB Output is correct
70 Correct 715 ms 32704 KB Output is correct
71 Correct 1031 ms 72584 KB Output is correct
72 Correct 957 ms 53284 KB Output is correct
73 Correct 720 ms 33184 KB Output is correct
74 Correct 872 ms 40956 KB Output is correct
75 Correct 809 ms 36680 KB Output is correct
76 Correct 814 ms 36168 KB Output is correct
77 Correct 655 ms 35224 KB Output is correct
78 Correct 1010 ms 62404 KB Output is correct
79 Correct 857 ms 57532 KB Output is correct
80 Correct 910 ms 49968 KB Output is correct
81 Correct 578 ms 36920 KB Output is correct
82 Correct 918 ms 59632 KB Output is correct
83 Correct 970 ms 53584 KB Output is correct
84 Correct 707 ms 33044 KB Output is correct
85 Correct 1041 ms 73244 KB Output is correct
86 Correct 988 ms 53684 KB Output is correct
87 Correct 689 ms 33316 KB Output is correct
88 Correct 863 ms 41784 KB Output is correct
89 Correct 824 ms 37716 KB Output is correct
90 Correct 849 ms 36604 KB Output is correct
91 Correct 618 ms 35668 KB Output is correct
92 Correct 1012 ms 71928 KB Output is correct
93 Correct 858 ms 47620 KB Output is correct
94 Correct 897 ms 43684 KB Output is correct
95 Correct 625 ms 37440 KB Output is correct
96 Correct 900 ms 60232 KB Output is correct
97 Correct 917 ms 54164 KB Output is correct
98 Correct 679 ms 34288 KB Output is correct
99 Correct 1056 ms 73652 KB Output is correct
100 Correct 861 ms 54928 KB Output is correct
101 Correct 633 ms 34448 KB Output is correct
102 Correct 814 ms 40444 KB Output is correct
103 Correct 729 ms 37836 KB Output is correct
104 Correct 712 ms 37140 KB Output is correct
105 Correct 583 ms 36000 KB Output is correct
106 Correct 938 ms 57032 KB Output is correct
107 Correct 927 ms 57584 KB Output is correct
108 Correct 817 ms 46948 KB Output is correct
109 Correct 604 ms 38020 KB Output is correct
110 Correct 917 ms 61032 KB Output is correct
111 Correct 844 ms 54812 KB Output is correct