#include <bits/stdc++.h>
using namespace std;
//#define int long long
void playRound(int *B, int *R);
int minValue(int N, int W) {
int arr[100];fill(arr,arr+100,0);
int res[100];fill(res,res+100,0);
arr[0] = 1;
playRound(arr,res);
for(int i=0;i<N;i++)if(res[i]<=arr[i])return i;
}
int maxValue(int N, int W) {
vector<int> poss(N);iota(poss.begin(), poss.end(),0);
while(poss.size()>1){
int arr[100];fill(arr,arr+100,0);
int res[100];fill(res,res+100,0);
int distrib = W/poss.size();
for(int&i:poss)arr[i]=distrib;
playRound(arr,res);
poss.clear();
for(int i=0;i<N;i++)if(arr[i] and res[i]>arr[i])poss.emplace_back(i);
}
return poss[0];
}
bool lessth(int a,int b){
int lo = 1, hi = 16;
while (true) {
int mid = (lo + hi) / 2;
int arr[100];
fill(arr, arr + 100, 0);
int res[100];
fill(res, res + 100, 0);
arr[a] = arr[b] = mid;
playRound(arr, res);
bool zerogud = res[a] > arr[a];
bool onegud = res[b] > arr[b];
if (zerogud == onegud) {
if (zerogud) {
lo = mid + 1;
} else {
hi = mid - 1;
}
continue;
}
return onegud;
}
}
int greaterValue(int N, int W) {
return lessth(0,1);
}
void allValues(int N, int W, int *P) {
vector<int> permutation;
for(int i=0;i<N;i++){
int x = 0;
for(int jump=64;jump;jump/=2){
if(x+jump>permutation.size())continue;
if(lessth(permutation[x+jump-1],i))x+=jump;
}
permutation.insert(permutation.begin()+x,i);
}
for(int i=0;i<N;i++){
P[permutation[i]]=i+1;
}
return;
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.
}
}
