# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
51909 | rondojim | Last supper (IOI12_supper) | C++17 | 165 ms | 50560 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;
typedef long long ll;
const int MAXN = 1e5 + 5;
vector<bool> used(MAXN, 0);
int nxt[MAXN], pos[MAXN], top[MAXN];
struct col{
int color, next;
bool operator<(const col &x) const {
return next < x.next;
}
};
priority_queue<col> pq;
vector<int> work[MAXN];
void ComputeAdvice(int *c, int n, int k, int m){
for(int i=0; i<n; ++i) pos[i] = -1, nxt[i] = n;
for(int i=0; i<n; ++i){
if(pos[c[i]] == -1){
pos[c[i]] = i;
if(c[i] < k) pq.push({c[i], i});
}
else{
nxt[pos[c[i]]] = i;
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... |