#include "advisor.h"
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
void ComputeAdvice(int *C, int N, int K, int M) {
int B = log2(K);
vector<int> idx[N];
for (int i = 0; i < N; i++) {
idx[C[i]].push_back(i);
}
for (int i = 0; i < N; i++) {
idx[i].push_back(N);
reverse(all(idx[i]));
}
int shelf[K];
set<pair<int, int>> st;
priority_queue<pair<int, int>> pq;
for (int i = 0; i < K; i++) {
shelf[i] = i;
st.insert(make_pair(i, i)); // (color, posicion)
pq.push(make_pair(idx[i].back(), i)); // (proxima aparicion, posicion)
idx[i].pop_back();
}
for (int i = 0; i < N; i++) {
int x = C[i];
auto it = st.lower_bound(make_pair(x, 0));
if (it != st.end() && it->first == x) continue;
/*
while (!pq.empty() && pq.top().first < i) {
int y = pq.top().second;
pq.pop();
pq.push(make_pair(idx[shelf[y]].back(), y));
idx[shelf[y]].pop_back();
}
*/
int y = pq.top().second;
pq.pop();
st.erase(make_pair(shelf[y], y));
for (int j = B; j >= 0; j--) {
if ((y >> j) & 1) WriteAdvice(1);
else WriteAdvice(0);
}
shelf[y] = x;
st.insert(make_pair(x, y));
idx[x].pop_back();
pq.push(make_pair(idx[x].back(), y));
idx[x].pop_back();
}
}
#include "assistant.h"
#include <bits/stdc++.h>
using namespace std;
void Assist(unsigned char *A, int N, int K, int R) {
int B = log2(K);
int shelf[K];
set<int> st;
for (int i = 0; i < K; i++) {
shelf[i] = i;
st.insert(i);
}
int curr = 0;
for (int i = 0; i < N; i++) {
int x = GetRequest();
if (st.find(x) != st.end()) continue;
int y = 0;
for (int j = B; j >= 0; j--) {
if (A[curr++] == 1) y ^= (1 << j);
}
PutBack(shelf[y]);
st.erase(shelf[y]);
shelf[y] = x;
st.insert(x);
}
}
