Submission #885616

#TimeUsernameProblemLanguageResultExecution timeMemory
885616PikachuKoala Game (APIO17_koala)C++17
4 / 100
3 ms628 KiB
#include <bits/stdc++.h> #include "koala.h" int minValue(int N, int W) { int B[100], R[100]; B[0] = 1; playRound(B, R); if (R[0] <= 1) return 0; for (int i = 1; i < 100; 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...