답안 #138137

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
138137 2019-07-29T12:02:08 Z Mahmoud_Adel Mergers (JOI19_mergers) C++14
70 / 100
693 ms 188008 KB
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
typedef long long ll;
const int N = 5e5+5;
int n, m, ans, cur, s[N], dep[N], sp[N][20], sub[N], ret[N], mark[N], deg[N];
vector<int> adj[N], vec[N];
void pre(int u, int p)
{
	sub[u] = 1;
	dep[u] = dep[p]+1;
	sp[u][0] = p;
	for(int i=1; i<20; i++) sp[u][i] = sp[sp[u][i-1]][i-1];
	for(int v : adj[u]) if(v != p) pre(v, u), sub[u] += sub[v];	
}
int equate(int u, int v)
{
	int c = dep[u]-dep[v];
	for(int i=0; i<20; i++) if(c & (1<<i)) u = sp[u][i];
	return u;
}
int LCA(int u, int v)
{
	if(dep[u] < dep[v]) swap(u, v);
	u = equate(u, v);
	if(u == v) return u;
	for(int i=19; i>=0; i--) if(sp[u][i] != sp[v][i]) u = sp[u][i], v = sp[v][i];
	return sp[u][0];
}
void calc(int u, int p)
{
	for(auto v : adj[u]) if(v != p) calc(v, u), ret[u] += ret[v];
	if(ret[u] == sub[u]) mark[u] = 1;
}
void DFS(int u, int p, int last)
{
	for(int v : adj[u]) if(p != v)
	{
		if(mark[v]) deg[v]++, deg[last]++, DFS(v, u, v);
		else DFS(v, u, last);
	}
}
int main()
{
	scanf("%d %d", &n, &m);
	memset(sp, -1, sizeof sp);
	for(int i=1, a, b; i<n; i++) scanf("%d %d", &a, &b),
	adj[a].push_back(b), adj[b].push_back(a);
	for(int i=1; i<=n; i++) scanf("%d", &s[i]), vec[s[i]].push_back(i);
	pre(1, 0);
	for(int i=1; i<=m; i++) 
	{
		if(vec[i].empty()) continue;
		int node = vec[i][0];
		for(auto u : vec[i]) node = LCA(node, u);
		ret[node] += (int)vec[i].size();
		assert(node > 0);
	}
	calc(1, 0);
	DFS(1, 0, 1);
	for(int i=1; i<=n; i++) ans += (deg[i]==1);
	cout << (ans+1)/2 << endl;
}

Compilation message

mergers.cpp: In function 'int main()':
mergers.cpp:46:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~~
mergers.cpp:49:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1, a, b; i<n; i++) scanf("%d %d", &a, &b),
                               ~~~~~~~~~~~~~~~~~~~~~~~~
  adj[a].push_back(b), adj[b].push_back(a);
  ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
mergers.cpp:50:44: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1; i<=n; i++) scanf("%d", &s[i]), vec[s[i]].push_back(i);
                          ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 62968 KB Output is correct
2 Correct 68 ms 62968 KB Output is correct
3 Correct 70 ms 62968 KB Output is correct
4 Correct 69 ms 63008 KB Output is correct
5 Correct 71 ms 63096 KB Output is correct
6 Correct 68 ms 62968 KB Output is correct
7 Correct 67 ms 63000 KB Output is correct
8 Correct 68 ms 62972 KB Output is correct
9 Correct 69 ms 62928 KB Output is correct
10 Correct 70 ms 63068 KB Output is correct
11 Correct 70 ms 62968 KB Output is correct
12 Correct 68 ms 62940 KB Output is correct
13 Correct 69 ms 62968 KB Output is correct
14 Correct 68 ms 62968 KB Output is correct
15 Correct 69 ms 62972 KB Output is correct
16 Correct 57 ms 63044 KB Output is correct
17 Correct 57 ms 62968 KB Output is correct
18 Correct 70 ms 62968 KB Output is correct
19 Correct 64 ms 63096 KB Output is correct
20 Correct 57 ms 63096 KB Output is correct
21 Correct 69 ms 62968 KB Output is correct
22 Correct 69 ms 62968 KB Output is correct
23 Correct 70 ms 63096 KB Output is correct
24 Correct 55 ms 62968 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 62968 KB Output is correct
2 Correct 68 ms 62968 KB Output is correct
3 Correct 70 ms 62968 KB Output is correct
4 Correct 69 ms 63008 KB Output is correct
5 Correct 71 ms 63096 KB Output is correct
6 Correct 68 ms 62968 KB Output is correct
7 Correct 67 ms 63000 KB Output is correct
8 Correct 68 ms 62972 KB Output is correct
9 Correct 69 ms 62928 KB Output is correct
10 Correct 70 ms 63068 KB Output is correct
11 Correct 70 ms 62968 KB Output is correct
12 Correct 68 ms 62940 KB Output is correct
13 Correct 69 ms 62968 KB Output is correct
14 Correct 68 ms 62968 KB Output is correct
15 Correct 69 ms 62972 KB Output is correct
16 Correct 57 ms 63044 KB Output is correct
17 Correct 57 ms 62968 KB Output is correct
18 Correct 70 ms 62968 KB Output is correct
19 Correct 64 ms 63096 KB Output is correct
20 Correct 57 ms 63096 KB Output is correct
21 Correct 69 ms 62968 KB Output is correct
22 Correct 69 ms 62968 KB Output is correct
23 Correct 70 ms 63096 KB Output is correct
24 Correct 55 ms 62968 KB Output is correct
25 Correct 60 ms 62932 KB Output is correct
26 Correct 58 ms 63224 KB Output is correct
27 Correct 59 ms 63196 KB Output is correct
28 Correct 61 ms 63352 KB Output is correct
29 Correct 59 ms 63224 KB Output is correct
30 Correct 59 ms 63096 KB Output is correct
31 Correct 57 ms 62968 KB Output is correct
32 Correct 59 ms 63328 KB Output is correct
33 Correct 56 ms 62968 KB Output is correct
34 Correct 58 ms 63156 KB Output is correct
35 Correct 58 ms 63224 KB Output is correct
36 Correct 59 ms 63224 KB Output is correct
37 Correct 63 ms 63240 KB Output is correct
38 Correct 57 ms 62968 KB Output is correct
39 Correct 60 ms 63224 KB Output is correct
40 Correct 59 ms 63096 KB Output is correct
41 Correct 59 ms 63096 KB Output is correct
42 Correct 59 ms 63224 KB Output is correct
43 Correct 59 ms 63324 KB Output is correct
44 Correct 56 ms 62968 KB Output is correct
45 Correct 61 ms 63352 KB Output is correct
46 Correct 59 ms 63248 KB Output is correct
47 Correct 56 ms 62972 KB Output is correct
48 Correct 65 ms 63224 KB Output is correct
49 Correct 72 ms 63224 KB Output is correct
50 Correct 71 ms 63224 KB Output is correct
51 Correct 59 ms 63228 KB Output is correct
52 Correct 58 ms 63096 KB Output is correct
53 Correct 58 ms 63224 KB Output is correct
54 Correct 58 ms 63196 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 62968 KB Output is correct
2 Correct 68 ms 62968 KB Output is correct
3 Correct 70 ms 62968 KB Output is correct
4 Correct 69 ms 63008 KB Output is correct
5 Correct 71 ms 63096 KB Output is correct
6 Correct 68 ms 62968 KB Output is correct
7 Correct 67 ms 63000 KB Output is correct
8 Correct 68 ms 62972 KB Output is correct
9 Correct 69 ms 62928 KB Output is correct
10 Correct 70 ms 63068 KB Output is correct
11 Correct 70 ms 62968 KB Output is correct
12 Correct 68 ms 62940 KB Output is correct
13 Correct 69 ms 62968 KB Output is correct
14 Correct 68 ms 62968 KB Output is correct
15 Correct 69 ms 62972 KB Output is correct
16 Correct 57 ms 63044 KB Output is correct
17 Correct 57 ms 62968 KB Output is correct
18 Correct 70 ms 62968 KB Output is correct
19 Correct 64 ms 63096 KB Output is correct
20 Correct 57 ms 63096 KB Output is correct
21 Correct 69 ms 62968 KB Output is correct
22 Correct 69 ms 62968 KB Output is correct
23 Correct 70 ms 63096 KB Output is correct
24 Correct 55 ms 62968 KB Output is correct
25 Correct 56 ms 62968 KB Output is correct
26 Correct 142 ms 68356 KB Output is correct
27 Correct 182 ms 68352 KB Output is correct
28 Correct 59 ms 63228 KB Output is correct
29 Correct 57 ms 62968 KB Output is correct
30 Correct 56 ms 62968 KB Output is correct
31 Correct 224 ms 68728 KB Output is correct
32 Correct 59 ms 63100 KB Output is correct
33 Correct 246 ms 74104 KB Output is correct
34 Correct 243 ms 68348 KB Output is correct
35 Correct 59 ms 63224 KB Output is correct
36 Correct 211 ms 69108 KB Output is correct
37 Correct 59 ms 63224 KB Output is correct
38 Correct 59 ms 63224 KB Output is correct
39 Correct 145 ms 68180 KB Output is correct
40 Correct 59 ms 63480 KB Output is correct
41 Correct 179 ms 68400 KB Output is correct
42 Correct 218 ms 70140 KB Output is correct
43 Correct 56 ms 62968 KB Output is correct
44 Correct 227 ms 74228 KB Output is correct
45 Correct 206 ms 71288 KB Output is correct
46 Correct 58 ms 63196 KB Output is correct
47 Correct 58 ms 63224 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 139 ms 68204 KB Output is correct
2 Correct 172 ms 72048 KB Output is correct
3 Correct 59 ms 63224 KB Output is correct
4 Correct 59 ms 63224 KB Output is correct
5 Correct 56 ms 62968 KB Output is correct
6 Correct 57 ms 62968 KB Output is correct
7 Correct 59 ms 63224 KB Output is correct
8 Correct 202 ms 70236 KB Output is correct
9 Correct 60 ms 63224 KB Output is correct
10 Correct 178 ms 69212 KB Output is correct
11 Correct 57 ms 62968 KB Output is correct
12 Correct 216 ms 69056 KB Output is correct
13 Correct 235 ms 70136 KB Output is correct
14 Correct 199 ms 71652 KB Output is correct
15 Correct 165 ms 68236 KB Output is correct
16 Correct 58 ms 63192 KB Output is correct
17 Correct 57 ms 62968 KB Output is correct
18 Correct 172 ms 71660 KB Output is correct
19 Correct 235 ms 74872 KB Output is correct
20 Correct 61 ms 63196 KB Output is correct
21 Correct 57 ms 63068 KB Output is correct
22 Correct 165 ms 70416 KB Output is correct
23 Correct 59 ms 63228 KB Output is correct
24 Correct 212 ms 69468 KB Output is correct
25 Correct 221 ms 73848 KB Output is correct
26 Correct 58 ms 63224 KB Output is correct
27 Correct 76 ms 63324 KB Output is correct
28 Correct 59 ms 63224 KB Output is correct
29 Correct 64 ms 63212 KB Output is correct
30 Correct 59 ms 63224 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 62968 KB Output is correct
2 Correct 68 ms 62968 KB Output is correct
3 Correct 70 ms 62968 KB Output is correct
4 Correct 69 ms 63008 KB Output is correct
5 Correct 71 ms 63096 KB Output is correct
6 Correct 68 ms 62968 KB Output is correct
7 Correct 67 ms 63000 KB Output is correct
8 Correct 68 ms 62972 KB Output is correct
9 Correct 69 ms 62928 KB Output is correct
10 Correct 70 ms 63068 KB Output is correct
11 Correct 70 ms 62968 KB Output is correct
12 Correct 68 ms 62940 KB Output is correct
13 Correct 69 ms 62968 KB Output is correct
14 Correct 68 ms 62968 KB Output is correct
15 Correct 69 ms 62972 KB Output is correct
16 Correct 57 ms 63044 KB Output is correct
17 Correct 57 ms 62968 KB Output is correct
18 Correct 70 ms 62968 KB Output is correct
19 Correct 64 ms 63096 KB Output is correct
20 Correct 57 ms 63096 KB Output is correct
21 Correct 69 ms 62968 KB Output is correct
22 Correct 69 ms 62968 KB Output is correct
23 Correct 70 ms 63096 KB Output is correct
24 Correct 55 ms 62968 KB Output is correct
25 Correct 60 ms 62932 KB Output is correct
26 Correct 58 ms 63224 KB Output is correct
27 Correct 59 ms 63196 KB Output is correct
28 Correct 61 ms 63352 KB Output is correct
29 Correct 59 ms 63224 KB Output is correct
30 Correct 59 ms 63096 KB Output is correct
31 Correct 57 ms 62968 KB Output is correct
32 Correct 59 ms 63328 KB Output is correct
33 Correct 56 ms 62968 KB Output is correct
34 Correct 58 ms 63156 KB Output is correct
35 Correct 58 ms 63224 KB Output is correct
36 Correct 59 ms 63224 KB Output is correct
37 Correct 63 ms 63240 KB Output is correct
38 Correct 57 ms 62968 KB Output is correct
39 Correct 60 ms 63224 KB Output is correct
40 Correct 59 ms 63096 KB Output is correct
41 Correct 59 ms 63096 KB Output is correct
42 Correct 59 ms 63224 KB Output is correct
43 Correct 59 ms 63324 KB Output is correct
44 Correct 56 ms 62968 KB Output is correct
45 Correct 61 ms 63352 KB Output is correct
46 Correct 59 ms 63248 KB Output is correct
47 Correct 56 ms 62972 KB Output is correct
48 Correct 65 ms 63224 KB Output is correct
49 Correct 72 ms 63224 KB Output is correct
50 Correct 71 ms 63224 KB Output is correct
51 Correct 59 ms 63228 KB Output is correct
52 Correct 58 ms 63096 KB Output is correct
53 Correct 58 ms 63224 KB Output is correct
54 Correct 58 ms 63196 KB Output is correct
55 Correct 56 ms 62968 KB Output is correct
56 Correct 142 ms 68356 KB Output is correct
57 Correct 182 ms 68352 KB Output is correct
58 Correct 59 ms 63228 KB Output is correct
59 Correct 57 ms 62968 KB Output is correct
60 Correct 56 ms 62968 KB Output is correct
61 Correct 224 ms 68728 KB Output is correct
62 Correct 59 ms 63100 KB Output is correct
63 Correct 246 ms 74104 KB Output is correct
64 Correct 243 ms 68348 KB Output is correct
65 Correct 59 ms 63224 KB Output is correct
66 Correct 211 ms 69108 KB Output is correct
67 Correct 59 ms 63224 KB Output is correct
68 Correct 59 ms 63224 KB Output is correct
69 Correct 145 ms 68180 KB Output is correct
70 Correct 59 ms 63480 KB Output is correct
71 Correct 179 ms 68400 KB Output is correct
72 Correct 218 ms 70140 KB Output is correct
73 Correct 56 ms 62968 KB Output is correct
74 Correct 227 ms 74228 KB Output is correct
75 Correct 206 ms 71288 KB Output is correct
76 Correct 58 ms 63196 KB Output is correct
77 Correct 58 ms 63224 KB Output is correct
78 Correct 139 ms 68204 KB Output is correct
79 Correct 172 ms 72048 KB Output is correct
80 Correct 59 ms 63224 KB Output is correct
81 Correct 59 ms 63224 KB Output is correct
82 Correct 56 ms 62968 KB Output is correct
83 Correct 57 ms 62968 KB Output is correct
84 Correct 59 ms 63224 KB Output is correct
85 Correct 202 ms 70236 KB Output is correct
86 Correct 60 ms 63224 KB Output is correct
87 Correct 178 ms 69212 KB Output is correct
88 Correct 57 ms 62968 KB Output is correct
89 Correct 216 ms 69056 KB Output is correct
90 Correct 235 ms 70136 KB Output is correct
91 Correct 199 ms 71652 KB Output is correct
92 Correct 165 ms 68236 KB Output is correct
93 Correct 58 ms 63192 KB Output is correct
94 Correct 57 ms 62968 KB Output is correct
95 Correct 172 ms 71660 KB Output is correct
96 Correct 235 ms 74872 KB Output is correct
97 Correct 61 ms 63196 KB Output is correct
98 Correct 57 ms 63068 KB Output is correct
99 Correct 165 ms 70416 KB Output is correct
100 Correct 59 ms 63228 KB Output is correct
101 Correct 212 ms 69468 KB Output is correct
102 Correct 221 ms 73848 KB Output is correct
103 Correct 58 ms 63224 KB Output is correct
104 Correct 76 ms 63324 KB Output is correct
105 Correct 59 ms 63224 KB Output is correct
106 Correct 64 ms 63212 KB Output is correct
107 Correct 59 ms 63224 KB Output is correct
108 Runtime error 693 ms 188008 KB Execution killed with signal 11 (could be triggered by violating memory limits)
109 Halted 0 ms 0 KB -