Submission #1028466

#TimeUsernameProblemLanguageResultExecution timeMemory
1028466vjudge1Koala Game (APIO17_koala)C++17
4 / 100
3 ms344 KiB
#include "koala.h" int minValue(int N, int W) { int me[100]{1},you[100]; playRound(me,you); for(int i=0;i<N;i++) if(you[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) { int me[100]{1,1},you[100]; playRound(me,you); return !you[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...