This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "bulb.h"
using namespace std;
int n;
vector<int> l, r;
vector<int> ans;
void update(int lx, int rx, int v) {
	ans[lx] += v;
	ans[rx + 1] -= v;
}
int dfs(int cur, int f, int s, int cnt) {
	if (cur == -1)
		return 0;
	if (cur == -2) {
		if (f == -1)
			return 0;
		else if (s == -1) {
			if (cnt == n)
				return 0;
			update(0, n - 1, 1);
			update(f, f, 1);
			return 1;
		}
		update(f, f, 1);
		update(s, s, 1);
		return 0;
	}
	int tmp = 0;
	tmp += dfs(l[cur], f, s, cnt + 1);
	int nf = f, ns = s;
	if (ns == -1) {
		if (nf == -1)
			nf = cur;
		else
			ns = cur;
		tmp += dfs(r[cur], f, s, cnt + 1);
	}
	update(cur, cur, -tmp);
	return tmp;
}
int FindWinner(int T, std::vector<int> L, std::vector<int> R){
	n = (int)L.size();
	l = L;
	r = R;
	ans.resize(n + 1);
	dfs(0, -1, -1, 0);
	for (int i = 1; i < n; i++)
		ans[i] += ans[i - 1];
	for (int i = 0; i < n; i++) {
		if (!ans[i])
			return 1;
	}
	return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |