#include <bits/stdc++.h>
using namespace std;
#include "train.h"
#define fin(i,s,n) for(auto i = s; i < n; ++i)
#define fine(i,s,n) for(auto i = s; i <= n; ++i)
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define all(x) (x).begin(),(x).end()
#define chkmin(a,b) a = min(a,b)
#define chkmax(a,b) a = max(a,b)
using stdvec = vector<int>;
using ii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vii = vector<ii>;
#define sz(a) int((a).size())
const int maxn = 5005;
vi G[maxn],T[maxn],g[maxn];
bool vis[maxn];
int id[maxn],c[maxn],p[maxn];
vi lst;
void dfs(int u) {
if(vis[u]) return;
vis[u] = 1;
for(int v : G[u]) dfs(v);
lst.pb(u);
}
void mark(int u, int cid) {
if(!vis[u]) return;
vis[u] = 0,id[u] = cid;
for(int v : T[u]) mark(v,cid);
}
bool bdfs(int u) {
// cout << "bdfs("<<u<<") called\n";
if(c[u]) return /*cout << "cu 1\n",*/1;
if(vis[u]) return /*cout << "already been here\n",*/0;
vis[u] = 1;
int cnt = 0;
for(int v : g[u]) {
if(u==v)return /*cout<<"self loop, bdfs("<<u<<") returns 0\n",*/0;
cnt += bdfs(v);
}
// cout << "at "<<u<<",cnt="<<cnt<<",sz(g)="<<sz(g[u])<<endl;
if(cnt==sz(g[u])) return 1;
return 0;
}
vi who_wins(vi a, vi r, vi u, vi v) {
int n = a.size(),m = u.size();
vi lp(n,0),nxt(n,0);
fin(i,0,m) {
if(u[i]==v[i]) lp[u[i]]=1;
else nxt[u[i]] = 1;
}
fin(i,0,n) p[i]=a[i],c[i]=r[i];
vi dp(n+1,0);
for(int i = n-1; ~i; --i) {
if(p[i]) {
if((c[i]&&lp[i]) || (nxt[i]&&dp[i+1])) dp[i] = 1;
} else {
if(c[i]&&lp[i]&&!nxt[i]) dp[i] = 1;
else if(nxt[i]&&!lp[i]&&dp[i+1]) dp[i] = 1;
}
}
dp.pop_back();
return dp;
}
