| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 65099 | aquablitz11 | Last supper (IOI12_supper) | C++14 | 390 ms | 41832 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"
using namespace std;
using pii = pair<int, int>;
static const int N = 200010;
static const int INF = 1e9;
static int ptr[N], last[N], ans[N];
static vector<int> seqpos[N];
static set<pii> S;
static int getnext(int x) {
if (ptr[x] < (int)seqpos[x].size())
return seqpos[x][ptr[x]];
else
return INF;
}
static void movenext(int x) {
S.erase(pii(getnext(x), x));
++ptr[x];
S.insert(pii(getnext(x), x));
}
void ComputeAdvice(int *C, int n, int k, int m) {
for (int i = 0; i < n; ++i)
seqpos[C[i]].push_back(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... | ||||