#include <bits/stdc++.h>
#include "koala.h"
using namespace std;
int minValue(int N, int W) {
int B[N]{}, R[N];
B[0] = 1;
playRound(B, R);
int pos = 0;
for(int i=1; i<N; i++)
if(R[i] == 0)
pos = i;
return pos;
}
int maxValue(int N, int W) {
int B[N]{}, R[N];
vector<int> psbl;
for(int i=0;i<N;i++)
psbl.push_back(i);
while(psbl.size() > 1){
int x = W / psbl.size();
fill(B, B+N, 0);
for(auto i : psbl)
B[i] = x;
playRound(B, R);
psbl.clear();
for(int i=0;i<N;i++)
if(B[i] > x)
psbl.push_back(i);
}
return psbl[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.
}
}
