#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector <vector <pair <int, int>>> adj;
vector <vector <int>> anc;
vector <int> visit, finish, parent_edge;
vector <pair <int, int>> edges;
int t = 0;
void dfs(int s, int p) {
visit[s] = t++;
anc[s][0] = p;
for (int i = 1; i < 20; i++)
anc[s][i] = anc[anc[s][i-1]][i-1];
for (auto i : adj[s]) {
if (i.first == p)
continue;
parent_edge[i.first] = i.second;
dfs(i.first, s);
}
finish[s] = t++;
}
bool is_ancestor(int a, int b) {
return visit[a] <= visit[b] && finish[a] >= finish[b];
}
int get_lca(int a, int b) {
if (is_ancestor(a, b))
return a;
if (is_ancestor(b, a))
return b;
int lca = a;
for (int i = 19; i >= 0; i--) {
if (!is_ancestor(anc[lca][i], b))
lca = anc[lca][i];
}
return anc[lca][0];
}
bool comp(int a, int b) {
return visit[a] < visit[b];
}
struct stree {
#define lc v*2
#define rc v*2+1
vector <int> tree;
stree (int s) {
tree.resize(s*4);
}
void pushup(int v) {
tree[v] = tree[lc] + tree[rc];
}
void update(int v, int tl, int tr, int p, int val) {
if (tl > p || tr < p)
return;
if (tl == tr) {
tree[v] += val;
return;
}
int tm = (tl + tr) / 2;
update(lc, tl, tm, p, val);
update(rc, tm+1, tr, p, val);
pushup(v);
}
int query(int v, int tl, int tr, int l, int r) {
if (tl > r || tr < l)
return 0;
if (tl >= l && tr <= r)
return tree[v];
int tm = (tl + tr) / 2;
int a = query(lc, tl, tm, l, r);
int b = query(rc, tm+1, tr, l, r);
return a + b;
}
};
int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
int n, m, k;
cin >> n >> m >> k;
adj.resize(n+1);
parent_edge = visit = finish = vector <int> (n+1);
anc = vector <vector <int>> (n+1, vector <int> (20));
edges.resize(n+1);
for (int i = 1; i < n; i++) {
int a, b;
cin >> a >> b;
edges[i] = {a, b};
adj[a].push_back({b, i});
adj[b].push_back({a, i});
}
dfs(1, 1);
stree tree(t+1);
for (int i = 0; i < m; i++) {
int f;
cin >> f;
vector <int> chosen(f);
for (int j = 0; j < f; j++)
cin >> chosen[j];
sort(chosen.begin(), chosen.end(), comp);
chosen.push_back(chosen[0]);
for (int j = 0; j < f; j++) {
int a = chosen[j], b = chosen[j+1];
int lca = get_lca(a, b);
tree.update(1, 0, t, visit[a], 1);
tree.update(1, 0, t, visit[b], 1);
tree.update(1, 0, t, visit[lca], -2);
}
}
vector <int> approved;
for (int i = 1; i <= n; i++) {
int res = tree.query(1, 0, t, visit[i], finish[i]);
if (res >= 2*k) {
int edge_id = parent_edge[i];
if (edge_id != 0)
approved.push_back(edge_id);
}
}
sort(approved.begin(), approved.end());
cout << approved.size() << '\n';
for (auto i : approved)
cout << i << ' ';
cout << '\n';
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
10 ms |
2652 KB |
Output is correct |
3 |
Correct |
9 ms |
2828 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
9 ms |
3008 KB |
Output is correct |
7 |
Correct |
9 ms |
2740 KB |
Output is correct |
8 |
Correct |
8 ms |
2652 KB |
Output is correct |
9 |
Correct |
8 ms |
2648 KB |
Output is correct |
10 |
Correct |
1 ms |
344 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
12 |
Correct |
0 ms |
348 KB |
Output is correct |
13 |
Correct |
0 ms |
344 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
10 ms |
2652 KB |
Output is correct |
3 |
Correct |
9 ms |
2828 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
9 ms |
3008 KB |
Output is correct |
7 |
Correct |
9 ms |
2740 KB |
Output is correct |
8 |
Correct |
8 ms |
2652 KB |
Output is correct |
9 |
Correct |
8 ms |
2648 KB |
Output is correct |
10 |
Correct |
1 ms |
344 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
12 |
Correct |
0 ms |
348 KB |
Output is correct |
13 |
Correct |
0 ms |
344 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
44 ms |
3196 KB |
Output is correct |
16 |
Correct |
53 ms |
3164 KB |
Output is correct |
17 |
Correct |
45 ms |
3164 KB |
Output is correct |
18 |
Correct |
10 ms |
2908 KB |
Output is correct |
19 |
Correct |
9 ms |
2652 KB |
Output is correct |
20 |
Correct |
52 ms |
3156 KB |
Output is correct |
21 |
Correct |
54 ms |
3156 KB |
Output is correct |
22 |
Correct |
0 ms |
348 KB |
Output is correct |
23 |
Correct |
9 ms |
2652 KB |
Output is correct |
24 |
Correct |
9 ms |
2596 KB |
Output is correct |
25 |
Correct |
0 ms |
344 KB |
Output is correct |
26 |
Correct |
0 ms |
344 KB |
Output is correct |
27 |
Correct |
9 ms |
2908 KB |
Output is correct |
28 |
Correct |
9 ms |
2648 KB |
Output is correct |
29 |
Correct |
8 ms |
2648 KB |
Output is correct |
30 |
Correct |
8 ms |
2652 KB |
Output is correct |
31 |
Correct |
0 ms |
344 KB |
Output is correct |
32 |
Correct |
0 ms |
348 KB |
Output is correct |
33 |
Correct |
0 ms |
348 KB |
Output is correct |
34 |
Correct |
0 ms |
348 KB |
Output is correct |
35 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
160 ms |
29912 KB |
Output is correct |
2 |
Correct |
0 ms |
352 KB |
Output is correct |
3 |
Correct |
158 ms |
29632 KB |
Output is correct |
4 |
Correct |
158 ms |
29292 KB |
Output is correct |
5 |
Correct |
148 ms |
29904 KB |
Output is correct |
6 |
Correct |
161 ms |
30420 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
159 ms |
27404 KB |
Output is correct |
2 |
Correct |
156 ms |
25172 KB |
Output is correct |
3 |
Correct |
167 ms |
24908 KB |
Output is correct |
4 |
Correct |
161 ms |
25136 KB |
Output is correct |
5 |
Correct |
166 ms |
24996 KB |
Output is correct |
6 |
Correct |
152 ms |
27472 KB |
Output is correct |
7 |
Correct |
150 ms |
27216 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
159 ms |
27404 KB |
Output is correct |
2 |
Correct |
156 ms |
25172 KB |
Output is correct |
3 |
Correct |
167 ms |
24908 KB |
Output is correct |
4 |
Correct |
161 ms |
25136 KB |
Output is correct |
5 |
Correct |
166 ms |
24996 KB |
Output is correct |
6 |
Correct |
152 ms |
27472 KB |
Output is correct |
7 |
Correct |
150 ms |
27216 KB |
Output is correct |
8 |
Correct |
162 ms |
27324 KB |
Output is correct |
9 |
Correct |
164 ms |
27532 KB |
Output is correct |
10 |
Correct |
145 ms |
30064 KB |
Output is correct |
11 |
Correct |
150 ms |
30340 KB |
Output is correct |
12 |
Correct |
136 ms |
24764 KB |
Output is correct |
13 |
Correct |
147 ms |
24656 KB |
Output is correct |
14 |
Correct |
151 ms |
24872 KB |
Output is correct |
15 |
Correct |
158 ms |
24872 KB |
Output is correct |
16 |
Correct |
162 ms |
24956 KB |
Output is correct |
17 |
Correct |
170 ms |
25064 KB |
Output is correct |
18 |
Correct |
168 ms |
25060 KB |
Output is correct |
19 |
Correct |
170 ms |
25172 KB |
Output is correct |
20 |
Correct |
153 ms |
27732 KB |
Output is correct |
21 |
Correct |
166 ms |
27732 KB |
Output is correct |
22 |
Correct |
152 ms |
27732 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
10 ms |
2652 KB |
Output is correct |
3 |
Correct |
9 ms |
2828 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
9 ms |
3008 KB |
Output is correct |
7 |
Correct |
9 ms |
2740 KB |
Output is correct |
8 |
Correct |
8 ms |
2652 KB |
Output is correct |
9 |
Correct |
8 ms |
2648 KB |
Output is correct |
10 |
Correct |
1 ms |
344 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
12 |
Correct |
0 ms |
348 KB |
Output is correct |
13 |
Correct |
0 ms |
344 KB |
Output is correct |
14 |
Correct |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
44 ms |
3196 KB |
Output is correct |
16 |
Correct |
53 ms |
3164 KB |
Output is correct |
17 |
Correct |
45 ms |
3164 KB |
Output is correct |
18 |
Correct |
10 ms |
2908 KB |
Output is correct |
19 |
Correct |
9 ms |
2652 KB |
Output is correct |
20 |
Correct |
52 ms |
3156 KB |
Output is correct |
21 |
Correct |
54 ms |
3156 KB |
Output is correct |
22 |
Correct |
0 ms |
348 KB |
Output is correct |
23 |
Correct |
9 ms |
2652 KB |
Output is correct |
24 |
Correct |
9 ms |
2596 KB |
Output is correct |
25 |
Correct |
0 ms |
344 KB |
Output is correct |
26 |
Correct |
0 ms |
344 KB |
Output is correct |
27 |
Correct |
9 ms |
2908 KB |
Output is correct |
28 |
Correct |
9 ms |
2648 KB |
Output is correct |
29 |
Correct |
8 ms |
2648 KB |
Output is correct |
30 |
Correct |
8 ms |
2652 KB |
Output is correct |
31 |
Correct |
0 ms |
344 KB |
Output is correct |
32 |
Correct |
0 ms |
348 KB |
Output is correct |
33 |
Correct |
0 ms |
348 KB |
Output is correct |
34 |
Correct |
0 ms |
348 KB |
Output is correct |
35 |
Correct |
0 ms |
348 KB |
Output is correct |
36 |
Correct |
160 ms |
29912 KB |
Output is correct |
37 |
Correct |
0 ms |
352 KB |
Output is correct |
38 |
Correct |
158 ms |
29632 KB |
Output is correct |
39 |
Correct |
158 ms |
29292 KB |
Output is correct |
40 |
Correct |
148 ms |
29904 KB |
Output is correct |
41 |
Correct |
161 ms |
30420 KB |
Output is correct |
42 |
Correct |
159 ms |
27404 KB |
Output is correct |
43 |
Correct |
156 ms |
25172 KB |
Output is correct |
44 |
Correct |
167 ms |
24908 KB |
Output is correct |
45 |
Correct |
161 ms |
25136 KB |
Output is correct |
46 |
Correct |
166 ms |
24996 KB |
Output is correct |
47 |
Correct |
152 ms |
27472 KB |
Output is correct |
48 |
Correct |
150 ms |
27216 KB |
Output is correct |
49 |
Correct |
162 ms |
27324 KB |
Output is correct |
50 |
Correct |
164 ms |
27532 KB |
Output is correct |
51 |
Correct |
145 ms |
30064 KB |
Output is correct |
52 |
Correct |
150 ms |
30340 KB |
Output is correct |
53 |
Correct |
136 ms |
24764 KB |
Output is correct |
54 |
Correct |
147 ms |
24656 KB |
Output is correct |
55 |
Correct |
151 ms |
24872 KB |
Output is correct |
56 |
Correct |
158 ms |
24872 KB |
Output is correct |
57 |
Correct |
162 ms |
24956 KB |
Output is correct |
58 |
Correct |
170 ms |
25064 KB |
Output is correct |
59 |
Correct |
168 ms |
25060 KB |
Output is correct |
60 |
Correct |
170 ms |
25172 KB |
Output is correct |
61 |
Correct |
153 ms |
27732 KB |
Output is correct |
62 |
Correct |
166 ms |
27732 KB |
Output is correct |
63 |
Correct |
152 ms |
27732 KB |
Output is correct |
64 |
Correct |
159 ms |
27664 KB |
Output is correct |
65 |
Correct |
181 ms |
24916 KB |
Output is correct |
66 |
Correct |
186 ms |
25064 KB |
Output is correct |
67 |
Correct |
163 ms |
24912 KB |
Output is correct |
68 |
Correct |
124 ms |
24660 KB |
Output is correct |
69 |
Correct |
125 ms |
24660 KB |
Output is correct |
70 |
Correct |
175 ms |
28320 KB |
Output is correct |
71 |
Correct |
178 ms |
27340 KB |
Output is correct |
72 |
Correct |
0 ms |
544 KB |
Output is correct |
73 |
Correct |
9 ms |
2748 KB |
Output is correct |
74 |
Correct |
9 ms |
2672 KB |
Output is correct |
75 |
Correct |
0 ms |
348 KB |
Output is correct |
76 |
Correct |
0 ms |
348 KB |
Output is correct |
77 |
Correct |
9 ms |
2908 KB |
Output is correct |
78 |
Correct |
12 ms |
2908 KB |
Output is correct |
79 |
Correct |
8 ms |
2652 KB |
Output is correct |
80 |
Correct |
8 ms |
2752 KB |
Output is correct |
81 |
Correct |
0 ms |
348 KB |
Output is correct |
82 |
Correct |
0 ms |
348 KB |
Output is correct |
83 |
Correct |
0 ms |
348 KB |
Output is correct |
84 |
Correct |
0 ms |
348 KB |
Output is correct |
85 |
Correct |
0 ms |
348 KB |
Output is correct |
86 |
Correct |
45 ms |
3200 KB |
Output is correct |
87 |
Correct |
44 ms |
3164 KB |
Output is correct |
88 |
Correct |
45 ms |
3112 KB |
Output is correct |
89 |
Correct |
10 ms |
2904 KB |
Output is correct |
90 |
Correct |
9 ms |
2652 KB |
Output is correct |
91 |
Correct |
60 ms |
3388 KB |
Output is correct |
92 |
Correct |
54 ms |
3132 KB |
Output is correct |
93 |
Correct |
0 ms |
348 KB |
Output is correct |
94 |
Correct |
158 ms |
30112 KB |
Output is correct |
95 |
Correct |
156 ms |
29720 KB |
Output is correct |
96 |
Correct |
159 ms |
29568 KB |
Output is correct |
97 |
Correct |
149 ms |
29908 KB |
Output is correct |
98 |
Correct |
161 ms |
30416 KB |
Output is correct |
99 |
Correct |
175 ms |
25068 KB |
Output is correct |
100 |
Correct |
160 ms |
24912 KB |
Output is correct |
101 |
Correct |
162 ms |
24912 KB |
Output is correct |
102 |
Correct |
168 ms |
25672 KB |
Output is correct |
103 |
Correct |
155 ms |
27340 KB |
Output is correct |
104 |
Correct |
153 ms |
27788 KB |
Output is correct |
105 |
Correct |
153 ms |
27312 KB |
Output is correct |
106 |
Correct |
160 ms |
27472 KB |
Output is correct |
107 |
Correct |
158 ms |
27324 KB |
Output is correct |
108 |
Correct |
144 ms |
30160 KB |
Output is correct |
109 |
Correct |
147 ms |
30164 KB |
Output is correct |
110 |
Correct |
136 ms |
24760 KB |
Output is correct |
111 |
Correct |
137 ms |
24656 KB |
Output is correct |
112 |
Correct |
157 ms |
25360 KB |
Output is correct |
113 |
Correct |
154 ms |
24956 KB |
Output is correct |