# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
744025 | boyliguanhan | Last supper (IOI12_supper) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "assistant.h"
#include<bits/stdc++.h>
using namespace std;
void Assist(unsigned char *A, int N, int K, int R) {
priority_queue<pair<int, int>> q;
int last[N], nxt[N];
memset(last, 1, sizeof last);
int C[N], bits = log2(K);
for(int i = 0; i < N; i++)
for(int j = 0; j < bits; j++)
C[i]|=A[i*bits+j]-'0' << j;
for(int i = N; i--;)
nxt[i] = last[C[i]], last[C[i]] = i;
bool on[N];
memset(on, 0, sizeof on);
for(int i = 0; i < K; i++)
q.push({last[i], i}), on[i] = 1;
for(int i = 0; i < N; i++) {
int col = GetRequest();
if(!on[col]) {
PutBack(q.top().second);
on[q.top().second] = 0;
q.pop();
q.push({nxt[i], i});
on[col] = 1;
}
}
}