#include <vector>
#include <iostream>
#include <queue>
#include <cassert>
#include "train.h"
using namespace std;
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v){
int n = a.size();
vector<vector<int>> edg (n), revedg (n);
vector<int> recharg;
for (int i = 0; i < n; ++i) {
if (r[i]) recharg.push_back(i);
}
for (int i = 0; i < u.size(); ++i) {
edg[u[i]].push_back(v[i]);
revedg[v[i]].push_back(u[i]);
}
queue<int> addWin;
for (int i : recharg) addWin.push(i);
vector<int> res (n);
vector<int> outwin (n);
while(!addWin.empty()){
int i = addWin.front();
addWin.pop();
if (res[i]) continue;
res[i] = true;
for (int re : revedg[i]){
outwin[re]++;
assert(outwin[re] <= edg[re].size());
if (a[re] && outwin[re] == 1) addWin.push(re);
else if (!a[re] && outwin[re] == edg[re].size()) addWin.push(re);
}
}
queue<int> rWin;
for (int i : recharg){
if (res[i]){
if (a[i] && !outwin[i]) rWin.push(i);
else if (!a[i] && outwin[i] < edg[i].size()) rWin.push(i);
}
}
while (!rWin.empty()){
int i = rWin.front();
rWin.pop();
if (!res[i]) continue;
res[i] = false;
for (int re : revedg[i]){
outwin[re]--;
if (!a[re] && outwin[re] == edg[re].size() - 1) rWin.push(re);
else if (a[re] && outwin[re] == 0) rWin.push(re);
}
}
return res;
}
/*
int main(){
auto ret = who_wins({0, 0, 0, 1, 1, 0, 1}, {0, 0, 0, 1, 1, 1, 0}, {0, 1, 1, 2, 3, 4, 5, 5, 6}, {0, 1, 2, 3, 3, 4, 5, 6, 6});
for (int i : ret) cout << i << " ";
return 0;
}*/
