#include <bits/stdc++.h>
using namespace std;
typedef int ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define ull unsigned int
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
#include "train.h"
bool ok[5005];
bool v[5005];
bool res[5005];
bool ans[5005];
vector<vll>adj;
vector<int> A;
bool solve(ll x,ll s){
v[x] = 1;
ans[i] = A[x] ^ 1;
for(auto X:adj[x]){
if(!v[X]){
if(A[x] == 1){
ans[i] |= solve(X,s);
}
else{
ans[i] &= solve(X,s);
}
}
else if(X == s){
if(A[x] == 1){
ans[i] |= 1;
}
else{
ans[i] &= 1;
}
}
else{
if(A[x] == 1){
ans[i] |= ans[X];
}
else{
ans[i] &= ans[X];
}
}
}
return ans[i];
}
bool kame(ll x){
v[x] = 1;
bool ans = A[x] ^ 1;
if(A[x] == ok[x] && ok[x] == 1){
ans = 1;
}
for(auto X:adj[x]){
if(!v[X]){
if(A[x] == 1){
ans |= ok[X];
}
else{
ans &= ok[X];
}
kame(X);
}
}
return ans;
}
vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
vector<int> res(a.size());
ll n = a.size();
ll m = u.size();
A = a;
adj.assign(n+5,vll());
f(i,0,m){
adj[u[i]].pb(v[i]);
}
f(i,0,n){
if(r[i] == 1){
f(j,0,n+5){
v[j] = 0;
ans[j] = 0;
}
ok[i] = solve(i,i);
}
}
f(i,0,n){
f(j,0,n+5){
v[j] = 0;
}
res[i] = kame(i);
}
return res;
}
/*
int main(){
int n, m;
assert(2 == scanf("%d %d", &n, &m));
vector<int> a(n), r(n), u(m), v(m);
for(int i = 0; i < n; i++)
assert(1 == scanf("%d", &a[i]));
for(int i = 0; i < n; i++)
assert(1 == scanf("%d", &r[i]));
for(int i = 0; i < m; i++)
assert(2 == scanf("%d %d", &u[i], &v[i]));
vector<int> res = who_wins(a, r, u, v);
for(int i = 0; i < (int)res.size(); i++)
printf(i ? " %d" : "%d", res[i]);
printf("\n");
return 0;
}
*/
Compilation message
train.cpp: In function 'bool solve(ll, ll)':
train.cpp:35:9: error: 'i' was not declared in this scope
35 | ans[i] = A[x] ^ 1;
| ^
