Submission #154080

#TimeUsernameProblemLanguageResultExecution timeMemory
154080stefantagaBulb Game (FXCUP4_bulb)C++17
0 / 100
3 ms504 KiB
#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=0; 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==0) { 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; } } } /// -2 este albastru , -1 este rosu. Primul vrea rosu ,Al doilea vrea albastru

Compilation message (stderr)

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]
 }
 ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...