// ~ Be Name Khoda ~ //
#include "train.h"
#include <bits/stdc++.h>
//#pragma GCC optimize ("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops,Ofast")
using namespace std;
typedef long long ll;
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define fi first
#define se second
const int maxn = 1e6 + 10;
const int maxn5 = 5e5 + 10;
const int maxnt = 1.2e6 + 10;
const int maxn3 = 1e3 + 10;
const int mod = 1e9 + 7;
const ll inf = 1e18;
int cnt[maxn5], q[maxn5];
vector <int> adj[maxn5], jda[maxn5], ret;
bool mark[maxn5], good[maxn5], keep[maxn5];
int n, m;
std::vector<int> who_wins(std::vector<int> a, std::vector<int> ch, std::vector<int> u, std::vector<int> v) {
n = a.size();
m = u.size();
for(int i = 0; i < m; i++){
adj[u[i]].pb(v[i]);
jda[v[i]].pb(u[i]);
cnt[u[i]]++;
}
while(true){
int x = -1;
for(int i = 0; i < n; i++)
keep[i] = good[i];
for(int i = 0; i < n; i++) if(!good[i] && ch[i])
x = i;
if(x == -1)
break;
int l = 0, r = 0;
for(auto u : jda[x]) if(!good[u]){
if(a[u]){
q[r++] = u;
good[u] = true;
}
else if(cnt[u] > 1)
cnt[u]--;
else{
q[r++] = u;
good[u] = true;
}
}
while(l < r){
int v = q[l++];
for(auto u : jda[v]) if(!good[u]){
if(a[u]){
q[r++] = u;
good[u] = true;
}
else if(cnt[u] > 1)
cnt[u]--;
else{
q[r++] = u;
good[u] = true;
}
}
}
if(!good[x]){
ch[x] = false;
for(int i = 0; i < n; i++)
good[i] = keep[i];
}
}
for(int i = 0; i < n; i++)
ret.pb(good[i]);
return ret;
}
