# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7281 | myungwoo | Last supper (IOI12_supper) | C++98 | 114 ms | 43928 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 <queue>
using namespace std;
#define MAXN 100005
typedef pair<int,int> pii;
static int C[MAXN];
static int in_scaffold[MAXN],recent[MAXN],next_[MAXN],first_active[MAXN],request_active[MAXN],request_num[MAXN];
static priority_queue<pii> que;
void ComputeAdvice(int *arr, int N, int K, int M)
{
int i,k;
for (i=0;i<N;i++) C[i+1] = arr[i]+1;
for (i=1;i<=N;i++) next_[i] = 1e9;
for (i=N;i;i--){
recent[i] = next_[C[i]];
next_[C[i]] = i;
}
for (i=1;i<=K;i++) in_scaffold[i] = 1, que.push(pii(next_[i],i));
for (i=1;i<=K;i++) first_active[i] = 0;
for (i=1;i<=N;i++) request_active[i] = 0;
for (i=1;i<=N;i++){
if (in_scaffold[C[i]]){
if (request_num[C[i]]) request_active[request_num[C[i]]] = 1;
else first_active[C[i]] = 1;
request_num[C[i]] = i;
que.push(pii(recent[i],C[i]));
continue;
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... |