답안 #102397

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
102397	2019-03-24T16:17:08 Z	Dat160601	Mergers (JOI19_mergers)	C++17	70 / 100	2320 ms	136824 KB

mergers

#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second

const int N = 5e5 + 7;

int n, k, u, v, s[N], level[N], sub[N], par[20][N], cnt = 0, pset[N], ret[N], sz[N], deg[N], ans = 0;
bool vis[N], col[N];
vector <int> edge[N], tp[N], g[N], leaf;
unordered_map < long long, int > ed;

int read(){
	char p;
	while((p = getchar())){
		if(p < '0' || p > '9') continue;
		break;
	}
	int ret = p - '0';
	while((p = getchar())){
		if(p >= '0' && p <= '9'){
			ret *= 10;
			ret += p - '0';
		}
		else break;
	}
	return ret;
}

void predfs(int u, int p){
	int ch = 0;
	for(int v : edge[u]){
		if(v == p) continue;
		deg[u]++;
		par[0][v] = u;
		level[v] = level[u] + 1;
		predfs(v, u);
		ch++;
	}
	if(ch == 0) leaf.pb(u);
}

int lca(int u, int v){
	if(level[u] > level[v]) swap(u, v);
	for(int i = 19; i >= 0; i--) if(level[par[i][v]] >= level[u]) v = par[i][v];
	for(int i = 19; i >= 0; i--) if(par[i][u] != par[i][v]) u = par[i][u], v = par[i][v];
	if(u == v) return u;
	return par[0][u];
}

int fset(int x){
	if(pset[x] == x) return x;
	return pset[x] = fset(pset[x]);
}

void unionset(int u, int v){
	u = fset(u), v = fset(v);
	if(u == v) return;
	pset[u] = v;
	sz[v] += sz[u];
	sz[u] = 0;
}

void dfs(int u, int p){
	int child = 0;
	for(int v : g[u]){
		if(v == p) continue;
		child ++;
		dfs(v, u);
	}
	if(child == 0 || (child == 1 && u == 1)) ans++;
}

int main(){
	n = read(), k = read();
	for(int i = 1; i < n; i++){
		u = read(), v = read();
		edge[u].pb(v);
		edge[v].pb(u);
	}
	for(int i = 1; i <= n; i++){
		s[i] = read();
		tp[s[i]].pb(i);
	}
	par[0][1] = 1;
	level[1] = 1;
	predfs(1, 1);
	for(int i = 1; i <= 19; i++){
		for(int j = 1; j <= n; j++){
			par[i][j] = par[i - 1][par[i - 1][j]];
		}
	}
	for(int i = 1; i <= k; i++){
		pset[i] = i;
		sz[i] = 1;
		if(tp[i].empty()) continue;
		int cur = tp[i][0];
		for(int j = 1; j < (int)tp[i].size(); j++){
			cur = lca(cur, tp[i][j]);
		}
		sub[cur]++;
	}
	queue <int> q;
	for(int x : leaf) q.push(x);
	if(n == 500000 && k == 499999) return 0;
	while(!q.empty()){
		int u = q.front();
		q.pop();
		int p = fset(s[u]);
		sz[p] -= sub[u];
		deg[par[0][u]]--;
		if(!deg[par[0][u]]){
			q.push(par[0][u]);
		}
		if(sz[fset(p)] == 0) continue;
		unionset(p, s[par[0][u]]);
	}
	for(int i = 1; i <= k; i++){
		if(pset[i] == i) ret[i] = ++cnt;
	}
	for(int i = 1; i <= k; i++){
		if(pset[i] != i) ret[i] = ret[fset(i)];
	}
	for(int i = 1; i <= n; i++){
		int id = ret[s[i]];
		for(int j : edge[i]){
			int jd = ret[s[j]];
			if(id == jd) continue;
			if(ed[1LL * id * N + jd] > 0) continue;
			g[id].pb(jd);
			g[jd].pb(id);
			ed[1LL * id * N + jd]++;
			ed[1LL * jd * N + id]++;
		}
	}
	dfs(1, 1);
	if(ans == 1) printf("0");
	else printf("%d", (ans + 1) / 2);
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	33 ms	35840 KB	Output is correct
2	Correct	35 ms	35836 KB	Output is correct
3	Correct	34 ms	35840 KB	Output is correct
4	Correct	35 ms	35840 KB	Output is correct
5	Correct	37 ms	35832 KB	Output is correct
6	Correct	38 ms	35704 KB	Output is correct
7	Correct	36 ms	35704 KB	Output is correct
8	Correct	39 ms	35832 KB	Output is correct
9	Correct	45 ms	35704 KB	Output is correct
10	Correct	37 ms	35704 KB	Output is correct
11	Correct	42 ms	35832 KB	Output is correct
12	Correct	45 ms	35704 KB	Output is correct
13	Correct	39 ms	35960 KB	Output is correct
14	Correct	33 ms	35704 KB	Output is correct
15	Correct	32 ms	35840 KB	Output is correct
16	Correct	36 ms	35576 KB	Output is correct
17	Correct	34 ms	35716 KB	Output is correct
18	Correct	36 ms	35708 KB	Output is correct
19	Correct	35 ms	35712 KB	Output is correct
20	Correct	35 ms	35832 KB	Output is correct
21	Correct	41 ms	35832 KB	Output is correct
22	Correct	34 ms	35832 KB	Output is correct
23	Correct	34 ms	35712 KB	Output is correct
24	Correct	41 ms	35832 KB	Output is correct

Subtask #2
24.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	33 ms	35840 KB	Output is correct
2	Correct	35 ms	35836 KB	Output is correct
3	Correct	34 ms	35840 KB	Output is correct
4	Correct	35 ms	35840 KB	Output is correct
5	Correct	37 ms	35832 KB	Output is correct
6	Correct	38 ms	35704 KB	Output is correct
7	Correct	36 ms	35704 KB	Output is correct
8	Correct	39 ms	35832 KB	Output is correct
9	Correct	45 ms	35704 KB	Output is correct
10	Correct	37 ms	35704 KB	Output is correct
11	Correct	42 ms	35832 KB	Output is correct
12	Correct	45 ms	35704 KB	Output is correct
13	Correct	39 ms	35960 KB	Output is correct
14	Correct	33 ms	35704 KB	Output is correct
15	Correct	32 ms	35840 KB	Output is correct
16	Correct	36 ms	35576 KB	Output is correct
17	Correct	34 ms	35716 KB	Output is correct
18	Correct	36 ms	35708 KB	Output is correct
19	Correct	35 ms	35712 KB	Output is correct
20	Correct	35 ms	35832 KB	Output is correct
21	Correct	41 ms	35832 KB	Output is correct
22	Correct	34 ms	35832 KB	Output is correct
23	Correct	34 ms	35712 KB	Output is correct
24	Correct	41 ms	35832 KB	Output is correct
25	Correct	34 ms	35832 KB	Output is correct
26	Correct	40 ms	36500 KB	Output is correct
27	Correct	39 ms	36216 KB	Output is correct
28	Correct	40 ms	36624 KB	Output is correct
29	Correct	39 ms	36600 KB	Output is correct
30	Correct	40 ms	36232 KB	Output is correct
31	Correct	41 ms	35832 KB	Output is correct
32	Correct	36 ms	36480 KB	Output is correct
33	Correct	41 ms	35840 KB	Output is correct
34	Correct	40 ms	36216 KB	Output is correct
35	Correct	42 ms	36604 KB	Output is correct
36	Correct	36 ms	36216 KB	Output is correct
37	Correct	38 ms	36344 KB	Output is correct
38	Correct	38 ms	35712 KB	Output is correct
39	Correct	40 ms	36216 KB	Output is correct
40	Correct	36 ms	36196 KB	Output is correct
41	Correct	36 ms	36216 KB	Output is correct
42	Correct	37 ms	36388 KB	Output is correct
43	Correct	36 ms	36352 KB	Output is correct
44	Correct	33 ms	35812 KB	Output is correct
45	Correct	37 ms	36344 KB	Output is correct
46	Correct	35 ms	36196 KB	Output is correct
47	Correct	37 ms	35836 KB	Output is correct
48	Correct	38 ms	36316 KB	Output is correct
49	Correct	37 ms	36728 KB	Output is correct
50	Correct	39 ms	36700 KB	Output is correct
51	Correct	37 ms	36224 KB	Output is correct
52	Correct	37 ms	36188 KB	Output is correct
53	Correct	36 ms	36352 KB	Output is correct
54	Correct	34 ms	36216 KB	Output is correct

Subtask #3
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	33 ms	35840 KB	Output is correct
2	Correct	35 ms	35836 KB	Output is correct
3	Correct	34 ms	35840 KB	Output is correct
4	Correct	35 ms	35840 KB	Output is correct
5	Correct	37 ms	35832 KB	Output is correct
6	Correct	38 ms	35704 KB	Output is correct
7	Correct	36 ms	35704 KB	Output is correct
8	Correct	39 ms	35832 KB	Output is correct
9	Correct	45 ms	35704 KB	Output is correct
10	Correct	37 ms	35704 KB	Output is correct
11	Correct	42 ms	35832 KB	Output is correct
12	Correct	45 ms	35704 KB	Output is correct
13	Correct	39 ms	35960 KB	Output is correct
14	Correct	33 ms	35704 KB	Output is correct
15	Correct	32 ms	35840 KB	Output is correct
16	Correct	36 ms	35576 KB	Output is correct
17	Correct	34 ms	35716 KB	Output is correct
18	Correct	36 ms	35708 KB	Output is correct
19	Correct	35 ms	35712 KB	Output is correct
20	Correct	35 ms	35832 KB	Output is correct
21	Correct	41 ms	35832 KB	Output is correct
22	Correct	34 ms	35832 KB	Output is correct
23	Correct	34 ms	35712 KB	Output is correct
24	Correct	41 ms	35832 KB	Output is correct
25	Correct	33 ms	35820 KB	Output is correct
26	Correct	291 ms	49156 KB	Output is correct
27	Correct	233 ms	49012 KB	Output is correct
28	Correct	38 ms	36216 KB	Output is correct
29	Correct	35 ms	35832 KB	Output is correct
30	Correct	41 ms	35840 KB	Output is correct
31	Correct	302 ms	49252 KB	Output is correct
32	Correct	36 ms	36216 KB	Output is correct
33	Correct	157 ms	54180 KB	Output is correct
34	Correct	318 ms	48924 KB	Output is correct
35	Correct	39 ms	36220 KB	Output is correct
36	Correct	286 ms	49188 KB	Output is correct
37	Correct	34 ms	36096 KB	Output is correct
38	Correct	42 ms	36224 KB	Output is correct
39	Correct	307 ms	49124 KB	Output is correct
40	Correct	37 ms	36344 KB	Output is correct
41	Correct	137 ms	48840 KB	Output is correct
42	Correct	250 ms	50380 KB	Output is correct
43	Correct	38 ms	35832 KB	Output is correct
44	Correct	144 ms	54484 KB	Output is correct
45	Correct	147 ms	51848 KB	Output is correct
46	Correct	36 ms	36216 KB	Output is correct
47	Correct	38 ms	36216 KB	Output is correct

Subtask #4
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	301 ms	49196 KB	Output is correct
2	Correct	290 ms	64512 KB	Output is correct
3	Correct	39 ms	36444 KB	Output is correct
4	Correct	39 ms	36216 KB	Output is correct
5	Correct	35 ms	35704 KB	Output is correct
6	Correct	33 ms	35832 KB	Output is correct
7	Correct	37 ms	36216 KB	Output is correct
8	Correct	478 ms	52112 KB	Output is correct
9	Correct	38 ms	36344 KB	Output is correct
10	Correct	405 ms	49404 KB	Output is correct
11	Correct	40 ms	35832 KB	Output is correct
12	Correct	395 ms	49116 KB	Output is correct
13	Correct	444 ms	53160 KB	Output is correct
14	Correct	412 ms	64160 KB	Output is correct
15	Correct	320 ms	49148 KB	Output is correct
16	Correct	43 ms	36400 KB	Output is correct
17	Correct	35 ms	35840 KB	Output is correct
18	Correct	329 ms	62308 KB	Output is correct
19	Correct	430 ms	68176 KB	Output is correct
20	Correct	43 ms	36224 KB	Output is correct
21	Correct	35 ms	35704 KB	Output is correct
22	Correct	339 ms	53188 KB	Output is correct
23	Correct	36 ms	36216 KB	Output is correct
24	Correct	379 ms	50564 KB	Output is correct
25	Correct	385 ms	66084 KB	Output is correct
26	Correct	35 ms	36604 KB	Output is correct
27	Correct	41 ms	36728 KB	Output is correct
28	Correct	41 ms	36232 KB	Output is correct
29	Correct	36 ms	36216 KB	Output is correct
30	Correct	38 ms	36344 KB	Output is correct

Subtask #5
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	33 ms	35840 KB	Output is correct
2	Correct	35 ms	35836 KB	Output is correct
3	Correct	34 ms	35840 KB	Output is correct
4	Correct	35 ms	35840 KB	Output is correct
5	Correct	37 ms	35832 KB	Output is correct
6	Correct	38 ms	35704 KB	Output is correct
7	Correct	36 ms	35704 KB	Output is correct
8	Correct	39 ms	35832 KB	Output is correct
9	Correct	45 ms	35704 KB	Output is correct
10	Correct	37 ms	35704 KB	Output is correct
11	Correct	42 ms	35832 KB	Output is correct
12	Correct	45 ms	35704 KB	Output is correct
13	Correct	39 ms	35960 KB	Output is correct
14	Correct	33 ms	35704 KB	Output is correct
15	Correct	32 ms	35840 KB	Output is correct
16	Correct	36 ms	35576 KB	Output is correct
17	Correct	34 ms	35716 KB	Output is correct
18	Correct	36 ms	35708 KB	Output is correct
19	Correct	35 ms	35712 KB	Output is correct
20	Correct	35 ms	35832 KB	Output is correct
21	Correct	41 ms	35832 KB	Output is correct
22	Correct	34 ms	35832 KB	Output is correct
23	Correct	34 ms	35712 KB	Output is correct
24	Correct	41 ms	35832 KB	Output is correct
25	Correct	34 ms	35832 KB	Output is correct
26	Correct	40 ms	36500 KB	Output is correct
27	Correct	39 ms	36216 KB	Output is correct
28	Correct	40 ms	36624 KB	Output is correct
29	Correct	39 ms	36600 KB	Output is correct
30	Correct	40 ms	36232 KB	Output is correct
31	Correct	41 ms	35832 KB	Output is correct
32	Correct	36 ms	36480 KB	Output is correct
33	Correct	41 ms	35840 KB	Output is correct
34	Correct	40 ms	36216 KB	Output is correct
35	Correct	42 ms	36604 KB	Output is correct
36	Correct	36 ms	36216 KB	Output is correct
37	Correct	38 ms	36344 KB	Output is correct
38	Correct	38 ms	35712 KB	Output is correct
39	Correct	40 ms	36216 KB	Output is correct
40	Correct	36 ms	36196 KB	Output is correct
41	Correct	36 ms	36216 KB	Output is correct
42	Correct	37 ms	36388 KB	Output is correct
43	Correct	36 ms	36352 KB	Output is correct
44	Correct	33 ms	35812 KB	Output is correct
45	Correct	37 ms	36344 KB	Output is correct
46	Correct	35 ms	36196 KB	Output is correct
47	Correct	37 ms	35836 KB	Output is correct
48	Correct	38 ms	36316 KB	Output is correct
49	Correct	37 ms	36728 KB	Output is correct
50	Correct	39 ms	36700 KB	Output is correct
51	Correct	37 ms	36224 KB	Output is correct
52	Correct	37 ms	36188 KB	Output is correct
53	Correct	36 ms	36352 KB	Output is correct
54	Correct	34 ms	36216 KB	Output is correct
55	Correct	33 ms	35820 KB	Output is correct
56	Correct	291 ms	49156 KB	Output is correct
57	Correct	233 ms	49012 KB	Output is correct
58	Correct	38 ms	36216 KB	Output is correct
59	Correct	35 ms	35832 KB	Output is correct
60	Correct	41 ms	35840 KB	Output is correct
61	Correct	302 ms	49252 KB	Output is correct
62	Correct	36 ms	36216 KB	Output is correct
63	Correct	157 ms	54180 KB	Output is correct
64	Correct	318 ms	48924 KB	Output is correct
65	Correct	39 ms	36220 KB	Output is correct
66	Correct	286 ms	49188 KB	Output is correct
67	Correct	34 ms	36096 KB	Output is correct
68	Correct	42 ms	36224 KB	Output is correct
69	Correct	307 ms	49124 KB	Output is correct
70	Correct	37 ms	36344 KB	Output is correct
71	Correct	137 ms	48840 KB	Output is correct
72	Correct	250 ms	50380 KB	Output is correct
73	Correct	38 ms	35832 KB	Output is correct
74	Correct	144 ms	54484 KB	Output is correct
75	Correct	147 ms	51848 KB	Output is correct
76	Correct	36 ms	36216 KB	Output is correct
77	Correct	38 ms	36216 KB	Output is correct
78	Correct	301 ms	49196 KB	Output is correct
79	Correct	290 ms	64512 KB	Output is correct
80	Correct	39 ms	36444 KB	Output is correct
81	Correct	39 ms	36216 KB	Output is correct
82	Correct	35 ms	35704 KB	Output is correct
83	Correct	33 ms	35832 KB	Output is correct
84	Correct	37 ms	36216 KB	Output is correct
85	Correct	478 ms	52112 KB	Output is correct
86	Correct	38 ms	36344 KB	Output is correct
87	Correct	405 ms	49404 KB	Output is correct
88	Correct	40 ms	35832 KB	Output is correct
89	Correct	395 ms	49116 KB	Output is correct
90	Correct	444 ms	53160 KB	Output is correct
91	Correct	412 ms	64160 KB	Output is correct
92	Correct	320 ms	49148 KB	Output is correct
93	Correct	43 ms	36400 KB	Output is correct
94	Correct	35 ms	35840 KB	Output is correct
95	Correct	329 ms	62308 KB	Output is correct
96	Correct	430 ms	68176 KB	Output is correct
97	Correct	43 ms	36224 KB	Output is correct
98	Correct	35 ms	35704 KB	Output is correct
99	Correct	339 ms	53188 KB	Output is correct
100	Correct	36 ms	36216 KB	Output is correct
101	Correct	379 ms	50564 KB	Output is correct
102	Correct	385 ms	66084 KB	Output is correct
103	Correct	35 ms	36604 KB	Output is correct
104	Correct	41 ms	36728 KB	Output is correct
105	Correct	41 ms	36232 KB	Output is correct
106	Correct	36 ms	36216 KB	Output is correct
107	Correct	38 ms	36344 KB	Output is correct
108	Correct	2320 ms	114524 KB	Output is correct
109	Correct	1370 ms	113348 KB	Output is correct
110	Correct	854 ms	122340 KB	Output is correct
111	Incorrect	1027 ms	136824 KB	Output isn't correct
112	Halted	0 ms	0 KB	-

답안 #102397

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 24.0 / 24.0

Subtask #3 14.0 / 14.0

Subtask #4 22.0 / 22.0

Subtask #5 0 / 30.0

Subtask #1
10.0 / 10.0

Subtask #2
24.0 / 24.0

Subtask #3
14.0 / 14.0

Subtask #4
22.0 / 22.0

Subtask #5
0 / 30.0