| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 97477 | Alexa2001 | Last supper (IOI12_supper) | C++17 | 117 ms | 10752 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 Nmax = 2e5 + 5;
static int nxt[Nmax], last[Nmax], in[Nmax], c[Nmax], scoate[Nmax];
static priority_queue < pair<int,int> > heap;
void ComputeAdvice(int *C, int N, int K, int M)
{
int i;
for(i=0; i<N; ++i) last[i] = N+K;
for(i=0; i<K; ++i) c[i] = i;
for(; i<N+K; ++i) c[i] = C[i-K];
for(i=N+K-1; i>=0; --i)
{
nxt[i] = last[c[i]];
last[c[i]] = i;
}
for(i=0; i<K; ++i)
{
in[i] = 1;
heap.push({ nxt[i], i });
}
| # | 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... | ||||