Submission #406867

#TimeUsernameProblemLanguageResultExecution timeMemory
406867benedict0724Koala Game (APIO17_koala)C++17
4 / 100
5 ms200 KiB
#include "koala.h" int B[100], R[100]; void initialize(int N) { for(int i=0;i<N;i++) { B[i] = 0; R[i] = 0; } return; } int minValue(int N, int W) { initialize(N); B[0] = 1; playRound(B, R); int ans = 0; for(int i=1;i<N;i++) { if(R[i] == 0) ans = i; } return ans; } int maxValue(int N, int W) { // TODO: Implement Subtask 2 solution here. // You may leave this function unmodified if you are not attempting this // subtask. return 0; } int greaterValue(int N, int W) { int l = 1, r = 7; while(l <= r) { initialize(N); int mid = (l + r)/2; B[0] = B[1] = mid; playRound(B, R); if(R[0] != R[1]) { return (R[0] == 0) ? 1 : 0; } if(R[0] == 0) r = mid-1; else l = mid+1; } } void allValues(int N, int W, int *P) { if (W == 2*N) { // TODO: Implement Subtask 4 solution here. // You may leave this block unmodified if you are not attempting this // subtask. } else { // TODO: Implement Subtask 5 solution here. // You may leave this block unmodified if you are not attempting this // subtask. } }

Compilation message (stderr)

koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:50:1: warning: control reaches end of non-void function [-Wreturn-type]
   50 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...