# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
114326 | nxteru | Last supper (IOI12_supper) | C++14 | 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"
#include <bits/stdc++.h>
using namespace std;
int n,k,nex[200005],p[200005],ex[200005],ans[200005];
void ComputeAdvice(int *C, int N, int K, int M) {
n=N,k=K;
for(int i=0;i<n;i++)p[i]=n,ex[i]=-1;
for(int i=n-1;i>=0;i--){
nex[i]=p[C[i]];
p[C[i]]=i;
}
priority_queue<P>d;
for(int i=0;i<k;i++)d.push(P(p[i],i)),ex[i]=i;
for(int i=0;i<n;i++){
int c=C[i];
if(ex[c]!=-1)ans[ex[c]]=1;
else{
int y;
while(1){
y=d.top().S;
d.pop();
if(ex[y]==-1)continue;
}
ex[y]=-1;
}
ex[c]=k+i;
d.push(P(nex[i],c));
}
for(int i=0;i<k+n;i++)WriteAidvise(ans[i]);
}
#include "assistant.h"
#include <bits/stdc++.h>
using namespace std;
int s,q,l;
set<int>x,y;
void Assist(unsigned char *A, int N, int K, int R) {
s=N,q=K;
for(int i=0;i<k;i++){
if(A[i]==0)x.insert(i);
else y.insert(i);
}
for(int i=k;i<k+n;i++){
int c=GetRequest();
if(y.find(c)!=y.end())y.erase(c);
else{
PutBack(*x.begin());
x.erase(x.begin());
}
if(A[i]==0)x.insert(c);
else y.insert(c);
}
}