Submission #95795

#TimeUsernameProblemLanguageResultExecution timeMemory
95795Bodo171Koala Game (APIO17_koala)C++14
4 / 100
5 ms504 KiB
#include "koala.h" #include <iostream> using namespace std; const int nmax=105; int a[nmax],b[nmax]; int minValue(int N, int W) { a[0]=1; playRound(a,b); for(int i=0;i<N;i++) if(!b[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...