Submission #68623

#TimeUsernameProblemLanguageResultExecution timeMemory
68623KLPPKoala Game (APIO17_koala)C++14
4 / 100
9 ms804 KiB
#include "koala.h" int minValue(int N, int W) { int arr[N]; for(int i=0;i<N;i++)arr[i]=0; arr[0]=1; int R[N]; playRound(arr,R); if(R[0]<2){ return 0; }else{ for(int i=0;i<N;i++){ if(R[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) { // 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...