-
Notifications
You must be signed in to change notification settings - Fork 22
/
1143C- Queen.cpp
113 lines (84 loc) · 1.79 KB
/
1143C- Queen.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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#include<bits/stdc++.h>
using namespace std;
//{
#define si(a) scanf("%d",&a)
#define sii(a,b) scanf("%d %d",&a,&b);
#define siii(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define sl(a) scanf("%lld",&a)
#define sll(a,b) scanf("%lld %lld",&a,&b);
#define slll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define outi(a) printf("%d\n",a)
#define outii(a,b) printf("%d %d\n",a,b)
#define outis(a) printf(" %d",a)
#define outl(a) printf("%lld\n",a)
#define outll(a,b) printf("%lld %lld\n",a,b)
#define outls(a) printf(" %lld",a)
#define cel(n,k) ((n-1)/k+1)
#define sets(a) memset(a, -1, sizeof(a))
#define clr(a) memset(a, 0, sizeof(a))
#define fr(n) for(int i=0;i<n;i++)
#define fr1(n) for(int i=1;i<=n;i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define mp make_pair
#define ff first
#define ss second
#define INF 10000007
#define fastIO() ios_base::sync_with_stdio(false); cin.tie(NULL);
typedef long long i64;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
//}
int p[200005], c[200005];
vector<int> v[200005], dels;
int vis[100005], parent[100005], n, edges, cycle=0;
void reset(){
clr(vis);
}
int dfs(int u){
vis[u]= 1;
int maxi= c[u];
fr(v[u].size()){
int nd= v[u][i];
if(!vis[nd])
maxi= min(maxi, dfs(nd));
}
vis[u]= 2;
if(maxi==1)
dels.pb(u);
return c[u];
}
main(){
reset();
int a, b, root, x;
si(n);
fr1(n){
sii(x,c[i]);
if(x==-1) {
root = i;
continue;
}
v[x].pb(i);
}
dfs(root);
sort(all(dels));
if(dels.size()==0){
puts("-1");
return 0;
}
printf("%d",dels[0]);
for(int i=1;i<dels.size();i++)
outis(dels[i]);
}
/*
8
2 1
-1 0
1 0
1 1
1 1
4 1
5 1
7 0
*/