Submission #1246302

#TimeUsernameProblemLanguageResultExecution timeMemory
1246302SpyrosAlivKoala Game (APIO17_koala)C++20
4 / 100
3 ms408 KiB
#include "koala.h" #include <bits/stdc++.h> using namespace std; int minValue(int N, int W) { int n = N; int w = W; int willAsk[n], ret[n]; willAsk[0] = 1; for (int i = 1; i < n; i++) willAsk[i] = 0; playRound(willAsk, ret); int zero = 0; for (int i = 1; i < n; i++) { if (ret[i] == 0) { zero = i; } } return zero; } 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...