Submission #810322

#TimeUsernameProblemLanguageResultExecution timeMemory
810322oscar1fKoala Game (APIO17_koala)C++17
4 / 100
3 ms288 KiB
#include<bits/stdc++.h> #include "koala.h" using namespace std; int minValue(int N, int W) { vector<int> rep(N),quest(N); quest[0]=1; playRound(quest.data(),rep.data()); for (int i=1;i<N;i++) { if (rep[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...