#include "koala.h"
#include <iostream>
#include <numeric>
#include <vector>
#include <algorithm>
#include <utility>
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.
return 0;
}
int maxValue(int n, int w) {
static int b[103], r[103];
vector<int> poss(n);
iota(poss.begin(), poss.end(), 0);
while(poss.size() > 1){
int x = min(13, (int)n / (int)poss.size());
fill(b, b + n, 0);
for(int pos: poss)
b[pos] = x;
playRound(b, r);
poss.clear();
for(int i = 0; i < n; ++i)
if(r[i] > x)
poss.push_back(i);
}
return poss[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.
}
}
