Submission #775000

#TimeUsernameProblemLanguageResultExecution timeMemory
775000arayiKoala Game (APIO17_koala)C++17
4 / 100
4 ms256 KiB
#include "koala.h" #include <bits/stdc++.h> using namespace std; int minValue(int n, int w) { // TODO: Implement Subtask 1 solution here. // You may leave this function unmodified if you are not attempting this // subtask. int *b = new int[n]; int *r = new int[n]; for (int i = 0; i < n; i++) { b[i] = 0; } b[0] = 1; playRound(b, r); int ans = 0; if (r[0] <= 1) ans = 0; else { for (int i = 0; i < n; i++) { if (r[i] == 0) { ans = i; break; } } } delete b; delete r; return ans; } 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...