| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 118031 | baqargam | 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<bits/stdc++.h>
#include "advisor.h"
#include "grader.h"
using namespace std;
void ComputeAdvice(int *C, int n, int k, int m) {
int ls[100005],nx[100005];
priority_queue<pair<int,int> >q;
vector<pair<int,int> >ret;
for(int i=0;i<n;i++){
ls[i]=1000000000;
nx[i]=0;
}
for(int i=n-1;i>=0;i--){
nx[i]=ls[C[i]];
ls[C[i]]=i;
}
for(int i=0;i<k;i++){
q.push_back({ls[i],i});
}
for(int i=k;i<=n;i++){
int a=q.top().first;
int j=q.top().second;
q.pop();
ret.push_back({j,1});
q.push({nx[C[i-k]],i});
}
sort(ret.begin(),ret.end());
for(int i=0;i<k+n;i++){
WriteAdvice(ret[i].second);
}
}
#include<bits/stdc++.h>
#include "assistant.h"
#include "grader.h"
using namespace std;
void Assist(unsigned char *A, int n, int k, int r) {
queue<int>q;
for(int i=0;i<k;i++){
if(A[i]==1) q.push(i);
}
for(int i=0;i<n;i++){
int a=GetRequest();
PutBack(q.front());
q.pop();
if(A[i]==1) q.push(a);
}
}