#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>visited(n,false);
vector<int>cnt(n,0);
function<int(int)>dfs = [&](int u){
if (visited[u])return cnt[u];
visited[u] = true;
int ans = 0;
for (auto x:adj[u]){
if (a[u] == 1 && r[u] == 1 && x == u){
ans = (int)adj[u].size();
break;
}
else if (x != u){
ans+=dfs(x);
}
else if (a[u] == 0 && r[u] == 0 && x == u){
ans = -1;
break;
}
else if (a[u] == 0 && r[u] == 1 && x == u){
ans++;
}
}
if (a[u] == 1){
return cnt[u] = (ans > 0);
}
return cnt[u] = (ans == (int)adj[u].size());
};
for (int i = 0;i<n;++i){
if (visited[i]){
ans[i] = cnt[i];
}
else{
ans[i] = dfs(i);
}
}
return ans;
}
