#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include "train.h"
using namespace std;
using pii = pair<int, int>;
const int N = 5e3+10;
int n, m;
int gsz[N];
vector<int> R[N];
bool used[N][N];
int cnt[N][N];
vector<int> who_wins(vector<int> A, vector<int> C, vector<int> U, vector<int> V)
{
// input
n = A.size();
m = U.size();
for (int i = 0; i < m; ++i) {
++gsz[U[i]];
R[V[i]].push_back(U[i]);
}
// winning position
vector<int> ans(n, 1);
queue<pii> Q;
for (int i = 0; i < n; ++i) {
if (C[i]) {
for (int j = 0; j < n; ++j)
used[i][j] = true;
} else {
used[i][0] = true;
Q.emplace(i, 0);
}
}
while (!Q.empty()) {
int u = Q.front().first, p = Q.front().second;
Q.pop();
if (C[u] && p < n)
continue;
if (p == n)
ans[u] = 0;
int pl = 1, pr = n;
if (!C[u]) pl = pr = p+1;
for (auto v : R[u]) {
for (int np = pl; np <= pr && np <= n; ++np) {
++cnt[v][np];
if (cnt[v][np] == (A[v] ? (int)gsz[v] : 1) && !used[v][np]) {
used[v][np] = true;
Q.emplace(v, np);
}
}
}
}
return ans;
}
