#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#pragma GCC optimize ("Ofast")
#define double ld
#define F first
#define S second
#define vi vector<int>
#define vvi vector<vi>
#define pi pair<int, int>
#define vpi vector<pi>
#define vb vector<bool>
#define vvb vector<vb>
#define pb push_back
#define ppb pop_back
#define read(a) for(auto &x:a) cin >> x;
#define print(a) for(auto x:a) cout << x << " "; cout << "\n";
#define rs resize
#define as assign
#define vc vector<char>
#define vvc vector<vc>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define MP make_pair
#define int long long
const int INF = 4e18;
const int inf = 2e9;
struct segTree{
int N;
vi tree;
segTree(int n){
N = (1LL<<(int)ceil(log2(n)));
tree = vi(2*N, 0);
}
void update(int k, int val){
k += N;
tree[k] += val;
for(k /= 2; k >= 1; k /= 2)
tree[k] = tree[2*k]+tree[2*k+1];
}
int query(int a, int b){
a += N, b += N;
int ans = 0;
while(a <= b){
if(a%2 == 1) ans += tree[a++];
if(b%2 == 0) ans += tree[b--];
a /= 2, b /= 2;
}
return ans;
}
};
void solve(){
int n, m, k; cin >> n >> m >> k;
vector<vpi> adj(n+1);
vvi up(n+1, vi(21));
for(int i=0; i<n-1; i++){
int u, v; cin >> u >> v;
adj[u].pb({v, i+1}); adj[v].pb({u, i+1});
}
vi in(n+1), out(n+1), d(n+1), edpar(n+1);
int time = 0;
function<void(int)> dfs = [&](int s){
in[s] = time++;
for(auto [u, ed]:adj[s])
if(u != up[s][0]){
up[u][0] = s;
d[u] = d[s]+1;
edpar[u] = ed;
dfs(u);
}
out[s] = time++;
};
dfs(1);
for(int j=1; j<=20; j++)
for(int i=1; i<=n; i++)
up[i][j] = up[up[i][j-1]][j-1];
function<int(int, int)> lca = [&](int a, int b){
if(d[a] > d[b]) swap(a, b);
for(int j=20; j>=0; j--)
if((d[b]-d[a])&(1LL<<j))
b = up[b][j];
for(int j=20; j>=0; j--)
if(up[a][j] != up[b][j])
a = up[a][j], b = up[b][j];
if(a == b) return a;
return up[a][0];
};
segTree st(2*n);
while(m--){
int sz; cin >> sz;
vi nod(sz); read(nod);
sort(all(nod), [&](int a, int b){
return (in[a] < in[b]);
});
nod.pb(nod[0]);
for(int i=0; i<sz; i++){
int p = lca(nod[i], nod[i+1]);
st.update(in[p], -2);
st.update(in[nod[i]], 1);
st.update(in[nod[i+1]], 1);
}
}
vi ans;
for(int i=2; i<=n; i++)
if(st.query(in[i], out[i]) >= 2*k)
ans.pb(edpar[i]);
cout << ans.size() << "\n";
sort(all(ans));
print(ans);
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
/*stolen stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* READ CONSTRAINTS
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
7 ms |
3896 KB |
Output is correct |
3 |
Correct |
7 ms |
3916 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
8 ms |
4564 KB |
Output is correct |
7 |
Correct |
7 ms |
4044 KB |
Output is correct |
8 |
Correct |
6 ms |
3924 KB |
Output is correct |
9 |
Correct |
6 ms |
3924 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
7 ms |
3896 KB |
Output is correct |
3 |
Correct |
7 ms |
3916 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
8 ms |
4564 KB |
Output is correct |
7 |
Correct |
7 ms |
4044 KB |
Output is correct |
8 |
Correct |
6 ms |
3924 KB |
Output is correct |
9 |
Correct |
6 ms |
3924 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
28 ms |
4292 KB |
Output is correct |
16 |
Correct |
35 ms |
4356 KB |
Output is correct |
17 |
Correct |
29 ms |
4456 KB |
Output is correct |
18 |
Correct |
8 ms |
4428 KB |
Output is correct |
19 |
Correct |
8 ms |
4052 KB |
Output is correct |
20 |
Correct |
32 ms |
4452 KB |
Output is correct |
21 |
Correct |
32 ms |
4336 KB |
Output is correct |
22 |
Correct |
1 ms |
212 KB |
Output is correct |
23 |
Correct |
7 ms |
3976 KB |
Output is correct |
24 |
Correct |
7 ms |
3968 KB |
Output is correct |
25 |
Correct |
0 ms |
212 KB |
Output is correct |
26 |
Correct |
1 ms |
212 KB |
Output is correct |
27 |
Correct |
7 ms |
4564 KB |
Output is correct |
28 |
Correct |
7 ms |
4076 KB |
Output is correct |
29 |
Correct |
6 ms |
3924 KB |
Output is correct |
30 |
Correct |
6 ms |
3920 KB |
Output is correct |
31 |
Correct |
0 ms |
212 KB |
Output is correct |
32 |
Correct |
0 ms |
212 KB |
Output is correct |
33 |
Correct |
1 ms |
212 KB |
Output is correct |
34 |
Correct |
1 ms |
212 KB |
Output is correct |
35 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
184 ms |
44760 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
226 ms |
44308 KB |
Output is correct |
4 |
Correct |
167 ms |
43516 KB |
Output is correct |
5 |
Correct |
202 ms |
44844 KB |
Output is correct |
6 |
Correct |
171 ms |
44908 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
124 ms |
39200 KB |
Output is correct |
2 |
Correct |
130 ms |
35084 KB |
Output is correct |
3 |
Correct |
145 ms |
34608 KB |
Output is correct |
4 |
Correct |
146 ms |
34508 KB |
Output is correct |
5 |
Correct |
135 ms |
34596 KB |
Output is correct |
6 |
Correct |
120 ms |
39500 KB |
Output is correct |
7 |
Correct |
124 ms |
39368 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
124 ms |
39200 KB |
Output is correct |
2 |
Correct |
130 ms |
35084 KB |
Output is correct |
3 |
Correct |
145 ms |
34608 KB |
Output is correct |
4 |
Correct |
146 ms |
34508 KB |
Output is correct |
5 |
Correct |
135 ms |
34596 KB |
Output is correct |
6 |
Correct |
120 ms |
39500 KB |
Output is correct |
7 |
Correct |
124 ms |
39368 KB |
Output is correct |
8 |
Correct |
151 ms |
39532 KB |
Output is correct |
9 |
Correct |
159 ms |
39520 KB |
Output is correct |
10 |
Correct |
174 ms |
44960 KB |
Output is correct |
11 |
Correct |
180 ms |
44864 KB |
Output is correct |
12 |
Correct |
127 ms |
34176 KB |
Output is correct |
13 |
Correct |
139 ms |
35520 KB |
Output is correct |
14 |
Correct |
147 ms |
36264 KB |
Output is correct |
15 |
Correct |
137 ms |
36272 KB |
Output is correct |
16 |
Correct |
139 ms |
36368 KB |
Output is correct |
17 |
Correct |
144 ms |
36400 KB |
Output is correct |
18 |
Correct |
166 ms |
36396 KB |
Output is correct |
19 |
Correct |
138 ms |
36768 KB |
Output is correct |
20 |
Correct |
126 ms |
41468 KB |
Output is correct |
21 |
Correct |
124 ms |
41652 KB |
Output is correct |
22 |
Correct |
132 ms |
41500 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
7 ms |
3896 KB |
Output is correct |
3 |
Correct |
7 ms |
3916 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
8 ms |
4564 KB |
Output is correct |
7 |
Correct |
7 ms |
4044 KB |
Output is correct |
8 |
Correct |
6 ms |
3924 KB |
Output is correct |
9 |
Correct |
6 ms |
3924 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
28 ms |
4292 KB |
Output is correct |
16 |
Correct |
35 ms |
4356 KB |
Output is correct |
17 |
Correct |
29 ms |
4456 KB |
Output is correct |
18 |
Correct |
8 ms |
4428 KB |
Output is correct |
19 |
Correct |
8 ms |
4052 KB |
Output is correct |
20 |
Correct |
32 ms |
4452 KB |
Output is correct |
21 |
Correct |
32 ms |
4336 KB |
Output is correct |
22 |
Correct |
1 ms |
212 KB |
Output is correct |
23 |
Correct |
7 ms |
3976 KB |
Output is correct |
24 |
Correct |
7 ms |
3968 KB |
Output is correct |
25 |
Correct |
0 ms |
212 KB |
Output is correct |
26 |
Correct |
1 ms |
212 KB |
Output is correct |
27 |
Correct |
7 ms |
4564 KB |
Output is correct |
28 |
Correct |
7 ms |
4076 KB |
Output is correct |
29 |
Correct |
6 ms |
3924 KB |
Output is correct |
30 |
Correct |
6 ms |
3920 KB |
Output is correct |
31 |
Correct |
0 ms |
212 KB |
Output is correct |
32 |
Correct |
0 ms |
212 KB |
Output is correct |
33 |
Correct |
1 ms |
212 KB |
Output is correct |
34 |
Correct |
1 ms |
212 KB |
Output is correct |
35 |
Correct |
1 ms |
212 KB |
Output is correct |
36 |
Correct |
184 ms |
44760 KB |
Output is correct |
37 |
Correct |
1 ms |
212 KB |
Output is correct |
38 |
Correct |
226 ms |
44308 KB |
Output is correct |
39 |
Correct |
167 ms |
43516 KB |
Output is correct |
40 |
Correct |
202 ms |
44844 KB |
Output is correct |
41 |
Correct |
171 ms |
44908 KB |
Output is correct |
42 |
Correct |
124 ms |
39200 KB |
Output is correct |
43 |
Correct |
130 ms |
35084 KB |
Output is correct |
44 |
Correct |
145 ms |
34608 KB |
Output is correct |
45 |
Correct |
146 ms |
34508 KB |
Output is correct |
46 |
Correct |
135 ms |
34596 KB |
Output is correct |
47 |
Correct |
120 ms |
39500 KB |
Output is correct |
48 |
Correct |
124 ms |
39368 KB |
Output is correct |
49 |
Correct |
151 ms |
39532 KB |
Output is correct |
50 |
Correct |
159 ms |
39520 KB |
Output is correct |
51 |
Correct |
174 ms |
44960 KB |
Output is correct |
52 |
Correct |
180 ms |
44864 KB |
Output is correct |
53 |
Correct |
127 ms |
34176 KB |
Output is correct |
54 |
Correct |
139 ms |
35520 KB |
Output is correct |
55 |
Correct |
147 ms |
36264 KB |
Output is correct |
56 |
Correct |
137 ms |
36272 KB |
Output is correct |
57 |
Correct |
139 ms |
36368 KB |
Output is correct |
58 |
Correct |
144 ms |
36400 KB |
Output is correct |
59 |
Correct |
166 ms |
36396 KB |
Output is correct |
60 |
Correct |
138 ms |
36768 KB |
Output is correct |
61 |
Correct |
126 ms |
41468 KB |
Output is correct |
62 |
Correct |
124 ms |
41652 KB |
Output is correct |
63 |
Correct |
132 ms |
41500 KB |
Output is correct |
64 |
Correct |
160 ms |
41408 KB |
Output is correct |
65 |
Correct |
193 ms |
36420 KB |
Output is correct |
66 |
Correct |
170 ms |
36332 KB |
Output is correct |
67 |
Correct |
147 ms |
36256 KB |
Output is correct |
68 |
Correct |
110 ms |
35464 KB |
Output is correct |
69 |
Correct |
106 ms |
35504 KB |
Output is correct |
70 |
Correct |
144 ms |
41776 KB |
Output is correct |
71 |
Correct |
187 ms |
41064 KB |
Output is correct |
72 |
Correct |
1 ms |
316 KB |
Output is correct |
73 |
Correct |
7 ms |
3924 KB |
Output is correct |
74 |
Correct |
7 ms |
3924 KB |
Output is correct |
75 |
Correct |
1 ms |
320 KB |
Output is correct |
76 |
Correct |
1 ms |
316 KB |
Output is correct |
77 |
Correct |
7 ms |
4484 KB |
Output is correct |
78 |
Correct |
8 ms |
4052 KB |
Output is correct |
79 |
Correct |
6 ms |
3824 KB |
Output is correct |
80 |
Correct |
7 ms |
3924 KB |
Output is correct |
81 |
Correct |
1 ms |
212 KB |
Output is correct |
82 |
Correct |
1 ms |
340 KB |
Output is correct |
83 |
Correct |
1 ms |
212 KB |
Output is correct |
84 |
Correct |
0 ms |
212 KB |
Output is correct |
85 |
Correct |
1 ms |
212 KB |
Output is correct |
86 |
Correct |
41 ms |
4308 KB |
Output is correct |
87 |
Correct |
32 ms |
4364 KB |
Output is correct |
88 |
Correct |
33 ms |
4404 KB |
Output is correct |
89 |
Correct |
8 ms |
4436 KB |
Output is correct |
90 |
Correct |
7 ms |
4052 KB |
Output is correct |
91 |
Correct |
30 ms |
4448 KB |
Output is correct |
92 |
Correct |
31 ms |
4296 KB |
Output is correct |
93 |
Correct |
1 ms |
212 KB |
Output is correct |
94 |
Correct |
188 ms |
46692 KB |
Output is correct |
95 |
Correct |
192 ms |
46028 KB |
Output is correct |
96 |
Correct |
171 ms |
45280 KB |
Output is correct |
97 |
Correct |
261 ms |
46624 KB |
Output is correct |
98 |
Correct |
172 ms |
47028 KB |
Output is correct |
99 |
Correct |
140 ms |
36400 KB |
Output is correct |
100 |
Correct |
167 ms |
36368 KB |
Output is correct |
101 |
Correct |
132 ms |
36296 KB |
Output is correct |
102 |
Correct |
130 ms |
36820 KB |
Output is correct |
103 |
Correct |
132 ms |
41160 KB |
Output is correct |
104 |
Correct |
145 ms |
41660 KB |
Output is correct |
105 |
Correct |
137 ms |
41108 KB |
Output is correct |
106 |
Correct |
157 ms |
41416 KB |
Output is correct |
107 |
Correct |
148 ms |
41172 KB |
Output is correct |
108 |
Correct |
171 ms |
46752 KB |
Output is correct |
109 |
Correct |
156 ms |
46620 KB |
Output is correct |
110 |
Correct |
129 ms |
35516 KB |
Output is correct |
111 |
Correct |
121 ms |
35528 KB |
Output is correct |
112 |
Correct |
137 ms |
36428 KB |
Output is correct |
113 |
Correct |
133 ms |
36324 KB |
Output is correct |