#include "advisor.h"
#include <iostream>
using std::cerr;
const int LG = 13;
void ComputeAdvice(int *C, int N, int K, int M) {
for (int i = 0; i < N; i++) {
for (int j = 0; j < LG; j++) {
WriteAdvice(C[i] >> j & 1);
}
}
// cerr << "C = ";
// for (int i = 0; i < N; i++)
// cerr << C[i] << ' ';
// cerr << '\n';
}
#include "assistant.h"
#include <iostream>
#include <vector>
#include <cassert>
#include <set>
#include <utility>
using std::cerr;
using std::vector;
using std::set;
using std::pair;
const int maxn = 100025;
const int LG = 13;
int C[maxn];
vector<int> last[maxn];
int scaffold[maxn];
int onScaffold[maxn];
void Assist(unsigned char *A, int N, int K, int R) {
for (int i = 0; i < N; i++) {
for (int j = 0; j < LG; j++) {
C[i] |= A[i*LG + j] * (1<<j);
}
}
// cerr << "C = ";
// for (int i = 0; i < N; i++)
// cerr << C[i] << ' ';
// cerr << '\n';
for (int i = 0; i < K; i++)
scaffold[i] = i, onScaffold[i] = i;
for (int i = K; i < N; i++)
onScaffold[i] = -1;
for (int i = 0; i < N; i++)
last[i].push_back(maxn);
for (int i = N-1; i >= 0; i--)
last[C[i]].push_back(i);
set<pair<int,int>> st;
for (int i = 0; i < K; i++)
st.insert({ -last[i].back(), i });
for (int i = 0; i < N; i++) {
int req = GetRequest();
if (onScaffold[req] == -1) {
last[C[i]].pop_back();
int pos = st.begin() -> second;
st.erase(st.begin());
onScaffold[req] = pos;
onScaffold[scaffold[pos]] = -1;
PutBack(scaffold[pos]);
scaffold[pos] = req;
st.insert({ -last[C[i]].back(), pos });
} else {
int pos = onScaffold[C[i]];
st.erase({ -last[C[i]].back(), pos });
last[C[i]].pop_back();
st.insert({ -last[C[i]].back(), pos });
}
}
}
