#include "train.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> g[5005];
vector<int> rg[5005];
bool found[5005];
stack<int> ord;
void dfs1(int u){
if(found[u]) return;
found[u] = true;
for(int v : g[u]){
dfs1(v);
}
ord.push(u);
}
int cc[5005];
bool gcc[5005];
void dfs2(int u, int c = 0){
if(!found[u]) return;
found[u] = false;
cc[u] = c;
for(int v : rg[u]){
dfs2(v, c);
}
}
bool dfs3(int u){
if(found[u]) return gcc[cc[u]];
found[u] = true;
for(int v : g[u]){
if(dfs3(v)) return true;
}
return gcc[cc[u]];
}
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
// Subtask 3
int m = u.size();
for(int i = 0; i < m; i++){
g[u[i]].push_back(v[i]);
rg[v[i]].push_back(u[i]);
}
int n = a.size();
for(int i = 0; i < n; i++){
dfs1(i);
}
int cccnt = 0;
while(!ord.empty()){
int cur = ord.top();
ord.pop();
if(found[cur]) dfs2(cur, cccnt++);
}
vector<int> res;
for(int i = 0; i < n; i++){
if(r[i]){
gcc[cc[i]] = true;
}
}
for(int i = 0; i < n; i++){
memset(found, false, sizeof(found));
res.push_back(dfs3(i));
}
return res;
}
