Submission #51187

#TimeUsernameProblemLanguageResultExecution timeMemory
51187TAMREFKoala Game (APIO17_koala)C++11
4 / 100
8 ms476 KiB
#include "koala.h" #include <bits/stdc++.h> using namespace std; int B[105], R[105]; int minValue(int N, int W) { B[0] = 1; playRound(B,R); return (R[0] ? min_element(R,R+N) - R : 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...