#include "koala.h"
#include "bits/stdc++.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];
int R[N];
memset(B, 0, sizeof(B));
memset(R, 0, sizeof(R));
for(int i = 0; i < N; i++) B[i] = 1;
playRound(B, R);
/*for(int i = 0; i < N; i++) cout<<R[i]<<" ";
cout<<"\n";*/
for(int i = 0; i < N; i++) B[i] = R[i];
//cout<<"\n";
playRound(B, R);
/*for(int i = 0; i < N; i++) cout<<R[i]<<" ";
cout<<"\n";
for(int i = 0; i < N; i++) cout<<B[i]<<" ";
cout<<"\n";*/
int Respuesta = 0;
for(int i = 0; i < N; i++){
if(R[i] == 0 and B[i] == 0){
Respuesta = i;
break;
}
}
return Respuesta + 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.
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.
}
}
