oj.uz

Submission #134326

# Submission time Handle Problem Language Result Execution time Memory
134326 2019-07-22T12:44:47 Z Kastanda Editor (BOI15_edi) C++11
100 / 100
 263 ms 50216 KB 
// ItnoE
#include<bits/stdc++.h>
using namespace std;
const int N = 300005, LG = 19;
int n, R[N], P[N][LG], M[N][LG];
int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; i ++)
    {
        int a;
        scanf("%d", &a);
        if (a > 0)
        {
            P[i][0] = i;
            R[i] = a;
            continue;
        }
        a = - a;
        int nw = i - 1;
        for (int j = LG - 1; ~ j; j --)
            if (M[nw][j] >= a)
                nw = P[nw][j];
        P[i][0] = nw - 1;
        R[i] = R[P[i][0]];
        M[i][0] = a;
        for (int j = 1; j < LG; j ++)
            P[i][j] = P[P[i][j - 1]][j - 1],
            M[i][j] = min(M[i][j - 1], M[P[i][j - 1]][j - 1]);
    }
    for (int i = 1; i <= n; i ++)
        printf("%d\n", R[i]);
    return 0;
}

Compilation message

edi.cpp: In function 'int main()':
edi.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
edi.cpp:12:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a);
         ~~~~~^~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 4 ms 1016 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 5 ms 1144 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 4 ms 1144 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 4 ms 1144 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 49600 KB Output is correct
2 Correct 132 ms 49676 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 19448 KB Output is correct
2 Correct 71 ms 23240 KB Output is correct
3 Correct 200 ms 39032 KB Output is correct
4 Correct 129 ms 49588 KB Output is correct
5 Correct 144 ms 50168 KB Output is correct
6 Correct 156 ms 47480 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 4 ms 1016 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 5 ms 1144 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 4 ms 1144 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 4 ms 1144 KB Output is correct
10 Correct 128 ms 49600 KB Output is correct
11 Correct 132 ms 49676 KB Output is correct
12 Correct 59 ms 19448 KB Output is correct
13 Correct 71 ms 23240 KB Output is correct
14 Correct 200 ms 39032 KB Output is correct
15 Correct 129 ms 49588 KB Output is correct
16 Correct 144 ms 50168 KB Output is correct
17 Correct 156 ms 47480 KB Output is correct
18 Correct 120 ms 39004 KB Output is correct
19 Correct 121 ms 38860 KB Output is correct
20 Correct 263 ms 48732 KB Output is correct
21 Correct 130 ms 49492 KB Output is correct
22 Correct 137 ms 50216 KB Output is correct