#include "koala.h"
#include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int minValue(int N, int W) {
int n=N;
int tab[N];
int ans[N];
memset(tab,0,sizeof tab);
tab[0]=1;
playRound(tab,ans);
int res=-1;
for (int i = 0; i < n; ++i)
{
if(ans[i]==0) res=i;
}
if(res!=-1) return res;
tab[0]=0;
tab[1]=1;
playRound(tab,ans);
for (int i = 0; i < n; ++i)
{
if(ans[i]==0) res=i;
}
return res;
}
int maxValue(int N, int W) {
int n=N;
cout <<N<<" "<<W<<endl;
int tab[n];
int cur[n];
int still[n];
for (int i = 0; i < n; ++i) still[i]=1;
for (int i = 0; i < n; ++i) tab[i]=1;
int cnt=1;
int h[4]={1,2,4,11};
while(cnt<5){
playRound(tab,cur);
for (int i = 0; i < n; ++i)
{
if(cur[i]>h[cnt-1]) still[i]=1;
else still[i]=0;
if(still[i]==1) tab[i]=h[cnt];
else tab[i]=0;
}
cnt++;
}
int res;
for (int i = 0; i < n; ++i)
{
if(still[i]==1) res=i;
}
return res;
}
int greaterValue(int N, int W) {
// TODO: Implement Subtask 3 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
return 0;
}
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.
}
}
