#include <bits/stdc++.h>
using namespace std;
const int MX = 5042;
int n;
int deg[MX];
int nxt[MX];
bool vis[MX];
bool vis2[MX];
bool isOk[MX];
bool isAlice[MX];
bool isCharge[MX];
vector<int> rgraph[MX];
bool BFS() {
int start = 0;
int end = 0;
for (int i = 0; i < n; i++)
deg[i] = 0;
for (int i = 0; i < n; i++) {
for (auto& x: rgraph[i])
deg[x]++;
if (isCharge[i] && isOk[i])
nxt[end++] = i;
vis[i] = vis2[i] = false;
}
//cout << layer << ' ' << (int)nxt.size() << '\n';
while (start <= end) {
auto cur = nxt[start++];
//cout << "cur is " << cur << '\n';
if (vis[cur])
continue;
vis[cur] = true;
for (auto& x: rgraph[cur]) {
if (!vis2[x] && ((--deg[x] == 0) || isAlice[x])) {
vis2[x] = true;
nxt[end++] = x;
}
}
}
for (int i = 0; i < n; i++) {
if (isOk[i] && !vis2[i]) {
isOk[i] = false;
return true;
}
}
return false;
}
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
n = (int)a.size();
for (int i = 0; i < (int)u.size(); i++)
rgraph[v[i]].push_back(u[i]);
for (int i = 0; i < n; i++) {
isAlice[i] = a[i];
isCharge[i] = r[i];
isOk[i] = true;
}
while (BFS());
vector<int> ans (n);
for (int i = 0; i < n; i++)
ans[i] = isOk[i];
return ans;
}
