#include <bits/stdc++.h>
#include "koala.h"
int minValue(int N, int W) {
int B[100] = {}, R[100] = {};
B[0] = 1;
playRound(B, R);
for (int i = 0; i < N; ++i) {
if (R[i] <= B[i]) {
return i;
}
}
assert(false);
return -1;
}
int maxValue(int N, int W) {
int B[100] = {}, R[100] = {};
std::vector<int> cand(N);
std::iota(cand.begin(), cand.end(), 0);
while (cand.size() > 1) {
std::fill(B, B + N, 0);
for (const auto x: cand) {
B[x] = W / cand.size();
}
playRound(B, R);
std::vector<int> next;
for (const auto x: cand) {
if (R[x] > B[x]) {
next.push_back(x);
}
}
cand = std::move(next);
}
return cand[0];
}
int greaterValue(int N, int W) {
int B[100] = {}, R[100] = {};
}
void allValues(int N, int W, int *P) {
if (W == 2 * N) {
int B[100] = {}, R[100] = {};
const auto less = [&](const int i, const int j) {
B[i] = B[j] = W / 2;
playRound(B, R);
return R[j] > W / 2;
};
int order[100] = {};
std::iota(order, order + N, 0);
auto dfs = [&](auto&& dfs, const int l, const int r) -> void {
if (r - l == 1) return;
const auto m = (l + r) / 2;
dfs(dfs, l, m);
dfs(dfs, m, r);
std::inplace_merge(order + l, order + m, order + r, less);
};
dfs(dfs, 0, N);
for (int i = 0; i < N; ++i) {
P[order[i]] = i + 1;
}
} else {
// TODO: Implement Subtask 5 solution here.
// You may leave this block unmodified if you are not attempting this
// subtask.
}
}
