Submission #150024

#	Time	Username	Problem	Language	Result	Execution time	Memory
150024		Weeeee (#200)	Bulb Game (FXCUP4_bulb)	C++17	0 / 100	2 ms	376 KiB

bulb

#include "bulb.h"
#include <bits/stdc++.h>

using namespace std;

const int Nmax = 3e5 + 5;
bool bad = 0;
int v1[Nmax], v2[Nmax];

void dfs(int node, vector<int> &L, vector<int> &R, int e1, int e2, int e3)
{
    if(node == -1)
        return;

    if(node == -2)
    {
        if(e1 == -1) bad = 1;
        else
        if(e2 == -1) v1[e1]++;
            else
                if(e3 == -1)
                {
                    v2[e1]++;
                    v2[e2]++;
                }
        return;
    }

    dfs(L[node], L, R, e1, e2, e3);

    if(e1 == -1) e1 = node;
        else if(e2 == -1) e2 = node;
            else if(e3 == -1) e3 = node;

    dfs(R[node], L, R, e1, e2, e3);
}

int FindWinner(int T, std::vector<int> L, std::vector<int> R)
{
    int n = L.size();
    int e1 = -1, e2 = -1, e3 = -1;

    dfs(0, L, R, e1, e2, e3);

    int i;

    if(bad) return 0;

    int total = 0;
    for(i=0; i<n; ++i) total += v1[i];

    for(i=0; i<n; ++i)
    {
        if(v2[i]) continue;
        if(total - v1[i] > 0) continue;
        //cerr << i << '\n';
        return 1;
    }

	return 0;
}

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