oj.uz

답안 #154081

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
154081 2019-09-18T10:13:59 Z stefantaga Bulb Game (FXCUP4_bulb) C++17
0 / 100
 3 ms 504 KB 
#include <bits/stdc++.h>
#include "bulb.h"
using namespace std;
struct bec
{
    int st,dr;
}val[300005];
bool notbec (int nr)
{
    if (nr==-1||nr==-2)
    {
        return 0;
    }
    return 1;
}
void dfs (int x,vector <int> l,vector <int> r)
{
    if (notbec(l[x]))
    {
        dfs(l[x],l,r);
        val[x].st=val[l[x]].st;
    }
    else
    {
        val[x].st=l[x];
    }
    if (notbec(r[x]))
    {
        dfs(r[x],l,r);
        val[x].dr=val[r[x]].st;
    }
    else
    {
        val[x].dr=r[x];
    }
}
int FindWinner(int t,vector<int> l,vector<int> r)
{
	int n= l.size(),poz,poz1,q,ok,ok1,pozitie;
	poz=0;
	while (poz!=-1&&poz!=-2)
    {
        poz=l[poz];
    }
    if (poz==-2)
    {
    return 0;
    }
    else
    {
        dfs(0,l,r);
        poz=0;
        q=0;
        ok=0;
        ok1=0;
        pozitie=-1;
        while (notbec(poz))
        {
            poz1=r[poz];

            while (notbec(poz1))
            {
                if (val[r[poz1]].st==-1)
                {
                    ok=1;
                    break;
                }
                poz1=l[poz1];
            }
            if (val[r[poz]].st==-2)
            {
                if (pozitie==-1)
                {
                    pozitie=poz;
                }
                ok1=1;
            }
            poz=l[poz];
        }
        if (ok1==0)
        {
            if (ok==1)
            {
                return 1;
            }
            else
            {
                return 0;
            }
        }
        else
        if (ok1==1)
        {
            poz=l[pozitie];
            while (notbec(poz)==1)
            {
                if (val[r[poz]].st==-2)
                {
                    return 0;
                }
                poz=l[poz];
            }
            poz=r[pozitie];
            while (notbec(poz)==1)
            {
                if (val[r[poz]].st==-1)
                {
                    return 1;
                }
                poz=l[poz];
            }
            return 1;
        }
    }
}

Compilation message

bulb.cpp: In function 'int FindWinner(int, std::vector<int>, std::vector<int>)':
bulb.cpp:39:6: warning: unused variable 'n' [-Wunused-variable]
  int n= l.size(),poz,poz1,q,ok,ok1,pozitie;
      ^
bulb.cpp:39:27: warning: variable 'q' set but not used [-Wunused-but-set-variable]
  int n= l.size(),poz,poz1,q,ok,ok1,pozitie;
                           ^
bulb.cpp:115:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 3 ms 504 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 64.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -