/*
ID: varunra2
LANG: C++
TASK: trains
*/
#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif
#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second
const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions
VVI adj;
int n, m;
VI charge;
VI deg;
void dfs(int u) {
for(auto& x: adj[u]) {
deg[x]--;
if(!charge[x] and !deg[x]) dfs(x);
}
}
VI who_wins(VI as, VI charge, VI u, VI v) {
n = sz(as);
m = sz(u);
adj.resize(n);
for(int i = 0; i < m; i++) {
adj[v[i]].PB(u[i]);
}
::charge = charge;
vector<bool> ret(n, true);
deg.assign(n, 0);
VI tot(n, 0);
for(int i = 0; i < m; i++) {
tot[u[i]]++;
}
bool work = true;
while(work) {
work = false;
for(int i = 0; i < n; i++) {
if(as[i]) deg[i] = 1;
else deg[i] = tot[i];
}
for(int i = 0; i < n; i++) {
if(charge[i] and ret[i]) dfs(i);
}
for(int i = 0; i < n; i++) {
if(charge[i] and ret[i] and deg[i] > 0) {
work = true;
ret[i] = false;
}
}
}
for(int i = 0; i < n; i++) {
if(deg[i] > 0) ret[i] = false;
}
VI rr(n);
for(int i = 0; i < n; i++) {
rr[i] = ret[i];
}
return rr;
}
// int main() {
// #ifndef ONLINE_JUDGE
// freopen("trains.in", "r", stdin);
// freopen("trains.out", "w", stdout);
// #endif
// cin.sync_with_stdio(0); cin.tie(0);
// return 0;
// }
