#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
int minValue(int N, int W) {
// TODO: Implement Subtask 1 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
int v[N],res[N];
for(int i = 0;i<N;i++)v[i]=res[i]=0;
v[0] = 1;
playRound(v,res);
for(int i = 0;i<N;i++) if(res[i]==0)return i;
return 0;
}
int maxValue(int N, int W) {
int n = N;
// TODO: Implement Subtask 2 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
int v[N],res[N];
for(int i = 0;i<N;i++)v[i]=1,res[i]=0;
while(1) {
playRound(v,res);
int mx = 0, cnt = 0, idx = 0;
for(int i = 0;i<n;i++) {
if(res[i] > mx) {
mx = res[i];
cnt=1;
idx = i;
} else if(res[i] == mx)cnt++;
}
if(cnt==1){
return idx;
}
for(int i = 0;i<n;i++) {
v[i] = (res[i] == mx ? res[i] : 0);
}
}
return 0;
}
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.
}
}
