#include <iostream>
#include <vector>
#include <set>
#include "advisor.h"
using namespace std;
void ComputeAdvice(int *C, int N, int K, int M) {
vector<vector<int>> last(N);
vector<int> ans(N), ans_k(K);
vector<int> request(N, -1);
vector<int> ptr(N, 0), st(N);
set<pair<int, int>> s;
for (int i = 0; i < N; i++) {
last[C[i]].push_back(i);
}
for (int i = 0; i < N; i++) {
last[i].push_back(N);
}
for (int i = 0; i < K; i++) {
ptr[i]++;
s.insert({last[i][0], i});
st[i] = 1;
}
for (int i = 0; i < N; i++) {
/*for (auto a : s) {
cout << a.first << ' ' << a.second << endl;
}
cout << "----\n";*/
request[C[i]] = i;
if (!st[C[i]]) {
int x = s.rbegin()->second;
s.erase(s.find(*s.rbegin()));
st[x] = 0;
if (request[x] != -1) ans[request[x]] = 1;
else ans_k[x] = 1;
while(last[C[i]][ptr[C[i]]] <= i) ptr[C[i]]++;
s.insert({last[C[i]][ptr[C[i]]], C[i]});
} else {
s.erase({last[C[i]][ptr[C[i]]], C[i]});
while(last[C[i]][ptr[C[i]]] <= i) ptr[C[i]]++;
s.insert({last[C[i]][ptr[C[i]]], C[i]});
}
st[C[i]] = 1;
}
for (int i = 0; i < K; i++) {
WriteAdvice(ans_k[i]);
}
for (int i = 0; i < N; i++) {
WriteAdvice(ans[i]);
}
}
#include <iostream>
#include <vector>
#include "assistant.h"
using namespace std;
void Assist(unsigned char *A, int N, int K, int R) {
vector<int> st(N);
vector<int> bottom_shelf;
for (int i = 0; i < K; i++) {
if (A[i]) bottom_shelf.push_back(i);
st[i] = 1;
}
A += K;
for (int i = 0; i < N; i++) {
int x = GetRequest();
if (!st[x]) {
PutBack(bottom_shelf.back());
bottom_shelf.pop_back();
}
st[x] = 1;
if (A[i]) bottom_shelf.push_back(x);
}
}
