#include<bits/stdc++.h>
#include "train.h"
using namespace std;
const int nax = 5000;
int n, m;
vector<int>g[nax], gt[nax];
vector<int>A, R;
bool cyc[nax];
int vis[nax];
vector<int>stk;
vector<int>component;
void dfs1(int v) {
vis[v] = 1;
for(int u : g[v]) if(!vis[u] && !R[u]) {
dfs1(u);
}
stk.push_back(v);
}
void dfs2(int v) {
vis[v] = 1;
component.push_back(v);
for(int u : gt[v]) if(!vis[u] && !R[u]) {
dfs2(u);
}
}
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
n = a.size(), m = u.size();
for(int i=0; i<m; ++i) {
g[u[i]].push_back(v[i]);
gt[v[i]].push_back(u[i]);
if(u[i]==v[i]) cyc[u[i]] = true;
}
A = a, R = r;
vector<int>res(n);
for(int i=0; i<n; ++i) if(!vis[i] && !R[i]) {
dfs1(i);
}
reverse(stk.begin(), stk.end());
memset(vis, 0, sizeof vis);
for(int v : stk) if(!vis[v]) {
dfs2(v);
if(component.size()>1) {
for(int x : component) {
cyc[x] = true;
}
}
component.clear();
}
queue<int>q;
for(int i=0; i<n; ++i) if(!R[i] && cyc[i]) {
q.push(i);
res[i] = 1;
}
while(!q.empty()) {
int v = q.front(); q.pop();
for(int u : gt[v]) if(res[u]!=1) {
q.push(u);
res[u] = 1;
}
}
for(int i=0; i<n; ++i) res[i] ^= 1;
return res;
}
