#include "train.h"
#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ll m,n,a[5050],b[5050],cic[5050],nx[5050],i;
ll cek(ll aa)
{
if(a[aa]==1)
{
if(b[aa]&&cic[aa])
return 1;
if(nx[aa])
return cek(aa+1);
return 0;
}
else
{
if(b[aa]==0&&cic[aa])
return 0;
if(nx[aa])
return cek(aa+1);
return 1;
}
}
std::vector<int> who_wins(std::vector<int> A, std::vector<int> r, std::vector<int> U, std::vector<int> V)
{
m=U.size();
n=A.size();
for(i=0;i<n;i++)a[i]=A[i];
for(i=0;i<n;i++)b[i]=r[i];
for(i=0;i<m;i++)
{
if(U[i]==V[i])
cic[U[i]]=1;
else
nx[U[i]]=1;
// v[U[i]].pb(V[i]);
// v[V[i]].pb(U[i]);
}
std::vector<int> res(n);
for(int i = 0; i < n; i++)
res[i] = cek(i);
return res;
}
