#include<bits/stdc++.h>
#include "train.h"
using namespace std;
typedef long long ll;
vector<int> who_wins(vector<int> A, vector<int> R, vector<int> U, vector<int> V){
int n = (int)A.size();
int m = (int)U.size();
vector<vector<int>> radj(n);
vector<int> out(n, 0);
for(int i = 0; i < m; i++){
if(R[U[i]] == 1) continue;
out[U[i]]++;
radj[V[i]].push_back(U[i]);
}
vector<bool> forced(n, 1); //If 1, then it can be forced by B into a cycle with no R's.
queue<int> q;
for(int i = 0; i < n; i++){
if(out[i] == 0){
forced[i] = 0;
q.push(i);
}
}
while(!q.empty()){
int x = q.front(); q.pop();
for(int node : radj[x]){
out[node]--;
if(out[node] == 0 && forced[node] == 1) {q.push(node); forced[node] = 0;}
if(A[node] == 1 && forced[node] == 1){
forced[node] = 0;
q.push(node);
}
}
}
radj.assign(n, {});
out.assign(n, 0);
for(int i = 0; i < m; i++){
if(forced[U[i]] == 1) continue;
out[U[i]]++;
radj[V[i]].push_back(U[i]);
}
for(int i = 0; i < n; i++){
if(out[i] == 0){
q.push(i);
}
}
while(!q.empty()){
int x = q.front(); q.pop();
for(int node : radj[x]){
out[node]--;
if(out[node] == 0 && forced[node] == 0) {q.push(node); forced[node] = 1;}
if(A[node] == 0 && forced[node] == 0){
forced[node] = 1;
q.push(node);
}
}
}
vector<int> ans(n);
for(int i = 0; i < n; i++){
if(forced[i] == 1) ans[i] = 0;
else ans[i] = 1;
}
return ans;
}
//~ int main() {
//~ freopen("in.txt", "r", stdin);
//~ int n, m;
//~ assert(2 == scanf("%d %d", &n, &m));
//~ vector<int> a(n), r(n), u(m), v(m);
//~ for(int i = 0; i < n; i++)
//~ assert(1 == scanf("%d", &a[i]));
//~ for(int i = 0; i < n; i++)
//~ assert(1 == scanf("%d", &r[i]));
//~ for(int i = 0; i < m; i++)
//~ assert(2 == scanf("%d %d", &u[i], &v[i]));
//~ vector<int> res = who_wins(a, r, u, v);
//~ for(int i = 0; i < (int)res.size(); i++)
//~ printf(i ? " %d" : "%d", res[i]);
//~ printf("\n");
//~ return 0;
//~ }
