This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define pb push_back
#define pf push_front
#define pi pair<int,int>
#define vi vector<int>
int main(){
int n,m,k;
cin >> n>>m>>k;
pi coor[n];
ll cnt[n];
memset(cnt,0,sizeof(cnt));
ll a,b;
for(int i = 1; i < n; i++){
cin >> a >>b;
coor[i]={a,b};
}
for(int i =0; i < m; i++){
cin >> a ;
while(a--){
cin >> b;
cnt[b]++;
}
}
vi ans;
for(int i =0 ; i < n; i++){
if(cnt[i]>=k){
ans.pb(i);
}
}
sort(ans.begin(),ans.end());
cout << ans.size() << endl;
for(int i : ans){
cout << i << " ";
}
cout << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |