#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 b[N], r[N];
memset(b, 0, N*sizeof(int));
*b = 1;
playRound(b, r);
for(int i=0; i<N; i++){
if(i[r] <= i[b]){
return i;
}
}
return 0;
}
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];
fill(b, b+N, 1);
playRound(b, r);
for(int i=0; i<N; i++){
if(i[r] > i[b]){
i[b] = 2;
}
else{
i[b] = 0;
}
}
playRound(b, r);
for(int i=0; i<N; i++){
if(i[b] == 2 && i[r] > i[b]){
i[b] = 4;
}
else{
i[b] = 0;
}
}
playRound(b, r);
for(int i=0; i<N; i++){
if(i[b] == 4 && i[r] > i[b]){
i[b] = 11;
}
else{
i[b] = 0;
}
}
playRound(b, r);
for(int i=0; i<N; i++){
if(i[b] == 11 && i[r] > i[b]){
return i;
}
}
return -1;
}
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 -1;
}
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.
}
}
