#include "koala.h"
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 b[N], r[N];
b[0] = 1;
for (int i = 1;i < N;i++) b[i] = 0;
playRound(b, r);
if (r[0] < 2) return 0;
for (int i = 1;i < N;i++) {
if (r[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 b[N], r[N];
for (int i = 0;i < N;i++) b[i] = 1;
int ans = -1;
while (ans == -1) {
playRound(b, r);
int cnt = 0;
for (int i = 0;i < N;i++) {
if (b[i] == 1) {
if (r[i] < 2) b[i] = 0;
else {
cnt++;
if (cnt == 1) ans = i;
else ans = -1;
}
}
}
}
return ans;
}
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.
}
}
