#include "train.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
#define all(x) (x).begin(),(x).end()
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;
int n;
vii a,rev;
vi ans,arr,b,c,vis,vs;
set<int> st;
void dfs(int x){
vis[x]=1;
for(auto u:a[x])if(!vis[u])dfs(u);
arr.PB(x);
}
bool dfs2(int x){
vs[x]=1;
st.insert(x);
for(auto u:a[x])if(c[u]==0){
if(vis[u]==0)dfs2(u);
else if(st.count(u))return 1;
}
st.erase(x);
return 0;
}
std::vector<int> who_wins(std::vector<int> B, std::vector<int> R, std::vector<int> U, std::vector<int> V) {
n=B.size();
b=B;
c=R;
a.resize(n);rev.resize(n);
ans.resize(n,-1);
vs.resize(n,1);
REP(i,0,U.size()){
if(U[i]==V[i]&&R[U[i]]==0)ans[U[i]]=0;
if(U[i]!=V[i]){
rev[U[i]].PB(V[i]);
a[V[i]].PB(U[i]);
}
}
vis.resize(n,0);
REP(i,0,n)if(!vis[i])dfs(i);
reverse(all(arr));
vis.clear();vis.resize(n,0);
a=rev;
REP(i,0,n)if(!vis[arr[i]]){
queue<int> q;
vis[arr[i]]=1;
q.push(arr[i]);
vi brr;
while(!q.empty()){
int x=q.front();
brr.PB(x);
q.pop();
for(auto u:a[x])if(!vis[u]){
q.push(u);
vis[u]=1;
}
}
int f=1;
for(auto u:brr){
if(ans[u]==0)f=0;
for(auto v:a[u])if(ans[v]==0)f=0;
vs[u]=0;
}
st.clear();
REP(j,0,brr.size())if(c[brr[j]]==0){
bool fl=dfs2(brr[j]);
if(fl)f=0;
break;
}
for(auto u:brr)ans[u]=f;
}
return ans;
}
