Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #pragma once
- #define _CRT_SECURE_NO_WARNINGS
- #define _USE_MATH_DEFINES
- #include <iostream>
- #include <string>
- #include <map>
- #include <set>
- #include <algorithm>
- #include <vector>
- #include <stdio.h>
- #include <cmath>
- #include <math.h>
- #include <queue>
- #include <stack>
- #include <climits>
- #include <deque>
- #include <ctime>
- #include <iomanip>
- #include <bitset>
- #include <unordered_map>
- #include <unordered_set>
- using namespace std;
- typedef long long ll;
- typedef unsigned long long ull;
- typedef unsigned int ui;
- #define mh() make_heap()
- #define poph() pop_heap()
- #define pushh() push_heap()
- #define sor(n) n.begin(), n.end()
- #define rsor(n) n.rbegin(), n.rend()
- #define mp make_pair
- #define files freopen("input.txt", "rt", stdin); freopen("output.txt", "wt", stdout)
- #define p(T) pair<T,T>
- #define toch(x) cout.precision(x), cout.setf(ios::fixed)
- #define znac(l) abs(l)/l
- #define IOS ios::sync_with_stdio(false)
- #define IOSB cin.tie(0), cout.tie(0);
- const ll ok = ll(1e9 + 7);
- void dfs(ll v, vector<vector<ll>>&graf, vector<ll>&used)
- {
- for (int i = 0; i < graf[v].size(); i++)
- {
- if (!used[graf[v][i]])
- {
- used[graf[v][i]] = 1;
- dfs(graf[v][i], graf, used);
- }
- }
- }
- int main()
- {
- IOSB;
- IOS;
- #ifdef TheCompiler
- files;
- #endif
- ll n;
- cin >> n;
- vector<vector<ll>>graf1(n + 1);
- vector<vector<ll>>graf2(n + 1);
- string s;
- cin >> s;
- while(s!="BLOOD")
- {
- ll b;
- ll a = atoi(s.c_str());
- cin >> b;
- graf1[a].push_back(b);
- graf2[b].push_back(a);
- cin >> s;
- }
- ll k;
- vector<ll>used(n+1, 0);
- while(cin >> k)
- {
- used[k] = 1;
- dfs(k, graf1, used);
- dfs(k, graf2, used);
- }
- set<ll>ans;
- for (int i = 1; i <= n; i++)
- {
- if (!used[i])
- {
- ans.insert(i);
- }
- }
- if (ans.size() == 0)
- {
- cout << 0;
- }
- else
- for (auto i = ans.begin(); i != ans.end(); i++)
- {
- cout << *i << " ";
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement