#include "train.h"
//Challenge: Accepted
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#define ll long long
#define maxn 5005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
vector<int> adj[maxn], rev[maxn], scc[maxn];
bool found[maxn], poss[maxn], tag[maxn];
int group[maxn];
int ord[maxn];
int ti = 0;
void dfs(int n) {
found[n] = 1;
for (int v:adj[n]) {
if (!found[v]) {
dfs(v);
}
}
ord[ti++] = n;
}
vector<int> node;
void dfs2(int n) {
node.push_back(n);
found[n] = 1;
for (int v:rev[n]) {
if (!found[v]) dfs2(v);
}
}
bool dfs3(int n) {
found[n] = 1;
if (tag[n]) return true;
bool ret = false;
for (int v:scc[n]) {
if (!found[v]) ret |= dfs3(v);
}
return ret;
}
std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
int n = a.size(), m = u.size();
for (int i = 0;i < m;i++) {
adj[u[i]].push_back(v[i]);
rev[v[i]].push_back(u[i]);
}
for (int i = 0;i < n;i++) {
if (!found[i]) dfs(i);
}
for (int i = 0;i < n;i++) found[i] = 0;
int cnt = 0;
for (int i = n - 1;i >= 0;i--) {
if (!found[ord[i]]) {
node.clear();
dfs2(ord[i]);
int ans = 0;
for (int j:node) ans |= r[j];
if(node.size() > 1) tag[cnt] = ans;
for (int j:node) group[j] = cnt;
cnt++;
}
}
for (int i = 0;i < m;i++) {
scc[group[u[i]]].push_back(group[v[i]]);
}
vector<int> ret;
for (int i = 0;i < n;i++) {
for (int j = 0;j < n;j++) found[j] = 0;
bool res = dfs3(group[i]);
ret.push_back(res ? 1 : 0);
}
return ret;
}
