# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
229942 | frodakcin | Editor (BOI15_edi) | C++11 | 270 ms | 68728 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 <cstdio>
#include <cstring>
#include <set>
#include <functional>
#include <vector>
#include <algorithm>
const int MN = 3e5+10;
int N, a[MN], b[MN][20], g[MN][20], d[MN];
bool e[MN];
std::set<int, std::greater<int>, std::allocator<int> > f;
std::vector<int> c[MN];
void dfs(int n, int v)
{
d[n]=v;
for(int x:c[n])
dfs(x, v);
}
int main(void)
{
scanf("%d", &N);
for(int i=0;i<N;++i) scanf("%d", a+i);
memset(b, -1, sizeof b);
for(int i=0,j,x;i<N;++i)
{
if(a[i]<0)
{
j=0, x=i-1;
for(;~b[x][j];++j);
for(--j;j>=0;--j)
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... |