-
Notifications
You must be signed in to change notification settings - Fork 0
/
C.cpp
65 lines (53 loc) · 881 Bytes
/
C.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> adj[100010];
int c[100010];
set<int> s;
void dfs(int u, int p)
{
bool flag = c[u];
for (auto &v : adj[u]) {
if (v != p) {
dfs(v, u);
flag &= c[v];
}
}
if (flag) s.insert(u);
}
void solve()
{
int n, root = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
int p;
cin >> p >> c[i];
if (p != -1) {
adj[i].push_back(p);
adj[p].push_back(i);
}
else root = i;
}
dfs(root, -1);
if (s.empty()) cout << "-1\n";
else {
for (auto &x : s) {
cout << x << ' ';
}
cout << '\n';
}
}
int main()
{
#ifndef ONLINE_JUDGE
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
//freopen("Error.txt", "w", stderr);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
int t = 1;
//cin >> t;
while (t--) solve();
return 0;
}