Submission #1306178

#TimeUsernameProblemLanguageResultExecution timeMemory
1306178mukhamediyarRailway (BOI17_railway)C++20
0 / 100
62 ms9736 KiB
#include <bits/stdc++.h> using namespace std; #define pb push_back #define int long long #define F first #define S second const int N = 1e6 + 7; const int inf = 1e18; const int mod = 1e9 + 7; int cost[N]; vector<int>g[N]; void solve(){ //freopen("bridges.in", "r", stdin); //freopen("bridges.out", "w", stdout); int n,m,k; cin >> n >> m >> k; for(int i = 0; i < n - 1; i ++){ int x,y; cin >> x >> y; g[x].pb(y); g[y].pb(x); } map<int,int>mp; for(int i = 0; i < m; i ++){ int s; cin >> s; for(int j= 0; j < s; j ++){ int x; cin >> x; mp[x] ++; } } vector<int>ans; for(auto x: mp){ if(x.second >= k){ ans.pb(x.first); } } cout << ans.size() << "\n"; for(auto x: ans){ cout << x << " "; } } signed main(){ ios_base::sync_with_stdio(false); cin.tie(0); int t = 1; //cin >> t; while(t --){ solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...