#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "advisor.h"
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> idx_set;
namespace{
int n, k, m, b;
int arr[100002];
int ans[100002];
bool chk[100002];
priority_queue<pair<int, int> > pq;
vector<int> times[100002];
idx_set st;
}
void ComputeAdvice(int *ARR, int N, int K, int M){
n = N, k = K, m = M;
b=15;
for(int i=0; i<n; i++){
arr[i] = ARR[i];
times[arr[i]].push_back(i);
}
for(int i=0; i<n; i++) times[i].push_back(1e9);
for(int i=0; i<n; i++){
reverse(times[i].begin(), times[i].end());
if(i<k) pq.push({times[i].back(), i}), st.insert(i);
}
for(int i=0; i<k; i++) chk[i] = 1;
for(int i=0; i<n; i++){
times[arr[i]].pop_back();
if(chk[arr[i]]){
ans[i] = k;
pq.push({times[arr[i]].back(), arr[i]});
continue;
}
pair<int, int> tmp = pq.top(); pq.pop();
ans[i] = st.order_of_key(tmp.second);
// printf("erased: %d\n", tmp.second);
st.erase(st.find(tmp.second));
st.insert(arr[i]);
chk[tmp.second] = 0;
pq.push({times[arr[i]].back(), arr[i]});
chk[arr[i]] = 1;
}
for(int i=0; i<n; i++){
for(int j=0; j<b; j++){
WriteAdvice(!!(ans[i] & (1<<j)));
}
}
}
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "assistant.h"
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> idx_set;
namespace{
int n, k, l, b;
int arr[2000002];
idx_set st;
}
void Assist(unsigned char *ARR, int N, int K, int R) {
n = N, k = K, l = R;
b=15;
for(int i=0; i<R; i++) arr[i] = ARR[i];
for(int i=0; i<k; i++){
st.insert(i);
}
for(int i=0; i<n; i++){
int tpt = GetRequest();
int tmp = 0;
for(int j=0; j<b; j++){
tmp += (1<<j) * arr[i*b+j];
}
if(tmp != k){
int tx = *st.find_by_order(tmp);
// printf("erased: %d\n", tx);
PutBack(tx);
st.erase(st.find(tx));
st.insert(tpt);
}
}
}
