# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
463825 | dutch | 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 "advisor.h"
void ComputeAdvice(int *C, int N, int K, int M){
int next[N], last[N];
fill(last, last+N, N);
bool on[N], r[N+K] = {};
for(int i=N; --i>=0; ){
next[C[i]] = last[C[i]];
last[C[i]] = i;
on[i] = i < K;
}
priority_queue<array<int, 2>> q;
for(int i=0; i<N; ++i){
if(i < K) q.push({last[i], i});
last[i] = i < K ? i : -1;
}
for(int i=0; i<N; ++i){
if(!on[C[i]]){
while(!on[q.top()[1]]) q.pop();
int j = q.top()[1]; q.pop();
r[K+last[j]] = !(on[j] = 0);
}
q.push({next[C[i]], C[i]});
on[C[i]] = 1;
last[C[i]] = K + i;
}
for(int i=0; i<N+K; ++i) WriteAdvice(r[i]);
}
#include "assistant.h"
void Assist(unsigned char *A, int N, int K, int R){
vector<int> s;
bool on[N] = {};
for(int i=0; i<K; ++i){
on[i] = 1;
if(A[i]) s.push_back(i);
}
for(int i=0; i<N; ++i){
int j = GetRequest();
if(!on[j]){
PutBack(back(s));
s.pop_back();
on[j] = 1;
}
if(A[K+i]) s.push_back(j);
}
}