제출 #150204

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
150204		Dopatii (#200)	Bulb Game (FXCUP4_bulb)	C++17	0 / 100	2 ms	376 KiB

bulb

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

int wL[300005], wR[300005];
int TL[300005], TR[300005];
int l[300005], r[300005];
bool dfs(int nod, bool s){
    if(nod == -1 && s == 1) return 1;
    if(nod < 0) return 0;

    if(s == 0){
        bool ok1 = dfs(l[nod], 0);
        bool ok2 = dfs(r[nod], 1);
        return ok1 | ok2;
    }
    else{
        if(wL[nod] == -2 || wR[nod] == -2) return 0;
        if(nod == -2) return 0;
        return dfs(l[nod], 1);
    }
}

int FindWinner(int T, std::vector<int> L, std::vector<int> R){
	int N = L.size();
    for(int i = 0; i < N ; ++i) l[i] = L[i], r[i] = R[i];
	for(int i = 0; i < N ; ++i) TL[i] = TR[i] = -1;

    for(int i = 0; i < N ; ++i)
        if(L[i] >= 0) TL[L[i]] = i;

    for(int i = 0; i < N ; ++i)
        if(R[i] >= 0) TR[R[i]] = i;

    for(int i = 0; i < N ; ++i){
        if(L[i] >= 0) continue ;

        int nod = i;
        while(nod >= 0){
            wL[nod] = L[nod];
            nod = TL[nod];
        }
    }
    for(int i = 0; i < N ; ++i){
        if(R[i] >= 0) continue ;

        int nod = i;
        while(nod >= 0){
            wR[TR[nod]] = wL[nod];
            nod = TR[nod];
        }
    }

    if(wL[0] == -2) return 0;

    bool check = dfs(0, 0);

    if(!check) return 0;

    if(wR[0] == -2){
        bool check = dfs(R[0], 0);
        if(!check) return 0;
    }

	return 1;
}

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