Submission #713597

#TimeUsernameProblemLanguageResultExecution timeMemory
713597tht2005Koala Game (APIO17_koala)C++17
4 / 100
4 ms208 KiB
#include "koala.h" #include <bits/stdc++.h> using namespace std; const int N = 102; int B[N], R[N]; int minValue(int N, int W) { memset(B, 0, N * sizeof *B); B[0] = 1; playRound(B, R); for(int i = 0; i < N; ++i) { if(R[i] <= B[i]) { return i; } } } int maxValue(int N, int W) { return 0; } int greaterValue(int N, int W) { return 0; } 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 minValue(int, int)':
koala.cpp:20:1: warning: control reaches end of non-void function [-Wreturn-type]
   20 | }
      | ^
#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...