#include <bits/stdc++.h>
using namespace std;
int const N=10005;
int const M=2005;
vector<int> adj[N];
int cnt[N][M];
int sz[M];
vector<int> ans;
int n,m,k;
map<pair<int,int>,int> mp;
void dfs(int node,int par){
for(auto i:adj[node])
if(i!=par){
dfs(i,node);
for(int j=0;j<m;j++)
cnt[node][j]+=cnt[i][j];
}
int p=0;
for(int j=0;j<m;j++)
if(cnt[node][j]<sz[j] && cnt[node][j]>0)
p++;
if(p>=k && par!=-1)
ans.push_back(mp[{par,node}]);
}
int main(){
cin>>n>>m>>k;
for(int i=0;i<n-1;i++){
int a,b;
cin>>a>>b;
mp[{a,b}]=i+1;
mp[{b,a}]=i+1;
adj[a].push_back(b);
adj[b].push_back(a);
}
for(int i=0;i<m;i++){
cin>>sz[i];
for(int j=0;j<sz[i];j++){
int a;
cin>>a;
cnt[a][i]++;
}
}
dfs(1,-1);
cout<<ans.size()<<endl;
sort(ans.begin(),ans.end());
for(auto i:ans)
cout<<i<<' ';
cout<<endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
604 KB |
Output is correct |
2 |
Correct |
41 ms |
80268 KB |
Output is correct |
3 |
Correct |
24 ms |
80364 KB |
Output is correct |
4 |
Correct |
1 ms |
604 KB |
Output is correct |
5 |
Correct |
1 ms |
604 KB |
Output is correct |
6 |
Correct |
30 ms |
81148 KB |
Output is correct |
7 |
Correct |
23 ms |
80468 KB |
Output is correct |
8 |
Correct |
34 ms |
80476 KB |
Output is correct |
9 |
Correct |
33 ms |
80476 KB |
Output is correct |
10 |
Correct |
1 ms |
600 KB |
Output is correct |
11 |
Correct |
1 ms |
604 KB |
Output is correct |
12 |
Correct |
0 ms |
604 KB |
Output is correct |
13 |
Correct |
1 ms |
600 KB |
Output is correct |
14 |
Correct |
1 ms |
604 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
604 KB |
Output is correct |
2 |
Correct |
41 ms |
80268 KB |
Output is correct |
3 |
Correct |
24 ms |
80364 KB |
Output is correct |
4 |
Correct |
1 ms |
604 KB |
Output is correct |
5 |
Correct |
1 ms |
604 KB |
Output is correct |
6 |
Correct |
30 ms |
81148 KB |
Output is correct |
7 |
Correct |
23 ms |
80468 KB |
Output is correct |
8 |
Correct |
34 ms |
80476 KB |
Output is correct |
9 |
Correct |
33 ms |
80476 KB |
Output is correct |
10 |
Correct |
1 ms |
600 KB |
Output is correct |
11 |
Correct |
1 ms |
604 KB |
Output is correct |
12 |
Correct |
0 ms |
604 KB |
Output is correct |
13 |
Correct |
1 ms |
600 KB |
Output is correct |
14 |
Correct |
1 ms |
604 KB |
Output is correct |
15 |
Correct |
58 ms |
81224 KB |
Output is correct |
16 |
Correct |
58 ms |
80980 KB |
Output is correct |
17 |
Correct |
59 ms |
80976 KB |
Output is correct |
18 |
Correct |
46 ms |
80984 KB |
Output is correct |
19 |
Correct |
35 ms |
80792 KB |
Output is correct |
20 |
Correct |
58 ms |
81236 KB |
Output is correct |
21 |
Correct |
58 ms |
81236 KB |
Output is correct |
22 |
Correct |
0 ms |
800 KB |
Output is correct |
23 |
Correct |
25 ms |
80396 KB |
Output is correct |
24 |
Correct |
23 ms |
80220 KB |
Output is correct |
25 |
Correct |
1 ms |
680 KB |
Output is correct |
26 |
Correct |
0 ms |
856 KB |
Output is correct |
27 |
Correct |
28 ms |
81124 KB |
Output is correct |
28 |
Correct |
23 ms |
80496 KB |
Output is correct |
29 |
Correct |
31 ms |
80328 KB |
Output is correct |
30 |
Correct |
37 ms |
80476 KB |
Output is correct |
31 |
Correct |
1 ms |
600 KB |
Output is correct |
32 |
Correct |
1 ms |
604 KB |
Output is correct |
33 |
Correct |
1 ms |
604 KB |
Output is correct |
34 |
Correct |
0 ms |
604 KB |
Output is correct |
35 |
Correct |
1 ms |
604 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
11 ms |
4444 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
3 ms |
860 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
3 ms |
860 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
604 KB |
Output is correct |
2 |
Correct |
41 ms |
80268 KB |
Output is correct |
3 |
Correct |
24 ms |
80364 KB |
Output is correct |
4 |
Correct |
1 ms |
604 KB |
Output is correct |
5 |
Correct |
1 ms |
604 KB |
Output is correct |
6 |
Correct |
30 ms |
81148 KB |
Output is correct |
7 |
Correct |
23 ms |
80468 KB |
Output is correct |
8 |
Correct |
34 ms |
80476 KB |
Output is correct |
9 |
Correct |
33 ms |
80476 KB |
Output is correct |
10 |
Correct |
1 ms |
600 KB |
Output is correct |
11 |
Correct |
1 ms |
604 KB |
Output is correct |
12 |
Correct |
0 ms |
604 KB |
Output is correct |
13 |
Correct |
1 ms |
600 KB |
Output is correct |
14 |
Correct |
1 ms |
604 KB |
Output is correct |
15 |
Correct |
58 ms |
81224 KB |
Output is correct |
16 |
Correct |
58 ms |
80980 KB |
Output is correct |
17 |
Correct |
59 ms |
80976 KB |
Output is correct |
18 |
Correct |
46 ms |
80984 KB |
Output is correct |
19 |
Correct |
35 ms |
80792 KB |
Output is correct |
20 |
Correct |
58 ms |
81236 KB |
Output is correct |
21 |
Correct |
58 ms |
81236 KB |
Output is correct |
22 |
Correct |
0 ms |
800 KB |
Output is correct |
23 |
Correct |
25 ms |
80396 KB |
Output is correct |
24 |
Correct |
23 ms |
80220 KB |
Output is correct |
25 |
Correct |
1 ms |
680 KB |
Output is correct |
26 |
Correct |
0 ms |
856 KB |
Output is correct |
27 |
Correct |
28 ms |
81124 KB |
Output is correct |
28 |
Correct |
23 ms |
80496 KB |
Output is correct |
29 |
Correct |
31 ms |
80328 KB |
Output is correct |
30 |
Correct |
37 ms |
80476 KB |
Output is correct |
31 |
Correct |
1 ms |
600 KB |
Output is correct |
32 |
Correct |
1 ms |
604 KB |
Output is correct |
33 |
Correct |
1 ms |
604 KB |
Output is correct |
34 |
Correct |
0 ms |
604 KB |
Output is correct |
35 |
Correct |
1 ms |
604 KB |
Output is correct |
36 |
Runtime error |
11 ms |
4444 KB |
Execution killed with signal 11 |
37 |
Halted |
0 ms |
0 KB |
- |