#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
int minValue(int n, int w) {
int b[n], r[n];
memset(b, 0, sizeof(b));
b[0] = 1;
playRound(b, r);
for(int i = 0; i < n; i++)
if(r[i] == 0)
return i;
memset(b, 0, sizeof(b));
b[1] = 1;
playRound(b, r);
for(int i = 0; i < n; i++)
if(r[i] == 0)
return i;
return 0;
}
int maxValue(int n, int w) {
int b[n], r[n];
memset(b, 0, sizeof(b));
for(int i = 0; i < n; i++)
b[i] = 1;
playRound(b, r);
memset(b, 0, sizeof(b));
for(int i = 0; i < n; i++)
if(r[i] > 1)
b[i] = 2;
playRound(b, r);
memset(b, 0, sizeof(b));
for(int i = 0; i < n; i++)
if(r[i] > 1)
b[i] = 4;
playRound(b, r);
memset(b, 0, sizeof(b));
for(int i = 0; i < n; i++)
if(r[i] > 1)
b[i] = 11;
playRound(b, r);
for(int i = 0; i < n; i++)
if(r[i] > 1)
return i;
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.
}
}
