#include "train.h"
#include<bits/stdc++.h>
using namespace std;
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
int n = (int)a.size();
int m = (int)u.size();
vector<int>ans(n);
vector<vector<int>>adj(n);
for (int i = 0;i<m;++i){
adj[u[i]].push_back(v[i]);
}
vector<bool>in_cycle(n,false);
vector<bool>visited(n,false);
for (int i = 0;i<n;++i){
if (!r[i])continue;
vector<int>bucket;
for (int j = 0;j<n;++j)visited[j] = false;
function<void(int)>dfs = [&](int u){
if (visited[u]){
if (u == i){
for (auto x:bucket){
in_cycle[x] = true;
}
}
return;
}
bucket.push_back(u);
visited[u] = true;
for (auto x:adj[u]){
dfs(x);
}
bucket.pop_back();
};
dfs(i);
}
for (int i = 0;i<n;++i){
visited[i] = false;
}
for (int i = 0;i<n;++i){
if (in_cycle[i]){
visited[i] = true;
ans[i] = true;
}
}
function<int(int)>dfs2 = [&](int u){
if (visited[u])return ans[u];
visited[u] = true;
int v = 0;
for (auto x:adj[u]){
v|=dfs2(x);
}
return ans[u] = v;
};
for (int i = 0;i<n;++i){
if (!visited[i]){
ans[i] = dfs2(i);
}
}
return ans;
}
