#include "advisor.h"
#include<set>
#include<queue>
#include<vector>
using namespace std;
int L;
void writeInt(int x){
for (int i=0;i<L;i++){
WriteAdvice(x % 2);
x /= 2;
}
}
void ComputeAdvice(int *C, int N, int K, int M) {
for (L=0;L<31;L++){
if ((1<<L) > N) break;
}
set<int> scafold;
for (int i=0;i<K;i++) scafold.insert(i);
vector<queue<int> > Q(N);
for (int i=0;i<N;i++) Q[C[i]].push(i);
for (int i=0;i<N;i++){
Q[C[i]].pop();
if (scafold.count(C[i]) > 0) continue;
int besttime = -1;
int bestcolour = -1;
for (set<int>::iterator it = scafold.begin(); it != scafold.end(); it++){
int u = *it;
if (Q[u].empty() || Q[u].front() > besttime){
besttime = Q[u].empty() ? N : Q[u].front();
bestcolour = u;
}
}
writeInt(bestcolour);
scafold.erase(bestcolour);
scafold.insert(C[i]);
}
}
#include "assistant.h"
#include<queue>
#include<set>
using namespace std;
void Assist(unsigned char *A, int N, int K, int R) {
int L;
for (L=0;L<31;L++){
if ((1<<L) > N) break;
}
queue<int> Q;
for (int i=0;i< R / L;i++){
int x = 0;
for (int j=0;j<L;j++) x += (1<<j) * A[i * L + j];
Q.push(x);
}
set<int> scafold;
for (int i=0;i<K;i++) scafold.insert(i);
for (int i=0;i<N;i++){
int req = GetRequest();
if (scafold.count(req) > 0) continue;
PutBack(Q.front());
scafold.erase(Q.front());
scafold.insert(req);
Q.pop();
}
}
