#include "koala.h"
int B[100], R[100];
int minValue(int N, int W) {
B[99] = 1;
playRound(B, R);
for(int i=0; i<N; i++){
if(R[i]==0){
return i;
}
}
return 99;
}
int maxValue(int N, int W) {
for(int i=0; i<N; i++){
B[i] = 1;
}
playRound(B, R);
for(int i=0; i<N; i++){
if(R[i]==2){
B[i] = 2;
}else{
B[i] = 0;
}
}
playRound(B, R);
int cnt = 25;
for(int i=0; i<N; i++){
if(R[i]>=3){
B[i] = 3;
}else if(B[i]!=0 && cnt>0){
B[i] = 1;
cnt--;
}else B[i] = 0;
}
playRound(B, R);
for(int i=0; i<N; i++){
if(R[i]>=4){
B[i] = 13;
}else B[i] = 0;
}
playRound(B, R);
for(int i=0; i<N; i++){
if(R[i]>=14){
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 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.
}
}
