#include<bits/stdc++.h>
#include "koala.h"
using namespace std;
vector<int> init(100);
vector<int> jouer(vector<int> a) {
vector<int> b(100);
playRound(a.data(),b.data());
return b;
}
int minValue(int N, int W) {
vector<int> rep(N),quest(N);
quest[0]=1;
rep=jouer(quest);
for (int i=1;i<N;i++) {
if (rep[i]==0) {
return i;
}
}
return 0;
}
int maxValue(int N, int W) {
vector<int> rep(N),quest(N);
vector<int> listeGrand,nouv;
int nbMis;
for (int i=0;i<N;i++) {
quest[i]=1;
listeGrand.push_back(i);
}
vector<int> tailleTour={1,2,4,11};
reverse(tailleTour.begin(),tailleTour.end());
while (listeGrand.size()>1) {
/*cout<<listeGrand.size()<<" : ";
for (int i:listeGrand) {
cout<<i<<" ";
}
cout<<endl;*/
nbMis=tailleTour.back();
tailleTour.pop_back();
nouv.clear();
quest=init;
for (int i:listeGrand) {
quest[i]=nbMis;
}
rep=jouer(quest);
for (int i:listeGrand) {
if (rep[i]>nbMis) {
nouv.push_back(i);
}
}
listeGrand=nouv;
}
return listeGrand.back();
}
int greaterValue(int N, int W) {
vector<int> rep(N),quest(N);
int deb=1,fin=13,mid;
while (1>0) {
mid=(deb+fin)/2;
quest[0]=mid;
quest[1]=mid;
rep=jouer(quest);
if (rep[0]>mid and rep[1]<=mid) {
return 0;
}
if (rep[1]>mid and rep[0]<=mid) {
return 1;
}
if (rep[0]>mid) {
deb=mid+1;
}
else {
fin=mid-1;
}
}
return 42;
}
void allValues(int N, int W, int *P) {
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.
}
}
