#include "train.h"
#include <bits/stdc++.h>
using namespace std;
using pi = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
#define bg(x) (x).begin()
#define en(x) (x).end()
#define all(x) bg(x), en(x)
#define sz(x) (int((x).size()))
int n, m;
vi charging, owner, scc;
vvi G, R;
// node, which owner, allowing charging stations
void dfs1(int u, int o, int t, vi &order, vi &cmp, vvi &G) {
for (auto v : G[u]) {
if (cmp[v] != -1) continue;
if (owner[v] != o) continue;
if (charging[v] && !t) continue;
cmp[v] = cmp[u];
dfs1(v, o, t, order, cmp, G);
}
order.push_back(u);
}
vi who_wins(vi a, vi r, vi u, vi v) {
n = sz(a), m = sz(u);
charging = r; owner = a;
G.assign(n, vi()); R.assign(n, vi()); for (int i = 0; i < m; i++) {
// if (u[i] != v[i]) {
G[u[i]].push_back(v[i]), R[v[i]].push_back(u[i]);
// } else {
// int x = n++; charging.push_back(charging[u[i]]), owner.push_back(owner[u[i]]);
// G.push_back(vi()); R.push_back(vi());
// }
}
n = sz(a), m = sz(u);
scc.assign(n, -1);
int timer = 0;
vi cmp1(n, -1), order1, order2;
for (int i = 0; i < n; i++) {
if (cmp1[i] != -1 || owner[i] != 1) continue;
cmp1[i] = timer++; dfs1(i, 1, 1, order1, cmp1, G);
}
timer = 0;
reverse(all(order1));
for (auto i : order1) {
if (scc[i] != -1) continue;
scc[i] = timer++; dfs1(i, 1, 1, order2, scc, R);
}
vi has_charger(n, 0);
vvi S(n, vi()), B(n, vi()), mems(n, vi()); vi deg(n, 0), len(n, 0);
set<pi> seen;
for (int i = 0; i < n; i++) {
if (scc[i] == -1) continue;
has_charger[scc[i]] |= charging[i];
len[scc[i]]++; mems[scc[i]].push_back(i);
for (auto v : G[i]) {
if (scc[i] == scc[v]) continue;
if (scc[v] == -1) continue;
if (seen.count({scc[i], scc[v]})) continue;
seen.insert({scc[i], scc[v]});
S[scc[i]].push_back(scc[v]);
B[scc[v]].push_back(scc[i]);
deg[scc[v]]++;
}
}
for (int i = 0; i < n; i++) {
// cout << "scc " << i << " has mems ";
// for (auto v : mems[i]) {
// cout << v << " ";
// }
// cout << "\n";
if (!has_charger[i] || len[i] != 1) continue;
bool selfloop = false; int u = mems[i][0];
for (auto v : G[u]) selfloop = selfloop || u == v;
// cout << "does node " << u << " have a self loop? " << selfloop << "\n";
has_charger[i] = has_charger[i] && selfloop;
}
queue<int> q; for (int i = 0; i < n; i++) if (deg[i] == 0 && len[i] > 0) q.push(i);
vector<int> order;
while (!q.empty()) {
int u = q.front(); q.pop();
order.push_back(u);
for (auto v : S[u]) {
if (--deg[v] == 0) q.push(v);
}
}
reverse(all(order));
for (auto u : order) {
for (auto v : S[u]) {
has_charger[u] |= has_charger[v];
}
}
vi res(n, 0);
for (int i = 0; i < n; i++) if (scc[i] != -1 && has_charger[scc[i]]) res[i] = 1;
return res;
}
