Submission #150371

#	Time^UTC-0	Username	Problem	Language	Result	Execution time	Memory
150371	2019-09-01 08:14:28	준표야 함수컵은 캐리해줄거지? (#200)	Bulb Game (FXCUP4_bulb)	C++17	0 / 100	6 ms	5044 KiB

This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.

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"
#include <vector>
#include <string.h>
using namespace std;
const int MAXN = 300003;
int dp[MAXN][2][2];
int dfs(int cur, int f, int t, vector<int> &L, vector<int> &R) {
  
  if(cur<0) {
    return cur==-1;
  }
  
  int &ret = dp[MAXN][f][t];
  if(ret!=-1) return ret;
  
  ret = 0;
  if(!f) {
    ret |= max(dfs(L[cur], !f, t, L, R), dfs(L[cur], f, t, L, R));
  }
  else {
    ret |= max(dfs(L[cur], !f, (t+1)%2, L, R), dfs(L[cur], f, (t+1)%2, L, R));
  }
  
  if(!f) {
    ret |= max(dfs(R[cur], !f, (t+1)%2, L, R), dfs(R[cur], f, (t+1)%2, L, R));
  }
  else {
    ret |= max(dfs(R[cur], !f, t, L, R), dfs(R[cur], f, t, L, R));
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

bulb.cpp: In function 'int FindWinner(int, std::vector<int>, std::vector<int>)':
bulb.cpp:37:6: warning: unused variable 'N' [-Wunused-variable]
  int N = L.size();
      ^
bulb.cpp: In function 'int dfs(int, int, int, std::vector<int>&, std::vector<int>&)':
bulb.cpp:15:20: warning: array subscript is above array bounds [-Warray-bounds]
  int &ret = dp[MAXN][f][t];
             ~~~~~~~^
bulb.cpp: In function 'int dfs(int, int, int, std::vector<int>&, std::vector<int>&)':
bulb.cpp:15:20: warning: array subscript is above array bounds [-Warray-bounds]
bulb.cpp:15:20: warning: array subscript is above array bounds [-Warray-bounds]
bulb.cpp:15:20: warning: array subscript is above array bounds [-Warray-bounds]
bulb.cpp:15:20: warning: array subscript is above array bounds [-Warray-bounds]
bulb.cpp:15:20: warning: array subscript is above array bounds [-Warray-bounds]
bulb.cpp:15:20: warning: array subscript is above array bounds [-Warray-bounds]
bulb.cpp:15:20: warning: array subscript is above array bounds [-Warray-bounds]
bulb.cpp:15:20: warning: array subscript is above array bounds [-Warray-bounds]
bulb.cpp:15:20: warning: array subscript is above array bounds [-Warray-bounds]
bulb.cpp:15:20: warning: array subscript is above array bounds [-Warray-bounds]
bulb.cpp: In function 'int FindWinner(int, std::vector<int>, std::vector<int>)':
bulb.cpp:15:20: warning: array subscript is above array bounds [-Warray-bounds]
  int &ret = dp[MAXN][f][t];
             ~~~~~~~^

Subtask 10 / 11

#	Verdict	Execution time	Memory	Grader output
Fetching results...

Subtask 20 / 25

#	Verdict	Execution time	Memory	Grader output
Fetching results...

Subtask 30 / 64

#	Verdict	Execution time	Memory	Grader output
Fetching results...