#include "koala.h"
#include<bits/stdc++.h>
using namespace std;
mt19937 rng(243987);
int minValue(int N, int W) {
int me[100]{1},you[100];
playRound(me,you);
for(int i=0;i<N;i++)
if(you[i]==0)
return i;
return 0;
}
int maxValue(int N, int W) {
int me[100],you[100];
vector<int>theposs(N);
iota(theposs.begin(),theposs.end(),0);
while(theposs.size()>1){
memset(me,0,sizeof me);
for(auto i:theposs)
me[i]=W/theposs.size();
playRound(me,you);
vector<int>theposs2;
for(auto i:theposs)
if(you[i])theposs2.push_back(i);
theposs=theposs2;
}
return theposs[0];
}
int maxValue2(set<int>theposs, int W) {
int me[100],you[100], ORIG=theposs.size();
while(theposs.size()>1){
memset(me,0,sizeof me);
for(auto i:theposs)
me[i]=(W+theposs.size()-ORIG)/theposs.size();
playRound(me,you);
set<int>theposs2;
for(auto i:theposs)
if(you[i])theposs2.insert(i);
theposs=theposs2;
}
return *theposs.begin();
}
int greaterValue(int N, int W) {
int me[100]{1,1},you[100];
int L=1,R=min(W/2,8);
while(L<=R){
int mid=L+R>>1;
me[0]=mid;
me[1]=mid;
playRound(me,you);
if(you[0]-you[1])
return cerr<<mid,!you[0];
if(you[0])
L=mid+1;
else R=mid-1;
}
return 0;
}
int lst[101];
int greaterValue2(int A,int B) {
if(lst[A]-lst[B])
return lst[A]<lst[B];
int me[100]{},you[100];
me[A]=lst[A];me[B]=lst[B];
playRound(me,you);
return !you[A];
}
void allValues(int N, int W, int *P) {
for(int i=0;i<N;i++){
int l=1,r=8;
while(l<=r){
int mid=l+r+1>>1;
int me[100]{},you[100];
me[i]=mid;
playRound(me,you);
if(you[i])
lst[i]=mid,l=mid+1;
else r=mid-1;
}
}
vector<int>v(N);
iota(v.begin(),v.end(),0);
int K=maxValue(N,W);
swap(v[0],v[K]);
stable_sort(v.begin()+1,v.end(),[](int a,int b){
return !greaterValue2(a,b);
});
for(int i=0;i<N;i++)
P[v[i]]=N-i;
}
