#include "bulb.h"
#include <vector>
#include <string.h>
#include <algorithm>
using namespace std;
const int MAXN = 300003;
int dp[MAXN][2][2];
int dfs(int cur, int f, int t, vector<int> &L, vector<int> &R) {
if(cur<0) {
if(t==0) return cur==-1;
return 0;
}
int &ret = dp[MAXN][f][t];
if(ret!=-1) return ret;
ret = 0;
if(!f) {
if(t) {
ret |= max(dfs(L[cur], !f, t, L, R),
dfs(L[cur], f, (t+1)%2, L, R)
);
}
else {
ret |= min(dfs(L[cur], !f, t, L, R),
dfs(L[cur], f, (t+1)%2, L, R)
);
}
}
else {
if(t) {
ret |= max(dfs(L[cur], !f, (t+1)%2, L, R),
dfs(L[cur], f, (t+2)%2, L, R)
);
}
else {
ret |= min(dfs(L[cur], !f, (t+1)%2, L, R),
dfs(L[cur], f, (t+2)%2, L, R)
);
}
}
if(!f) {
if(t) {
ret |= max(dfs(R[cur], !f, (t+1)%2, L, R),
dfs(R[cur], f, (t+2)%2, L, R)
);
}
else {
ret |= min(dfs(R[cur], !f, (t+1)%2, L, R),
dfs(R[cur], f, (t+2)%2, L, R)
);
}
}
else {
if(t) {
ret |= max(dfs(R[cur], !f, t, L, R),
dfs(R[cur], f, (t+1)%2, L, R)
);
}
else {
ret |= min(dfs(R[cur], !f, t, L, R),
dfs(R[cur], f, (t+1)%2, L, R)
);
}
}
return ret;
}
int FindWinner(int T, vector<int> L, vector<int> R){
int N = L.size();
memset(dp, -1, sizeof(dp));
T%=2;
int ans = dfs(0, 0, T, L, R);
return ans==1;
}
