oj.uz

Submission #563953

# Submission time Handle Problem Language Result Execution time Memory
563953 2022-05-18T09:59:19 Z KoD Editor (BOI15_edi) C++17
100 / 100
 306 ms 50184 KB 
#include <bits/stdc++.h>

using std::vector;
using std::array;

constexpr int LOG = 19;

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int N;
    std::cin >> N;
    vector<int> ans(N);
    array<vector<int>, LOG> par, level;
    for (int j = 0; j < LOG; ++j) {
        par[j].resize(N);
        level[j].resize(N);
    }
    for (int i = 0; i < N; ++i) {
        int op;
        std::cin >> op;
        if (op > 0) {
            ans[i] = op;
            level[0][i] = 0;
            par[0][i] = i;
        } else {
            level[0][i] = -op;
            int to = i - 1;
            for (int j = LOG - 1; j >= 0; --j) {
                if (level[j][to] >= level[0][i]) {
                    to = par[j][to];
                }
            }
            to -= 1;
            par[0][i] = to;
            ans[i] = to == -1 ? 0 : ans[to];
        }
        for (int j = 0; j < LOG - 1; ++j) {
            if (par[j][i] == -1) {
                par[j + 1][i] = -1;
                level[j + 1][i] = 0;
            } else {
                par[j + 1][i] = par[j][par[j][i]];
                level[j + 1][i] = std::min(level[j][i], level[j][par[j][i]]);
            }
        }
        std::cout << ans[i] << '\n';
    }
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 324 KB Output is correct
2 Correct 2 ms 1116 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 3 ms 1108 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 2 ms 1128 KB Output is correct
8 Correct 0 ms 320 KB Output is correct
9 Correct 2 ms 1096 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 258 ms 49420 KB Output is correct
2 Correct 253 ms 49484 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 25076 KB Output is correct
2 Correct 167 ms 29984 KB Output is correct
3 Correct 246 ms 39104 KB Output is correct
4 Correct 248 ms 49484 KB Output is correct
5 Correct 269 ms 50184 KB Output is correct
6 Correct 247 ms 47392 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 324 KB Output is correct
2 Correct 2 ms 1116 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 3 ms 1108 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 2 ms 1128 KB Output is correct
8 Correct 0 ms 320 KB Output is correct
9 Correct 2 ms 1096 KB Output is correct
10 Correct 258 ms 49420 KB Output is correct
11 Correct 253 ms 49484 KB Output is correct
12 Correct 134 ms 25076 KB Output is correct
13 Correct 167 ms 29984 KB Output is correct
14 Correct 246 ms 39104 KB Output is correct
15 Correct 248 ms 49484 KB Output is correct
16 Correct 269 ms 50184 KB Output is correct
17 Correct 247 ms 47392 KB Output is correct
18 Correct 267 ms 50080 KB Output is correct
19 Correct 264 ms 50008 KB Output is correct
20 Correct 306 ms 48716 KB Output is correct
21 Correct 253 ms 49464 KB Output is correct
22 Correct 258 ms 50180 KB Output is correct