#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
#define ll long long
#define int long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii, int> ipii;
const int MAXN = 2e5+10;
const int MAXA = 2e3+10;
const int INF = 1e18+10;
const int LOG = 19;
const int MOD = 1e9+7;
const int SQRT = 450;
const vector<int> NOL = {};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const vector<int> dx = {1, -1, 0, 0};
const vector<int> dy = {0, 0, 1, -1};
int n, m, k;
vector <pii> adj[MAXN];
vector <int> ans;
int num, u[MAXN], v[MAXN], las;
int tag[MAXN], cnt[MAXN];
void dfs(int nw, int par){
for(auto ed : adj[nw]){
int nx = ed.fi, idx = ed.se;
if(nx==par) continue;
dfs(nx, nw);
if(tag[nx]) ans.pb(idx);
tag[nw] += tag[nx];
}
}
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n >> m >> k;
for(int i=1; i<=n-1; i++){
int x, y; cin >> x >> y; u[i] = x; v[i] = y;
adj[x].pb({y, i}); adj[y].pb({x, i});
}
for(int i=1; i<=m; i++){
int x; cin >> x;
for(int j=1; j<=x; j++){
int p; cin >> p;
cnt[p]++;
if(cnt[p] == k){
tag[p] = 1; num++;
las = p;
ans.pb(p);
}
}
}
// dfs(las, 0);
sort(ans.begin(), ans.end());
cout << ans.size() << '\n';
for(auto in : ans){
cout << in << ' ';
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
11100 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
11100 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
21 ms |
14684 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
25 ms |
14684 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
25 ms |
14684 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
11100 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |