제출 #150961

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
150961	2019-09-01 13:11:08	dennisstar	Bulb Game (FXCUP4_bulb)	C++17	0 / 100	2 ms	376 KiB

bulb

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "bulb.h"
using namespace std;
vector<int> L, R;
int win[300010], chk[300010];
int ww[300010], cc[300010];
int N;
void f(int lev)
{
  chk[lev]=1;
  if (L[lev]>=0) {
    if (chk[L[lev]]) win[lev]=win[L[lev]];
    else {
      f(L[lev]);
      win[lev]=win[L[lev]];
    }
  }
  else win[lev]=L[lev];
  if (R[lev]>=0&&!chk[R[lev]]) f(R[lev]);
}
int ff(int lev)
{
  if (cc[lev]) return ww[lev];
  cc[lev]=1;
  if (R[lev]==-2||(R[lev]>=0&&win[R[lev]]==-2)) return 0;
  if (L[lev]<0||(L[lev]>=0&&ff(L[lev]))) return ww[lev]=1;
  return 0;
}
int FindWinner(int T, vector<int> l, vector<int> r){
  N = L.size();
  for (int i:l) L.push_back(i);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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