Submission #150789

#	Time	Username	Problem	Language	Result	Execution time	Memory
150789		먀 (#200)	Bulb Game (FXCUP4_bulb)	C++17	36 / 100	87 ms	10040 KiB

bulb

#include "bulb.h"
#include<bits/stdc++.h>
using namespace std;

const int N = 300005;

int n, ans[N][2], d[N];
vector<int> l, r;

bool ini[N];

bool getini (int I) {
	if(I < 0) return I == -1;
	return ini[I];
}

bool solve (int I, int V) {
	if(V < 0) return false;
	if(I < 0) return (V == 0);
	if(ans[I][V]) return ans[I][V] - 1;
	if(getini(r[I])) ans[I][V] |= solve(l[I], V);
	if(getini(l[I])) ans[I][V] |= solve(r[I], V-1);
	ans[I][V]++;
	return ans[I][V] - 1;
}

void calc (int I, int D) {
	if(I < 0) return;
	calc(l[I], D);
	calc(r[I], D+1);
	ini[I] = getini(l[I]);
	d[I] = D;
}

int FindWinner(int T, vector<int> L, vector<int> R){
	n = L.size();
	l = L; r = R;
	calc(0, 0);
	if(solve(0, 1)) return true;
	for(int i=0;i<n;i++) {
		if(d[i] > 1) return solve(0, 0);
	}
	return false;
}

• Subtask 1: 11 / 11
• Subtask 2: 25 / 25
• Subtask 3: 0 / 64