# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
887843 | vjudge1 | Koala Game (APIO17_koala) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "koala.h"
#include<bits/stdc++.h>
using namespace std;
int minValue(int n, int w)
{
B[0] = 1;
fill(B+1, B+n, 0);
playRound(B, R, 0);
if(R[0] <= 1)
{
return 0;
}
for(int i = 1; i < n; i++)
{
if(!R[i])
{
return i;
}
}
}
int maxValue(int n, int w)
{
}
int greaterValue(int n, int w)
{
}
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.
}
}