| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 988834 | lalig777 | 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.
void ComputeAdvice(int *C, int N, int K, int M){
int digits;
for (int i=0; i<21; i++){
if ((1<<i)>=N-1){
digits=i;
break;
}
}
if (K==1) return;
unordered_set<int>current;
priority_queue<pair<int,int>>next;
vector<queue<int>>orden(N);
for (int i=0; i<N; i++){
int x=C[i];
if (x<K){
if (!(current.find(x)!=current.end())){
next.push(make_pair(i, x));
current.insert(x);
}
}orden[x].push(i);
}for (int i=0; i<K; i++){
if (!(current.find(i)!=current.end())){
next.push(make_pair(1e9, i));
current.insert(i);
}
}
for (int i=0; i<N; i++){
int x=C[i];
orden[x].pop();
int pos;
if (orden[x].empty()) pos=1e9;
else pos=orden[x].front();
if (!(current.find(x)!=current.end())){
current.insert(x);
int remov=next.top().second;
next.pop();
current.erase(remov);
for (int j=digits-1; j>=0; j--){
int y=1<<j;
if (remov>=y){
remov-=y;
WriteAdvice('1');
}else WriteAdvice('0');
}
}
next.push(make_pair(pos, x));
}return;
}
void Assist(unsigned char *A, int N, int K, int R){
if (K==1){
int now=0;
for (int i=0; i<N; i++){
int follow=GetRequest();
if (follow!=now){
PutBack(now);
now=follow;
}
}return;
}
int digits, count=0;
for (int i=0; i<21; i++){
if ((1<<i)>=N){
digits=i;
break;
}
}
unordered_set<int>current;
for (int i=0; i<K; i++) current.insert(i);
for (int i=0; i<N; i++){
int follow=GetRequest();
if (!(current.find(follow)!=current.end())){
int remov=0;
for (int j=0; j<digits; j++){
if (A[j+count*digits]=='1') remov+=(1<<(digits-j-1));
}count++;
PutBack(remov);
current.erase(remov);
current.insert(follow);
}
}
}