Submission #255194

#TimeUsernameProblemLanguageResultExecution timeMemory
255194Osama_AlkhodairyKoala Game (APIO17_koala)C++17
0 / 100
1 ms360 KiB
#include <bits/stdc++.h> #include "koala.h" //~ #include "grader.cpp" using namespace std; int minValue(int N, int W) { int B[N], R[N]; B[0]++; playRound(B, R); for(int i = 0 ; i < N ; i++){ if(B[i] >= 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...