# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1260207 | arashmemar | Koala Game (APIO17_koala) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "koala.h"
using namespace std;
int minValue(int N, int W) {
if (w != 100)
{
return 0;
}
int r[N];
playRound({0}, r);
if (r[0] < 2)
{
return 0;
}
for (int i = 1;i < N;i++)
{
if (r[i] == 0)
{
return i;
}
}
}
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.
}
}