Submission #501061

#TimeUsernameProblemLanguageResultExecution timeMemory
501061StickfishKoala Game (APIO17_koala)C++17
0 / 100
3 ms272 KiB
#include "koala.h" const int MAXN = 101; int b[MAXN]; int r[MAXN]; int minValue(int N, int W) { b[1] = 1; for (int i = 2; i <= N; ++i) b[i] = 0; playRound(b, r); for (int i = 1; i <= N; ++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...