Submission #401087

#TimeUsernameProblemLanguageResultExecution timeMemory
401087jamezzzKoala Game (APIO17_koala)C++14
4 / 100
6 ms316 KiB
#include "koala.h" #include <bits/stdc++.h> using namespace std; int b[105],r[105]; int minValue(int N, int W) { memset(b,0,sizeof b); memset(r,0,sizeof r); b[0]=1; playRound(b,r); int ans=0; if(r[0]==2){ for(int i=0;i<N;++i)if(r[i]==0)ans=i; } return ans; } 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...