Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int main() {
- ios_base::sync_with_stdio(false);
- cin.tie(nullptr);
- cout.tie(nullptr);
- int N;
- cin >> N;
- vector < vector < int > >G(N + 1);
- for(int i = 1; i <= N; ++i) {
- int x;
- while(cin >> x) {
- if(x == 0)
- break;
- G[i].emplace_back(x);
- G[x].emplace_back(i);
- }
- }
- vector < int > sol;
- sol.emplace_back(1);
- for(int i = 2; i <= N; ++i) {
- bool flag = true;
- for(int node : G[i])
- if(binary_search(sol.begin(), sol.end(), node))
- flag = false;
- if(flag)
- sol.emplace_back(i);
- }
- cout << sol.size() << '\n';
- for(int x : sol)
- cout << x << ' ';
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement