Submission #957421

#TimeUsernameProblemLanguageResultExecution timeMemory
957421salmonKoala Game (APIO17_koala)C++14
4 / 100
3 ms448 KiB
#include <bits/stdc++.h> #include "koala.h" int minValue(int N, int W) { int res[N]; int in[N]; for(int i = 0; i < N; i++){ in[i] = 0; } in[0] = 1; playRound(in,res); int p = -1; for(int i = 0; i < N; i++){ if(res[i] <= in[i]){ p = i; } } return p; } 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...