#include "advisor.h"
#include <bits/stdc++.h>
using namespace std;
void ComputeAdvice(int *C, int N, int K, int M) {
for(int i = 0; i < N; i++)
for(int j = 0; j < 20; j++)
WriteAdvice((C[i]>>j)&1);
}
#include "assistant.h"
#include <bits/stdc++.h>
using namespace std;
void Assist(unsigned char *A, int N, int K, int R) {
int C[N+1]; vector<int> v[N+1];
for(int i = 0; i < N; i++) C[i]=0;
for(int i = 0; i < R; i++)
if(A[i]) C[i/20] |= (1<<(i%20));
set<int> S; set<pair<int,int>> SS;
for(int i = 0; i < N; i++) v[C[i]].push_back(i);
for(int i = 0; i < N; i++) v[i].push_back(N+1);
for(int i = 0; i < K; i++){
int nx = *upper_bound(begin(v[i]),end(v[i]),-1);
S.insert(i); SS.insert({nx,i});
}
for(int i = 0; i < N; i++) {
int req = GetRequest();
if(S.count(req)){
int nx = *upper_bound(begin(v[req]),end(v[req]),i);
SS.erase({i,req}); SS.insert({nx,req});
continue;
}
int getCol = (--end(SS))->second;
S.erase(getCol); S.insert(req); PutBack(getCol);
int nx = *upper_bound(begin(v[req]),end(v[req]),i);
SS.erase(--end(SS)); SS.insert({nx,req});
}
}
