#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9;
ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<int,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"
ll comp[5005];
bool v[5005];
vector<vll>adj;
vll nodes;
ll maxi = 0;
void solve(ll idx){
maxi = max(maxi,idx);
node.pb(idx);
for(auto x:adj[idx]){
if(!v[x]){
v[x] = 1;
solve(x);
}
}
}
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();
adj.assign(n+5,vll());
f(i,0,m){
adj[u[i]].pb(v[i]);
}
f(i,0,n){
vll neo;
assert(adj[i].size() <= 2);
if(adj[i].size() == 2){
sort(all(adj[i]));
if((a[i] && r[i]) || (!a[i] && !r[i])){
neo.pb(adj[i][0]);
}
else{
neo.pb(adj[i][1]);
}
}
else{
neo = adj[i];
}
adj[i] = neo;
}
f(i,0,n){
if(!v[i]){
v[i] = 1;
nodes.clear();
maxi = 0;
solve(i);
for(auto x:nodes){
comp[x] = maxi;
}
}
}
f(i,0,n){
res[i] = r[comp[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 'void solve(ll)':
train.cpp:33:5: error: 'node' was not declared in this scope; did you mean 'nodes'?
33 | node.pb(idx);
| ^~~~
| nodes
