#include "train.h"
#include <bits/stdc++.h>
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v)
{
vi res;
set<int>s[6000];
for (int i=0;i<sz(u);i++)s[u[i]].insert(v[i]);;
for (int i=0;i<sz(a);i++)
{
ll k=i;
ll jem=0;
while(1)
{
k++;
if (s[i].count(i)==1 && a[i]==0 && r[i]==0)
{
jem=0;
break;
}
if (s[i].count(i)==1 && a[i]==1 && r[i]==1)
{
jem=1;
break;
}
if (s[k].count(k+1)==1)k+=1;
else
{
// jem=r[k];
break;
}
}
res.pb(jem);
}
return res;
}
