Submission #57331

#TimeUsernameProblemLanguageResultExecution timeMemory
57331fredbrKoala Game (APIO17_koala)C++17
4 / 100
12 ms576 KiB
#include "koala.h" #include <bits/stdc++.h> const int maxn = 110; int d[maxn], res[maxn]; int minValue(int N, int W) { d[0] = 1; playRound(d, res); if (res[0] == 0) return 0; for (int i = 1; i < N; i++) if (res[i] == 0) return i; return 0; } int maxValue(int N, int W) { 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...