#include <bits/stdc++.h>
#include "koala.h"
// #pragma GCC optimize ("O3")
// #pragma GCC target ("sse4")
using namespace std;
// #define int long long int
// const int N = 1e6 + 10;
// const int md = 1e9 + 7;
// const int INF = 1e18;
int minValue(int N, int W) {
int v[N], a[N];
for (int i = 0; i < N; i++)
v[i] = a[i] = 0;
v[0] = 1;
playRound(v, a);
for (int i = 0; i < N; i++)
if (a[i] == 0) return i;
return 0;
}
int maxValue(int N, int W) {
int a[N];
for (int i = 0; i < N; i++)
a[i] = 1;
int cnt = 100, ans = 0, t = 1;
while (cnt != 1) {
int v[N];
for (int i = 0; i < N; i++)
if (a[i] == t) v[i] = t, ans = i;
else v[i] = 0;
for (int i = 0; i < N; i++)
a[i] = 0;
playRound(v, a);
t++; cnt = 0;
for (int i = 0; i < N; i++) {
if (a[i] == t) {
ans = i;
cnt++;
}
}
}
return ans;
}
int greaterValue(int n, int w) {
int ans = 0;
int l = -1, r = 20;
while (r - l > 1) {
int mid = (l + r) >> 1;
int v[n], a[n];
for (int i = 0; i < n; i++)
v[i] = a[i] = 0;
v[0] = v[1] = mid;
playRound(v, a);
if (a[0] == mid + 1 && a[1] == mid + 1)
l = mid;
else if (!a[0] && !a[1])
r = mid;
else {
if (a[0] == mid + 1)
ans = 0;
else ans = 1;
break;
}
}
return ans;
}
void allValues(int n, int w, int *p) {
return;
}
// int32_t main(int32_t argc, char *argv[]) {
// ios::sync_with_stdio(false);
// cin.tie(nullptr);
// int T = 1;
// // cin >> T;
// while (T--) {
// }
// return 0;
// }
