#include "koala.h"
#include <vector>
#include <set>
#include <iostream>
#include <map>
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.
return 0;
}
int maxValue(int n, int w) {
int* b=new int[n];
int* r=new int[n];
for(int i=0;i<n;i++)b[i]=1;
playRound(b,r);
set<int> pos;
for(int i=0;i<n;i++)
{
if(r[i]>0)
{
pos.insert(i);
// cout<<i<<' ';
}
}
// cout<<endl;
for(int i=0;i<n;i++)
{
b[i]=0;
}
for(auto x:pos)
{
b[x]=2;
}
playRound(b,r);
pos.clear();
for(int i=0;i<n;i++)
{
if(r[i]>0 and b[i]==2)
{
pos.insert(i);
// cout<<i<<' ';
}
}
// cout<<endl;
for(int i=0;i<n;i++)
{
b[i]=0;
}
for(auto x:pos)
{
b[x]=4;
}
playRound(b,r);
pos.clear();
for(int i=0;i<n;i++)
{
if(r[i]>0 and b[i]==4)
{
pos.insert(i);
// cout<<i<<' ';
}
}
// cout<<endl;
for(int i=0;i<n;i++)
{
b[i]=0;
}
for(auto x:pos)
{
b[x]=11;
}
playRound(b,r);
pos.clear();
for(int i=0;i<n;i++)
{
if(r[i]>0 and b[i]==11)
{
return i;
// pos.insert(i);
// cout<<i<<' ';
}
}
// cout<<endl;
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.
}
}
