# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
50964 | SpaimaCarpatilor | Cake (CEOI14_cake) | C++17 | 359 ms | 91352 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>
using namespace std;
int splitPos, N, M, a[250009], stk[2][250009], sz[2];
int last, initInv[250009], nxt[250009], prv[250009];
void read ()
{
scanf ("%d %d", &N, &splitPos), M = N;
for (int i=1; i<=N; i++)
scanf ("%d", &a[i]), initInv[a[i]] = i;
for (int i=0; i<=N + 1; i++)
{
if (i > 0) prv[initInv[i]] = initInv[i - 1];
if (i <= N) nxt[initInv[i]] = initInv[i + 1];
}
last = initInv[N];
}
void del (int pos)
{
if (pos == 0) prv[nxt[pos]] = 0;
else
{
int x = prv[pos], y = nxt[pos];
nxt[x] = y, prv[y] = x;
}
}
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... |