답안 #138138

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
138138	2019-07-29T12:03:40 Z	Mahmoud_Adel	Mergers (JOI19_mergers)	C++14	70 / 100	1651 ms	127088 KB

mergers

#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][21], 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<21; 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<21; 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=20; 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();
	}
	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);
                          ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	57 ms	65016 KB	Output is correct
2	Correct	64 ms	64968 KB	Output is correct
3	Correct	62 ms	64888 KB	Output is correct
4	Correct	71 ms	64996 KB	Output is correct
5	Correct	61 ms	65012 KB	Output is correct
6	Correct	59 ms	65016 KB	Output is correct
7	Correct	60 ms	64888 KB	Output is correct
8	Correct	65 ms	65004 KB	Output is correct
9	Correct	58 ms	64888 KB	Output is correct
10	Correct	67 ms	65016 KB	Output is correct
11	Correct	63 ms	65020 KB	Output is correct
12	Correct	58 ms	64980 KB	Output is correct
13	Correct	58 ms	64888 KB	Output is correct
14	Correct	59 ms	65016 KB	Output is correct
15	Correct	59 ms	64932 KB	Output is correct
16	Correct	61 ms	64888 KB	Output is correct
17	Correct	63 ms	64888 KB	Output is correct
18	Correct	63 ms	64980 KB	Output is correct
19	Correct	57 ms	64884 KB	Output is correct
20	Correct	63 ms	65016 KB	Output is correct
21	Correct	58 ms	65056 KB	Output is correct
22	Correct	58 ms	64888 KB	Output is correct
23	Correct	64 ms	65008 KB	Output is correct
24	Correct	58 ms	65016 KB	Output is correct

Subtask #2
24.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	57 ms	65016 KB	Output is correct
2	Correct	64 ms	64968 KB	Output is correct
3	Correct	62 ms	64888 KB	Output is correct
4	Correct	71 ms	64996 KB	Output is correct
5	Correct	61 ms	65012 KB	Output is correct
6	Correct	59 ms	65016 KB	Output is correct
7	Correct	60 ms	64888 KB	Output is correct
8	Correct	65 ms	65004 KB	Output is correct
9	Correct	58 ms	64888 KB	Output is correct
10	Correct	67 ms	65016 KB	Output is correct
11	Correct	63 ms	65020 KB	Output is correct
12	Correct	58 ms	64980 KB	Output is correct
13	Correct	58 ms	64888 KB	Output is correct
14	Correct	59 ms	65016 KB	Output is correct
15	Correct	59 ms	64932 KB	Output is correct
16	Correct	61 ms	64888 KB	Output is correct
17	Correct	63 ms	64888 KB	Output is correct
18	Correct	63 ms	64980 KB	Output is correct
19	Correct	57 ms	64884 KB	Output is correct
20	Correct	63 ms	65016 KB	Output is correct
21	Correct	58 ms	65056 KB	Output is correct
22	Correct	58 ms	64888 KB	Output is correct
23	Correct	64 ms	65008 KB	Output is correct
24	Correct	58 ms	65016 KB	Output is correct
25	Correct	60 ms	64932 KB	Output is correct
26	Correct	61 ms	65332 KB	Output is correct
27	Correct	60 ms	65144 KB	Output is correct
28	Correct	62 ms	65440 KB	Output is correct
29	Correct	60 ms	65272 KB	Output is correct
30	Correct	62 ms	65140 KB	Output is correct
31	Correct	58 ms	64952 KB	Output is correct
32	Correct	61 ms	65272 KB	Output is correct
33	Correct	58 ms	64972 KB	Output is correct
34	Correct	60 ms	65144 KB	Output is correct
35	Correct	60 ms	65244 KB	Output is correct
36	Correct	61 ms	65144 KB	Output is correct
37	Correct	61 ms	65176 KB	Output is correct
38	Correct	58 ms	65016 KB	Output is correct
39	Correct	61 ms	65144 KB	Output is correct
40	Correct	60 ms	65144 KB	Output is correct
41	Correct	61 ms	65116 KB	Output is correct
42	Correct	60 ms	65116 KB	Output is correct
43	Correct	61 ms	65272 KB	Output is correct
44	Correct	58 ms	64888 KB	Output is correct
45	Correct	61 ms	65272 KB	Output is correct
46	Correct	60 ms	65144 KB	Output is correct
47	Correct	60 ms	64928 KB	Output is correct
48	Correct	61 ms	65144 KB	Output is correct
49	Correct	60 ms	65144 KB	Output is correct
50	Correct	61 ms	65216 KB	Output is correct
51	Correct	62 ms	65144 KB	Output is correct
52	Correct	60 ms	65144 KB	Output is correct
53	Correct	61 ms	65244 KB	Output is correct
54	Correct	60 ms	65116 KB	Output is correct

Subtask #3
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	57 ms	65016 KB	Output is correct
2	Correct	64 ms	64968 KB	Output is correct
3	Correct	62 ms	64888 KB	Output is correct
4	Correct	71 ms	64996 KB	Output is correct
5	Correct	61 ms	65012 KB	Output is correct
6	Correct	59 ms	65016 KB	Output is correct
7	Correct	60 ms	64888 KB	Output is correct
8	Correct	65 ms	65004 KB	Output is correct
9	Correct	58 ms	64888 KB	Output is correct
10	Correct	67 ms	65016 KB	Output is correct
11	Correct	63 ms	65020 KB	Output is correct
12	Correct	58 ms	64980 KB	Output is correct
13	Correct	58 ms	64888 KB	Output is correct
14	Correct	59 ms	65016 KB	Output is correct
15	Correct	59 ms	64932 KB	Output is correct
16	Correct	61 ms	64888 KB	Output is correct
17	Correct	63 ms	64888 KB	Output is correct
18	Correct	63 ms	64980 KB	Output is correct
19	Correct	57 ms	64884 KB	Output is correct
20	Correct	63 ms	65016 KB	Output is correct
21	Correct	58 ms	65056 KB	Output is correct
22	Correct	58 ms	64888 KB	Output is correct
23	Correct	64 ms	65008 KB	Output is correct
24	Correct	58 ms	65016 KB	Output is correct
25	Correct	70 ms	65028 KB	Output is correct
26	Correct	147 ms	70268 KB	Output is correct
27	Correct	186 ms	70308 KB	Output is correct
28	Correct	61 ms	65144 KB	Output is correct
29	Correct	58 ms	64888 KB	Output is correct
30	Correct	67 ms	65016 KB	Output is correct
31	Correct	181 ms	70520 KB	Output is correct
32	Correct	60 ms	65144 KB	Output is correct
33	Correct	270 ms	76016 KB	Output is correct
34	Correct	181 ms	70340 KB	Output is correct
35	Correct	60 ms	65144 KB	Output is correct
36	Correct	212 ms	71032 KB	Output is correct
37	Correct	60 ms	65144 KB	Output is correct
38	Correct	61 ms	65144 KB	Output is correct
39	Correct	147 ms	70092 KB	Output is correct
40	Correct	61 ms	65344 KB	Output is correct
41	Correct	185 ms	70448 KB	Output is correct
42	Correct	224 ms	72184 KB	Output is correct
43	Correct	58 ms	64888 KB	Output is correct
44	Correct	241 ms	76148 KB	Output is correct
45	Correct	257 ms	73340 KB	Output is correct
46	Correct	60 ms	65144 KB	Output is correct
47	Correct	61 ms	65272 KB	Output is correct

Subtask #4
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	141 ms	70212 KB	Output is correct
2	Correct	169 ms	73968 KB	Output is correct
3	Correct	62 ms	65116 KB	Output is correct
4	Correct	65 ms	65280 KB	Output is correct
5	Correct	58 ms	64888 KB	Output is correct
6	Correct	58 ms	65016 KB	Output is correct
7	Correct	60 ms	65064 KB	Output is correct
8	Correct	211 ms	72248 KB	Output is correct
9	Correct	60 ms	65144 KB	Output is correct
10	Correct	179 ms	71120 KB	Output is correct
11	Correct	58 ms	64888 KB	Output is correct
12	Correct	226 ms	71076 KB	Output is correct
13	Correct	223 ms	72076 KB	Output is correct
14	Correct	215 ms	73592 KB	Output is correct
15	Correct	153 ms	70092 KB	Output is correct
16	Correct	61 ms	65144 KB	Output is correct
17	Correct	65 ms	64952 KB	Output is correct
18	Correct	169 ms	73584 KB	Output is correct
19	Correct	296 ms	76856 KB	Output is correct
20	Correct	72 ms	65144 KB	Output is correct
21	Correct	70 ms	64988 KB	Output is correct
22	Correct	224 ms	72536 KB	Output is correct
23	Correct	62 ms	65272 KB	Output is correct
24	Correct	223 ms	71544 KB	Output is correct
25	Correct	239 ms	75660 KB	Output is correct
26	Correct	61 ms	65272 KB	Output is correct
27	Correct	62 ms	65272 KB	Output is correct
28	Correct	61 ms	65144 KB	Output is correct
29	Correct	61 ms	65144 KB	Output is correct
30	Correct	74 ms	65144 KB	Output is correct

Subtask #5
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	57 ms	65016 KB	Output is correct
2	Correct	64 ms	64968 KB	Output is correct
3	Correct	62 ms	64888 KB	Output is correct
4	Correct	71 ms	64996 KB	Output is correct
5	Correct	61 ms	65012 KB	Output is correct
6	Correct	59 ms	65016 KB	Output is correct
7	Correct	60 ms	64888 KB	Output is correct
8	Correct	65 ms	65004 KB	Output is correct
9	Correct	58 ms	64888 KB	Output is correct
10	Correct	67 ms	65016 KB	Output is correct
11	Correct	63 ms	65020 KB	Output is correct
12	Correct	58 ms	64980 KB	Output is correct
13	Correct	58 ms	64888 KB	Output is correct
14	Correct	59 ms	65016 KB	Output is correct
15	Correct	59 ms	64932 KB	Output is correct
16	Correct	61 ms	64888 KB	Output is correct
17	Correct	63 ms	64888 KB	Output is correct
18	Correct	63 ms	64980 KB	Output is correct
19	Correct	57 ms	64884 KB	Output is correct
20	Correct	63 ms	65016 KB	Output is correct
21	Correct	58 ms	65056 KB	Output is correct
22	Correct	58 ms	64888 KB	Output is correct
23	Correct	64 ms	65008 KB	Output is correct
24	Correct	58 ms	65016 KB	Output is correct
25	Correct	60 ms	64932 KB	Output is correct
26	Correct	61 ms	65332 KB	Output is correct
27	Correct	60 ms	65144 KB	Output is correct
28	Correct	62 ms	65440 KB	Output is correct
29	Correct	60 ms	65272 KB	Output is correct
30	Correct	62 ms	65140 KB	Output is correct
31	Correct	58 ms	64952 KB	Output is correct
32	Correct	61 ms	65272 KB	Output is correct
33	Correct	58 ms	64972 KB	Output is correct
34	Correct	60 ms	65144 KB	Output is correct
35	Correct	60 ms	65244 KB	Output is correct
36	Correct	61 ms	65144 KB	Output is correct
37	Correct	61 ms	65176 KB	Output is correct
38	Correct	58 ms	65016 KB	Output is correct
39	Correct	61 ms	65144 KB	Output is correct
40	Correct	60 ms	65144 KB	Output is correct
41	Correct	61 ms	65116 KB	Output is correct
42	Correct	60 ms	65116 KB	Output is correct
43	Correct	61 ms	65272 KB	Output is correct
44	Correct	58 ms	64888 KB	Output is correct
45	Correct	61 ms	65272 KB	Output is correct
46	Correct	60 ms	65144 KB	Output is correct
47	Correct	60 ms	64928 KB	Output is correct
48	Correct	61 ms	65144 KB	Output is correct
49	Correct	60 ms	65144 KB	Output is correct
50	Correct	61 ms	65216 KB	Output is correct
51	Correct	62 ms	65144 KB	Output is correct
52	Correct	60 ms	65144 KB	Output is correct
53	Correct	61 ms	65244 KB	Output is correct
54	Correct	60 ms	65116 KB	Output is correct
55	Correct	70 ms	65028 KB	Output is correct
56	Correct	147 ms	70268 KB	Output is correct
57	Correct	186 ms	70308 KB	Output is correct
58	Correct	61 ms	65144 KB	Output is correct
59	Correct	58 ms	64888 KB	Output is correct
60	Correct	67 ms	65016 KB	Output is correct
61	Correct	181 ms	70520 KB	Output is correct
62	Correct	60 ms	65144 KB	Output is correct
63	Correct	270 ms	76016 KB	Output is correct
64	Correct	181 ms	70340 KB	Output is correct
65	Correct	60 ms	65144 KB	Output is correct
66	Correct	212 ms	71032 KB	Output is correct
67	Correct	60 ms	65144 KB	Output is correct
68	Correct	61 ms	65144 KB	Output is correct
69	Correct	147 ms	70092 KB	Output is correct
70	Correct	61 ms	65344 KB	Output is correct
71	Correct	185 ms	70448 KB	Output is correct
72	Correct	224 ms	72184 KB	Output is correct
73	Correct	58 ms	64888 KB	Output is correct
74	Correct	241 ms	76148 KB	Output is correct
75	Correct	257 ms	73340 KB	Output is correct
76	Correct	60 ms	65144 KB	Output is correct
77	Correct	61 ms	65272 KB	Output is correct
78	Correct	141 ms	70212 KB	Output is correct
79	Correct	169 ms	73968 KB	Output is correct
80	Correct	62 ms	65116 KB	Output is correct
81	Correct	65 ms	65280 KB	Output is correct
82	Correct	58 ms	64888 KB	Output is correct
83	Correct	58 ms	65016 KB	Output is correct
84	Correct	60 ms	65064 KB	Output is correct
85	Correct	211 ms	72248 KB	Output is correct
86	Correct	60 ms	65144 KB	Output is correct
87	Correct	179 ms	71120 KB	Output is correct
88	Correct	58 ms	64888 KB	Output is correct
89	Correct	226 ms	71076 KB	Output is correct
90	Correct	223 ms	72076 KB	Output is correct
91	Correct	215 ms	73592 KB	Output is correct
92	Correct	153 ms	70092 KB	Output is correct
93	Correct	61 ms	65144 KB	Output is correct
94	Correct	65 ms	64952 KB	Output is correct
95	Correct	169 ms	73584 KB	Output is correct
96	Correct	296 ms	76856 KB	Output is correct
97	Correct	72 ms	65144 KB	Output is correct
98	Correct	70 ms	64988 KB	Output is correct
99	Correct	224 ms	72536 KB	Output is correct
100	Correct	62 ms	65272 KB	Output is correct
101	Correct	223 ms	71544 KB	Output is correct
102	Correct	239 ms	75660 KB	Output is correct
103	Correct	61 ms	65272 KB	Output is correct
104	Correct	62 ms	65272 KB	Output is correct
105	Correct	61 ms	65144 KB	Output is correct
106	Correct	61 ms	65144 KB	Output is correct
107	Correct	74 ms	65144 KB	Output is correct
108	Correct	974 ms	100936 KB	Output is correct
109	Correct	1431 ms	105532 KB	Output is correct
110	Correct	1454 ms	114396 KB	Output is correct
111	Correct	1651 ms	127088 KB	Output is correct
112	Correct	1370 ms	119296 KB	Output is correct
113	Correct	834 ms	108512 KB	Output is correct
114	Incorrect	894 ms	91356 KB	Output isn't correct
115	Halted	0 ms	0 KB	-

답안 #138138

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