#include "advisor.h"
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define sz(x) (int)x.size()
#define rep(z, a, b) for (int z = (a); (z) <= (b); z++)
#define per(z, a, b) for (int z = (a); (z) >= (b); z--)
using namespace std;
const int MAXN = (int)2e5 + 7;
vector <int> nxt[MAXN];
int del_val[MAXN];
bool good[MAXN];
void ComputeAdvice(int *C, int N, int K, int M) {
per(i, N - 1, 0) nxt[i].pb(N);
per(i, N - 1, 0) nxt[C[i]].pb(i);
set < pair <int, int > > st;
rep(i, 0, K - 1) st.insert({nxt[i].back(), i});
int Log = log2(N);
rep(i, 0, N - 1) {
while (sz(st) && st.begin() -> f <= i) {
int x = st.begin() -> s;
st.erase(st.begin());
nxt[x].pp();
st.insert({nxt[x].back(), x});
}
if (st.count({nxt[C[i]].back(), C[i]})) {
continue;
}
int x = st.rbegin() -> s;
st.erase(--st.end());
st.insert({nxt[C[i]].back(), C[i]});
del_val[i] = x;
}
map <int, int> ask, del;
per(i, N - 1, 0) {
/// good if ask < del
if (ask.count(C[i]) && (!del.count(C[i]) || ask[C[i]] < del[C[i]])) {
good[i] = 1;
}
ask[C[i]] = i;
del[del_val[C[i]]] = i;
}
rep(i, 0, K - 1) {
if (ask.count(i) && (!del.count(i) || ask[i] < del[i])) {
WriteAdvice(1);
}
else WriteAdvice(0);
}
rep(i, 0, N - 1) {
WriteAdvice(good[i]);
}
}
#include "assistant.h"
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define sz(x) (int)x.size()
#define rep(z, a, b) for (int z = (a); (z) <= (b); z++)
#define per(z, a, b) for (int z = (a); (z) >= (b); z--)
using namespace std;
const int MAXN = (int)2e5 + 7;
void Assist(unsigned char *A, int N, int K, int R) {
set <int> a[2];
rep(i, 0, K - 1) a[A[i]].insert(i);
rep(i, K, K + N - 1) {
int val = GetRequest();
if (a[0].count(val) || a[1].count(val)) continue;
PutBack(*a[0].begin());
a[0].erase(a[0].begin());
a[A[i]].insert(val);
}
}
