#include "train.h"
#include <algorithm>
#include <stdio.h>
#include <vector>
namespace
{
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
// Heaven and Earth... My guiding star...
// Akira Complex R.I.P.

std::vector<uint>Way[5005],RWay[5005];
bol Own[5005],S[5005],Now[5005];
uint n;

voi solve()
{
    for(uint i=0;i<n;i++)Now[i]=true;
    while(true)
    {
        static bol F[5005];static uint Deg[5005];
        std::vector<uint>Q;
        for(uint i=0;i<n;i++)if((F[i]=S[i]))Q.push_back(i),Deg[i]=0;
        else if(Now[i])
        {
            if(!Own[i]){Deg[i]=0;for(auto s:Way[i])if(Now[s])Deg[i]++;}
            else Deg[i]=1;
        }
        while(Q.size())
        {
            uint p=Q.back();Q.pop_back();
            for(auto s:RWay[p])if(Now[s]&&!--Deg[s])Q.push_back(s),F[s]=true;
        }
        for(uint i=0;i<n;i++)if((F[i]^=Now[i]))Q.push_back(i),Deg[i]=0;
        else if(Now[i])
        {
            if(Own[i]){Deg[i]=0;for(auto s:Way[i])if(Now[s])Deg[i]++;}
            else Deg[i]=1;
        }
        if(Q.empty())break;
        while(Q.size())
        {
            uint p=Q.back();Q.pop_back();
            for(auto s:RWay[p])if(Now[s]&&!--Deg[s])Q.push_back(s),F[s]=true;
        }
        for(uint i=0;i<n;i++)Now[i]=Now[i]&&!F[i],S[i]=S[i]&&!F[i];
    }
}

}

std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
    n=a.size();
    for(uint i=0;i<n;i++)Own[i]=a[i],S[i]=r[i];
    for(uint i=0;i<u.size();i++)Way[u[i]].push_back(v[i]),RWay[v[i]].push_back(u[i]);
    solve();
    for(uint i=0;i<n;i++)a[i]=Now[i];
	return a;
}