Submission #57838

#TimeUsernameProblemLanguageResultExecution timeMemory
57838thiago4532Koala Game (APIO17_koala)C++17
4 / 100
10 ms668 KiB
#include "koala.h" int minValue(int N, int W) { int *R = new int[W]; int *B = new int[W]; for(int i=0;i<W;i++) B[i] = 0; B[0] = 1; playRound(B, R); for(int i=0;i<W;i++){ if(!R[i]) return i; } return 0; } 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) { // TODO: Implement Subtask 3 solution here. // You may leave this function unmodified if you are not attempting this // subtask. 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. } }
#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...