#include "advisor.h"
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
static int A[202020], X[202020], R[101010];
static int B[202020];
static priority_queue<pii> PQ;
void ComputeAdvice(int *C, int N, int K, int M) {
for (int i=0; i<K; i++) A[i]=i;
for (int i=0; i<N; i++) A[i+K]=C[i], R[i]=N+K;
for (int i=N+K-1; i>=0; i--) X[i]=R[A[i]], R[A[i]]=i;
memset(R, -1, sizeof R);
for (int i=0; i<K; i++) PQ.push(pii(X[i], i)), R[i]=i;
for (int i=K; i<K+N; i++){
if (R[A[i]]<0){
while (R[A[PQ.top().se]] != PQ.top().se) PQ.pop();
B[PQ.top().se]=1, R[A[PQ.top().se]]=-1;
PQ.pop();
}
R[A[i]]=i, PQ.push(pii(X[i], i));
}
for (int i=0; i<K+N; i++) WriteAdvice(B[i]);
}
#include "assistant.h"
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
static bool chk[101010];
static set<int> E;
void Assist(unsigned char *A, int N, int K, int R) {
for (int i=0; i<K; i++){
if (A[i]) E.insert(i);
chk[i]=true;
}
for (int i=0; i<N; i++){
int x=GetRequest();
if (!chk[x]){
assert(!E.empty());
PutBack(*E.begin()), chk[*E.begin()]=false, E.erase(E.begin());
}
if (A[i+K]) E.insert(x);
else E.erase(x);
chk[x]=true;
}
}
