#include <bits/stdc++.h>
#include "koala.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 A[N],B[N];
for(int i=0;i<N;i++){
A[i] = 0,B[i] = 0;
}
A[0] = 1;
playRound(A,B);
for(int i=0;i<N;i++){
if(B[i] == 0)
return i;
}
return -1;
}
int maxValue(int N, int W) {
// TODO: Implement Subtask 2 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
int A[N],B[N];
for(int i=0;i<N;i++){
A[i] = 1,B[i] = 0;
}
playRound(A,B);
vector<int> possidx;
for(int i=0;i<N;i++)
if(B[i] > A[i])
possidx.push_back(i);
int x = 1;
while(possidx.size() > 1){
x++;
for(int i=0;i<N;i++){
A[i] = 0;
}
for(auto idx : possidx){
A[idx] = x;
}
playRound(A,B);
possidx.clear();
for(int i=0;i<N;i++){
if(B[i] > A[i])
possidx.push_back(i);
}
}
return possidx.back();
}
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.
}
}
