#include "train.h"
#include<bits/stdc++.h>
using namespace std;
const int A = 1;
const int B = 0;
vector<int>g[5005], rg[5005];
int n, m;
int deg[5005];
queue<int>q;
vector<int>f(const int type, vector<int>&S, vector<int>&a) {
for (int i = 0 ; i < n ; ++ i) {
deg[i] = g[i].size();
}
for (int i : S) {
deg[i] = -1;
q.push(i);
}
while (q.size()) {
int v = q.front(); q.pop();
for (int from : rg[v]) if (deg[from] != -1) {
if (a[from] == type) {
deg[from] = -1;
q.push(from);
} else {
if (--deg[from] == 0) {
deg[from] = -1;
q.push(from);
}
}
}
}
vector<int>ans;
for (int i = 0 ; i < n ; ++ i) {
if (deg[i] == -1) {
ans.emplace_back(i);
}
}
return ans;
}
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
n = a.size();
m = u.size();
for (int i = 0 ; i < m ; ++ i) {
g[u[i]].emplace_back(v[i]);
rg[v[i]].emplace_back(u[i]);
}
vector<int>answer(n, -1);
vector<int>R;
vector<int>fa;
vector<int>nfa;
vector<int>infa;
vector<int>fb;
while (true) {
R.clear();
for (int i = 0 ; i < n ; ++ i) {
if (r[i] && answer[i] == -1) {
R.emplace_back(i);
}
}
if (R.empty()) {
for (int i = 0 ; i < n ; ++ i) {
if (answer[i] == -1) {
answer[i] = 0;
}
}
break;
}
fa = f(A, R, a);
infa.assign(n, 0);
for (int i : fa) infa[i] = 1;
nfa.clear();
for (int i = 0 ; i < n ; ++ i) {
if (answer[i] == -1 && infa[i] == 0) {
nfa.emplace_back(i);
}
}
fb = f(B, nfa, a);
if (fb.empty()) {
for (int i = 0 ; i < n ; ++ i) {
if (answer[i] == -1) {
answer[i] = 1;
}
}
break;
}
for (int i : fb) answer[i] = 0;
}
return answer;
}
