#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];
for(int i=0; i<N; i++) B[i]=0;
B[0]=1;
playRound(B, R);
for(int i=1; i<N; i++) if(R[i]==0) 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];
bool b[N];
for(int i=0; i<N; i++){
b[i]=true;
B[i]=1;
}
playRound(B, R);
for(int i=0; i<N; i++){
if(R[i]<=B[i]) b[i]=false;
}
for(int i=0; i<N; i++){
if(b[i]){
B[i]=2;
}else{
B[i]=0;
}
}
playRound(B, R);
for(int i=0; i<N; i++){
if(R[i]<=B[i]) b[i]=false;
}
for(int i=0; i<N; i++){
if(b[i]){
B[i]=4;
}else{
B[i]=0;
}
}
playRound(B, R);
for(int i=0; i<N; i++){
if(R[i]<=B[i]) b[i]=false;
}
for(int i=0; i<N; i++){
if(b[i]){
B[i]=11;
}else{
B[i]=0;
}
}
playRound(B, R);
for(int i=0; i<N; i++){
if(R[i]<=B[i]) b[i]=false;
}
for(int i=1; i<N; i++) if(b[i]) 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.
}
}
