#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 !you[0];
if(you[0])
L=mid+1;
else R=mid-1;
}
}
int greaterValue2(int A,int B) {
int me[100]{},you[100];
int L=2,R=8;
while(L<=R){
int mid=L+R>>1;
me[A]=mid;
me[B]=mid;
playRound(me,you);
if(you[A]-you[B])
return !you[A];
if(you[A])
L=mid+1;
else R=mid-1;
}
me[A]=1,me[B]=1;
playRound(me,you);
return !you[A];
}
vector<int>mergesort(vector<int>a){
if(a.size()==1) return a;
vector<int>a2,b2;
shuffle(a.begin(),a.end(),rng);
for(int i=0;i<a.size()/2;i++)
a2.push_back(a[i]);
for(int i=a.size()/2;i<a.size();i++)
b2.push_back(a[i]);
a2=mergesort(a2);
b2=mergesort(b2);
vector<int>finals;
int l=0,r=0;
while(l<a2.size()&&r<b2.size()){
if(greaterValue2(a2[l],b2[r])) {
finals.push_back(b2[r++]);
} else {
finals.push_back(a2[l++]);
}
}
while(l<a2.size())
finals.push_back(a2[l++]);
while(r<b2.size())
finals.push_back(b2[r++]);
return finals;
}
void allValues(int N, int W, int *P) {
vector<int>v(N);
iota(v.begin(),v.end(),0);
v=mergesort(v);
for(int i=0;i<N;i++)
P[v[i]]=N-i;
}
