답안 #102396

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
102396	2019-03-24T16:15:20 Z	Dat160601	Mergers (JOI19_mergers)	C++17	70 / 100	3000 ms	202888 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);
	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	35 ms	35704 KB	Output is correct
2	Correct	35 ms	35712 KB	Output is correct
3	Correct	35 ms	35960 KB	Output is correct
4	Correct	36 ms	35840 KB	Output is correct
5	Correct	33 ms	35704 KB	Output is correct
6	Correct	36 ms	35832 KB	Output is correct
7	Correct	36 ms	35704 KB	Output is correct
8	Correct	34 ms	35836 KB	Output is correct
9	Correct	37 ms	35704 KB	Output is correct
10	Correct	35 ms	35704 KB	Output is correct
11	Correct	34 ms	35704 KB	Output is correct
12	Correct	36 ms	35716 KB	Output is correct
13	Correct	41 ms	35832 KB	Output is correct
14	Correct	34 ms	35840 KB	Output is correct
15	Correct	37 ms	35832 KB	Output is correct
16	Correct	36 ms	35788 KB	Output is correct
17	Correct	39 ms	35912 KB	Output is correct
18	Correct	32 ms	35840 KB	Output is correct
19	Correct	38 ms	35832 KB	Output is correct
20	Correct	33 ms	35704 KB	Output is correct
21	Correct	35 ms	35832 KB	Output is correct
22	Correct	37 ms	35832 KB	Output is correct
23	Correct	35 ms	35704 KB	Output is correct
24	Correct	36 ms	35712 KB	Output is correct

Subtask #2
24.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	35 ms	35704 KB	Output is correct
2	Correct	35 ms	35712 KB	Output is correct
3	Correct	35 ms	35960 KB	Output is correct
4	Correct	36 ms	35840 KB	Output is correct
5	Correct	33 ms	35704 KB	Output is correct
6	Correct	36 ms	35832 KB	Output is correct
7	Correct	36 ms	35704 KB	Output is correct
8	Correct	34 ms	35836 KB	Output is correct
9	Correct	37 ms	35704 KB	Output is correct
10	Correct	35 ms	35704 KB	Output is correct
11	Correct	34 ms	35704 KB	Output is correct
12	Correct	36 ms	35716 KB	Output is correct
13	Correct	41 ms	35832 KB	Output is correct
14	Correct	34 ms	35840 KB	Output is correct
15	Correct	37 ms	35832 KB	Output is correct
16	Correct	36 ms	35788 KB	Output is correct
17	Correct	39 ms	35912 KB	Output is correct
18	Correct	32 ms	35840 KB	Output is correct
19	Correct	38 ms	35832 KB	Output is correct
20	Correct	33 ms	35704 KB	Output is correct
21	Correct	35 ms	35832 KB	Output is correct
22	Correct	37 ms	35832 KB	Output is correct
23	Correct	35 ms	35704 KB	Output is correct
24	Correct	36 ms	35712 KB	Output is correct
25	Correct	37 ms	35712 KB	Output is correct
26	Correct	43 ms	36392 KB	Output is correct
27	Correct	40 ms	36176 KB	Output is correct
28	Correct	40 ms	36572 KB	Output is correct
29	Correct	42 ms	36600 KB	Output is correct
30	Correct	39 ms	36152 KB	Output is correct
31	Correct	35 ms	35796 KB	Output is correct
32	Correct	37 ms	36600 KB	Output is correct
33	Correct	36 ms	35832 KB	Output is correct
34	Correct	44 ms	36216 KB	Output is correct
35	Correct	43 ms	36600 KB	Output is correct
36	Correct	37 ms	36216 KB	Output is correct
37	Correct	39 ms	36196 KB	Output is correct
38	Correct	37 ms	35832 KB	Output is correct
39	Correct	38 ms	36324 KB	Output is correct
40	Correct	38 ms	36128 KB	Output is correct
41	Correct	37 ms	36224 KB	Output is correct
42	Correct	39 ms	36352 KB	Output is correct
43	Correct	40 ms	36352 KB	Output is correct
44	Correct	37 ms	35832 KB	Output is correct
45	Correct	37 ms	36324 KB	Output is correct
46	Correct	39 ms	36216 KB	Output is correct
47	Correct	36 ms	35960 KB	Output is correct
48	Correct	36 ms	36216 KB	Output is correct
49	Correct	35 ms	36728 KB	Output is correct
50	Correct	45 ms	36704 KB	Output is correct
51	Correct	39 ms	36216 KB	Output is correct
52	Correct	38 ms	36216 KB	Output is correct
53	Correct	43 ms	36344 KB	Output is correct
54	Correct	39 ms	36224 KB	Output is correct

Subtask #3
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	35 ms	35704 KB	Output is correct
2	Correct	35 ms	35712 KB	Output is correct
3	Correct	35 ms	35960 KB	Output is correct
4	Correct	36 ms	35840 KB	Output is correct
5	Correct	33 ms	35704 KB	Output is correct
6	Correct	36 ms	35832 KB	Output is correct
7	Correct	36 ms	35704 KB	Output is correct
8	Correct	34 ms	35836 KB	Output is correct
9	Correct	37 ms	35704 KB	Output is correct
10	Correct	35 ms	35704 KB	Output is correct
11	Correct	34 ms	35704 KB	Output is correct
12	Correct	36 ms	35716 KB	Output is correct
13	Correct	41 ms	35832 KB	Output is correct
14	Correct	34 ms	35840 KB	Output is correct
15	Correct	37 ms	35832 KB	Output is correct
16	Correct	36 ms	35788 KB	Output is correct
17	Correct	39 ms	35912 KB	Output is correct
18	Correct	32 ms	35840 KB	Output is correct
19	Correct	38 ms	35832 KB	Output is correct
20	Correct	33 ms	35704 KB	Output is correct
21	Correct	35 ms	35832 KB	Output is correct
22	Correct	37 ms	35832 KB	Output is correct
23	Correct	35 ms	35704 KB	Output is correct
24	Correct	36 ms	35712 KB	Output is correct
25	Correct	40 ms	35704 KB	Output is correct
26	Correct	326 ms	49144 KB	Output is correct
27	Correct	315 ms	49144 KB	Output is correct
28	Correct	37 ms	36352 KB	Output is correct
29	Correct	36 ms	35704 KB	Output is correct
30	Correct	36 ms	35704 KB	Output is correct
31	Correct	353 ms	49052 KB	Output is correct
32	Correct	37 ms	36216 KB	Output is correct
33	Correct	172 ms	54324 KB	Output is correct
34	Correct	333 ms	48920 KB	Output is correct
35	Correct	45 ms	36216 KB	Output is correct
36	Correct	324 ms	49272 KB	Output is correct
37	Correct	41 ms	36224 KB	Output is correct
38	Correct	39 ms	36216 KB	Output is correct
39	Correct	314 ms	49148 KB	Output is correct
40	Correct	39 ms	36344 KB	Output is correct
41	Correct	180 ms	48832 KB	Output is correct
42	Correct	252 ms	50524 KB	Output is correct
43	Correct	35 ms	35704 KB	Output is correct
44	Correct	156 ms	54560 KB	Output is correct
45	Correct	171 ms	51848 KB	Output is correct
46	Correct	41 ms	36224 KB	Output is correct
47	Correct	47 ms	36244 KB	Output is correct

Subtask #4
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	294 ms	49204 KB	Output is correct
2	Correct	328 ms	64644 KB	Output is correct
3	Correct	44 ms	36604 KB	Output is correct
4	Correct	39 ms	36224 KB	Output is correct
5	Correct	37 ms	35832 KB	Output is correct
6	Correct	38 ms	35712 KB	Output is correct
7	Correct	43 ms	36216 KB	Output is correct
8	Correct	448 ms	52072 KB	Output is correct
9	Correct	44 ms	36216 KB	Output is correct
10	Correct	372 ms	49532 KB	Output is correct
11	Correct	34 ms	35840 KB	Output is correct
12	Correct	361 ms	48996 KB	Output is correct
13	Correct	460 ms	53016 KB	Output is correct
14	Correct	406 ms	64152 KB	Output is correct
15	Correct	326 ms	49148 KB	Output is correct
16	Correct	40 ms	36216 KB	Output is correct
17	Correct	36 ms	35840 KB	Output is correct
18	Correct	351 ms	62392 KB	Output is correct
19	Correct	460 ms	67960 KB	Output is correct
20	Correct	44 ms	36216 KB	Output is correct
21	Correct	35 ms	35832 KB	Output is correct
22	Correct	354 ms	53152 KB	Output is correct
23	Correct	41 ms	36216 KB	Output is correct
24	Correct	417 ms	50680 KB	Output is correct
25	Correct	394 ms	66104 KB	Output is correct
26	Correct	39 ms	36728 KB	Output is correct
27	Correct	40 ms	36728 KB	Output is correct
28	Correct	36 ms	36188 KB	Output is correct
29	Correct	41 ms	36216 KB	Output is correct
30	Correct	37 ms	36344 KB	Output is correct

Subtask #5
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	35 ms	35704 KB	Output is correct
2	Correct	35 ms	35712 KB	Output is correct
3	Correct	35 ms	35960 KB	Output is correct
4	Correct	36 ms	35840 KB	Output is correct
5	Correct	33 ms	35704 KB	Output is correct
6	Correct	36 ms	35832 KB	Output is correct
7	Correct	36 ms	35704 KB	Output is correct
8	Correct	34 ms	35836 KB	Output is correct
9	Correct	37 ms	35704 KB	Output is correct
10	Correct	35 ms	35704 KB	Output is correct
11	Correct	34 ms	35704 KB	Output is correct
12	Correct	36 ms	35716 KB	Output is correct
13	Correct	41 ms	35832 KB	Output is correct
14	Correct	34 ms	35840 KB	Output is correct
15	Correct	37 ms	35832 KB	Output is correct
16	Correct	36 ms	35788 KB	Output is correct
17	Correct	39 ms	35912 KB	Output is correct
18	Correct	32 ms	35840 KB	Output is correct
19	Correct	38 ms	35832 KB	Output is correct
20	Correct	33 ms	35704 KB	Output is correct
21	Correct	35 ms	35832 KB	Output is correct
22	Correct	37 ms	35832 KB	Output is correct
23	Correct	35 ms	35704 KB	Output is correct
24	Correct	36 ms	35712 KB	Output is correct
25	Correct	37 ms	35712 KB	Output is correct
26	Correct	43 ms	36392 KB	Output is correct
27	Correct	40 ms	36176 KB	Output is correct
28	Correct	40 ms	36572 KB	Output is correct
29	Correct	42 ms	36600 KB	Output is correct
30	Correct	39 ms	36152 KB	Output is correct
31	Correct	35 ms	35796 KB	Output is correct
32	Correct	37 ms	36600 KB	Output is correct
33	Correct	36 ms	35832 KB	Output is correct
34	Correct	44 ms	36216 KB	Output is correct
35	Correct	43 ms	36600 KB	Output is correct
36	Correct	37 ms	36216 KB	Output is correct
37	Correct	39 ms	36196 KB	Output is correct
38	Correct	37 ms	35832 KB	Output is correct
39	Correct	38 ms	36324 KB	Output is correct
40	Correct	38 ms	36128 KB	Output is correct
41	Correct	37 ms	36224 KB	Output is correct
42	Correct	39 ms	36352 KB	Output is correct
43	Correct	40 ms	36352 KB	Output is correct
44	Correct	37 ms	35832 KB	Output is correct
45	Correct	37 ms	36324 KB	Output is correct
46	Correct	39 ms	36216 KB	Output is correct
47	Correct	36 ms	35960 KB	Output is correct
48	Correct	36 ms	36216 KB	Output is correct
49	Correct	35 ms	36728 KB	Output is correct
50	Correct	45 ms	36704 KB	Output is correct
51	Correct	39 ms	36216 KB	Output is correct
52	Correct	38 ms	36216 KB	Output is correct
53	Correct	43 ms	36344 KB	Output is correct
54	Correct	39 ms	36224 KB	Output is correct
55	Correct	40 ms	35704 KB	Output is correct
56	Correct	326 ms	49144 KB	Output is correct
57	Correct	315 ms	49144 KB	Output is correct
58	Correct	37 ms	36352 KB	Output is correct
59	Correct	36 ms	35704 KB	Output is correct
60	Correct	36 ms	35704 KB	Output is correct
61	Correct	353 ms	49052 KB	Output is correct
62	Correct	37 ms	36216 KB	Output is correct
63	Correct	172 ms	54324 KB	Output is correct
64	Correct	333 ms	48920 KB	Output is correct
65	Correct	45 ms	36216 KB	Output is correct
66	Correct	324 ms	49272 KB	Output is correct
67	Correct	41 ms	36224 KB	Output is correct
68	Correct	39 ms	36216 KB	Output is correct
69	Correct	314 ms	49148 KB	Output is correct
70	Correct	39 ms	36344 KB	Output is correct
71	Correct	180 ms	48832 KB	Output is correct
72	Correct	252 ms	50524 KB	Output is correct
73	Correct	35 ms	35704 KB	Output is correct
74	Correct	156 ms	54560 KB	Output is correct
75	Correct	171 ms	51848 KB	Output is correct
76	Correct	41 ms	36224 KB	Output is correct
77	Correct	47 ms	36244 KB	Output is correct
78	Correct	294 ms	49204 KB	Output is correct
79	Correct	328 ms	64644 KB	Output is correct
80	Correct	44 ms	36604 KB	Output is correct
81	Correct	39 ms	36224 KB	Output is correct
82	Correct	37 ms	35832 KB	Output is correct
83	Correct	38 ms	35712 KB	Output is correct
84	Correct	43 ms	36216 KB	Output is correct
85	Correct	448 ms	52072 KB	Output is correct
86	Correct	44 ms	36216 KB	Output is correct
87	Correct	372 ms	49532 KB	Output is correct
88	Correct	34 ms	35840 KB	Output is correct
89	Correct	361 ms	48996 KB	Output is correct
90	Correct	460 ms	53016 KB	Output is correct
91	Correct	406 ms	64152 KB	Output is correct
92	Correct	326 ms	49148 KB	Output is correct
93	Correct	40 ms	36216 KB	Output is correct
94	Correct	36 ms	35840 KB	Output is correct
95	Correct	351 ms	62392 KB	Output is correct
96	Correct	460 ms	67960 KB	Output is correct
97	Correct	44 ms	36216 KB	Output is correct
98	Correct	35 ms	35832 KB	Output is correct
99	Correct	354 ms	53152 KB	Output is correct
100	Correct	41 ms	36216 KB	Output is correct
101	Correct	417 ms	50680 KB	Output is correct
102	Correct	394 ms	66104 KB	Output is correct
103	Correct	39 ms	36728 KB	Output is correct
104	Correct	40 ms	36728 KB	Output is correct
105	Correct	36 ms	36188 KB	Output is correct
106	Correct	41 ms	36216 KB	Output is correct
107	Correct	37 ms	36344 KB	Output is correct
108	Correct	2461 ms	114512 KB	Output is correct
109	Correct	1522 ms	113304 KB	Output is correct
110	Correct	938 ms	122316 KB	Output is correct
111	Execution timed out	3026 ms	202888 KB	Time limit exceeded
112	Halted	0 ms	0 KB	-

답안 #102396

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