#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 a[N], b[N];
a[0] = 1;
b[0] = 0;
for(int i = 1; i < N; i++) {
a[i] = 0;
b[i] = 0;
}
playRound(a, b);
/*for(int i = 0; i < N; i++) {
cout << b[i] << " ";
}
cout << endl;*/
if(b[0] < 2)
return 0;
for(int i = 1; i < N; i++) {
if(b[i] == 0) {
return i;
}
}
return 0;
}
int maxValue(int N, int W) {
int values[4] = {1, 2, 4, 11};
bool ok[N];
for(int i = 0; i < N; i++) {
ok[i] = true;
}
int a[N], b[N];
for(int temp = 0; temp < 4; temp++) {
for(int i = 0; i < N; i++) {
if(ok[i]) {
a[i] = values[temp];
}
else {
a[i] = 0;
}
}
playRound(a, b);
for(int i = 0; i < N; i++) {
if(b[i] <= a[i]) {
ok[i] = false;
}
}
int cnt = 0, idx = 0;
for(int i = 0; i < N; i++) {
if(ok[i]) {
cnt++;
idx = i;
}
}
if(cnt == 1)
return idx;
}
for(int i = 0; i < N; i++) {
if(ok[i])
return i;
}
// TODO: Implement Subtask 2 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
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.
}
}
