#include<bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#include "advisor.h"
const int INF = 1e9;
void ComputeAdvice(int *C, int N, int K, int M) {
vector<int> put_down;
vector<vector<int>> oc;
int log2 = 1;
while((1<<log2)<N){
log2++;
}
oc.resize(N);
for(int i = 0; i<N; i++){
oc[C[i]].push_back(i);
}
for(int i = 0; i<N; i++){
oc[i].push_back(INF);
reverse(oc[i].begin(), oc[i].end());
}
set<pii> cur_colors;
for(int i = 0; i<K; i++){
cur_colors.insert({oc[i].back(), i});
}
for(int i = 0; i<N; i++){
int needed = C[i];
if(cur_colors.find({oc[C[i]].back(), C[i]}) == cur_colors.end()){
pii removing = *(--cur_colors.end());
cur_colors.erase(removing);
put_down.push_back(removing.second);
}
else{
cur_colors.erase({oc[needed].back(), needed});
}
oc[needed].pop_back();
cur_colors.insert({oc[needed].back(), needed});
}
for(auto e: put_down){
for(int i = 0; i<log2; i++){
WriteAdvice((e&(1<<i))>>i);
}
}
}
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#include "assistant.h"
void Assist(unsigned char *A, int N, int K, int R) {
int i;
int log2 = 1;
while((1<<log2)<N){
log2++;
}
set<int> cur_colors;
for(int i = 0; i<K; i++){
cur_colors.insert(i);
}
vector<int> put_down;
for(int i =0; i<R; i+=log2){
int val = 0;
for(int j = 0; j<log2; j++){
val += A[j+i] * (1<<j);
}
put_down.push_back(val);
}
reverse(put_down.begin(), put_down.end());
for (i = 0; i < N; i++) {
int req = GetRequest();
if(cur_colors.find(req) == cur_colors.end()){
PutBack(put_down.back());
put_down.pop_back();
}
cur_colors.insert(req);
}
}
