Submission #53056

#TimeUsernameProblemLanguageResultExecution timeMemory
53056arthur_nascimentoKoala Game (APIO17_koala)C++14
4 / 100
10 ms580 KiB
#include "koala.h" int minValue(int N, int W) { int v[N]; v[0] = 1; for(int i=1;i<N;i++) v[i] = 0; int ans[N]; playRound(v,ans); for(int i=0;i<N;i++) if(ans[i] == 0) 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...