#include<bits/stdc++.h>
#include "mushrooms.h"
using namespace std;
void wypiszvector(vector<int>&vec){
printf("{");
for(auto j: vec)printf("%d,", j);
printf("}\n");
}
const int stala = 6;
int maska[83] = {0,0,0,4,8,59,9,43,41,0,0,63,1,0,32,2,16,0,33,47,35,0,12,18,34,0,45,13,51,50,0,0,24,40,26,27,58,0,36,5,37,55,39,0,10,42,11,57,25,0,20,6,22,38,54,0,0,46,17,44,19,0,3,62,61,0,49,48,14,0,31,29,30,28,15,0,56,7,52,23,53,21,60,};
vector<int>zapytanie[83] = {{4,1,6,2,5,0,3,},{},{2,4,5,6,0,1,3,},{},{},{},{},{},{},{1,2,3,5,4,6,0,},{3,6,4,1,2,},{},{},{2,5,1,3,0,4,},{},{},{},{4,6,5,3,2,0,1,},{},{},{},{3,5,2,0,1,6,},{},{},{},{3,5,0,1,4,6,},{},{},{},{},{0,3,1,2,5,4,},{1,6,0,2,3,5,},{},{},{},{},{},{5,1,4,2,0,6,},{},{},{},{},{},{4,3,5,0,1,6,},{},{},{},{},{},{1,6,4,2,0,5,},{},{},{},{},{},{5,1,0,3,6,4,},{0,5,6,1,3,2,4,},{},{},{},{},{2,5,6,0,3,},{},{},{},{1,6,4,2,0,3,},{},{},{},{4,1,5,6,0,3,2,},{},{},{},{},{},{6,5,4,3,2,1,0,},{},{},{},{},{},{},{},};
vector<int>graf[83] = {{1,2,9,30,55,75,82,},{},{-1,3,4,5,6,7,8,},{},{},{},{},{},{},{-1,10,13,17,21,25,29,},{11,-1,12,},{},{},{14,15,16,},{},{},{},{-1,-1,-1,18,19,20,},{},{},{},{-1,22,23,24,},{},{},{},{-1,-1,26,27,-1,28,},{},{},{},{},{-1,31,37,43,49,},{-1,32,33,34,35,36,},{},{},{},{},{},{-1,38,39,40,41,42,},{},{},{},{},{},{-1,44,45,46,47,48,},{},{},{},{},{},{-1,50,51,52,53,54,},{},{},{},{},{},{-1,56,61,65,69,74,},{-1,-1,-1,57,58,59,60,},{},{},{},{},{-1,62,63,64,},{},{},{},{-1,66,67,68,},{},{},{},{-1,-1,70,71,72,73,},{},{},{},{},{},{-1,76,77,78,79,80,81,},{},{},{},{},{},{},{},};
vector<int>A[2];
int Ac[2];
int it;
int count_mushrooms1(int n){
while(it<n){
// printf("it = %d\n", it);
vector<int>pom;
bool czy = 0;
if(A[1].size()>A[0].size())czy = 1;
int pom1 = 0;
while(it<n && pom.size()<2*A[czy].size()){
pom.push_back(A[czy][pom1++]);
pom.push_back(it);
it++;
}
int ans = use_machine(pom);
// printf("vec: = ");for(auto j: pom)printf("%d ", j);printf("\n");
// printf("ans = %d\n", ans);
if(ans%2==0)
A[czy].push_back(it-1);
else
A[!czy].push_back(it-1);
Ac[!czy]+=(ans+1)/2;
Ac[czy]+=pom1-(ans+1)/2;
if(pom1==2){
if(ans<2)
A[czy].push_back(it-2);
else
A[!czy].push_back(it-2);
}
}
// printf("res = %d\n", Ac[0]);
return Ac[0];
}
int count_mushrooms(int n){
A[0].push_back(0);
it = 1;
Ac[0] = 1;
Ac[1] = 0;
for(int ile=0;ile<31;ile++)
{
if(n<=stala+it)
return count_mushrooms1(n);
int x = 0;
while(graf[x].size()>0){
vector<int>pom;
pom = zapytanie[x];
for(auto &j: pom)
if(j>0)
j+=ile*stala;
int c = use_machine(pom);
// wypiszvector(zapytanie[x]);
x = graf[x][c];
}
x = maska[x];
for(int i=0;i<stala;i++){
A[(x>>i)&1].push_back(ile*stala+i+1);
Ac[(x>>i)&1]++;
}
it+=stala;
}
return count_mushrooms1(n);
}
