oj.uz

Submission #846534

# Submission time Handle Problem Language Result Execution time Memory
846534 2023-09-07T18:05:43 Z lovrot Editor (BOI15_edi) C++17
100 / 100
 210 ms 27932 KB 
#include <cstdio> 

using namespace std; 

const int N = 3e5 + 10;
const int LOG = 19;

int n, A[N];
int UP[N][LOG];

int climb(int u, int val) {
    for(int i = LOG - 1; i >= 0; --i)
        if(A[UP[u][i]] <= val) {
            u = UP[u][i];
        }
    if(A[u] > val) return u;
    return UP[u][0];
}

int main() {
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i) {
        scanf("%d", A + i); 
        if(A[i] < 0) {
            UP[i][0] = climb(climb(i - 1, A[i]) - 1, A[i]);
            for(int j = 1; j < LOG; ++j) UP[i][j] = UP[UP[i][j - 1]][j - 1]; 
        }   
        printf("%d\n", A[climb(i, -1)]);
    }   
    return 0;
}

Compilation message

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

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 3 ms 600 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 3 ms 856 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 3 ms 860 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 3 ms 856 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 27216 KB Output is correct
2 Correct 136 ms 27216 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 8472 KB Output is correct
2 Correct 81 ms 10028 KB Output is correct
3 Correct 159 ms 23060 KB Output is correct
4 Correct 143 ms 27464 KB Output is correct
5 Correct 142 ms 27932 KB Output is correct
6 Correct 131 ms 25168 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 3 ms 600 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 3 ms 856 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 3 ms 860 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 3 ms 856 KB Output is correct
10 Correct 148 ms 27216 KB Output is correct
11 Correct 136 ms 27216 KB Output is correct
12 Correct 68 ms 8472 KB Output is correct
13 Correct 81 ms 10028 KB Output is correct
14 Correct 159 ms 23060 KB Output is correct
15 Correct 143 ms 27464 KB Output is correct
16 Correct 142 ms 27932 KB Output is correct
17 Correct 131 ms 25168 KB Output is correct
18 Correct 135 ms 16764 KB Output is correct
19 Correct 141 ms 16732 KB Output is correct
20 Correct 210 ms 26448 KB Output is correct
21 Correct 139 ms 27184 KB Output is correct
22 Correct 141 ms 27724 KB Output is correct