# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
70104 | Abelyan | Last supper (IOI12_supper) | C++17 | 158 ms | 31256 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;
const int N=100006;
int a[N],han[N],mp[N],vr[N];
bool pas[N],sc[N];
void ComputeAdvice(int *c, int n, int k, int m) {
for (int i=n-1;i>=0;i--){
a[i]=mp[c[i]]-1;
if (mp[c[i]]==0)a[i]=2*N;
mp[c[i]]=i+1;
}
priority_queue<pair<pair<int,int>,int> > pq;
for (int i=0;i<k;i++){
if (mp[i]==0)mp[i]=2*N;
pq.push({{mp[i]-1,-1},i});
vr[i]=-1;
sc[i]=true;
}
for (int i=0;i<n;i++){
if (sc[c[i]]){
pq.push({{a[i],i},c[i]});
vr[c[i]]=i;
han[i]=-1;
continue;
}
sc[c[i]]=true;
int k;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |