oj.uz

Submission #563990

# Submission time Handle Problem Language Result Execution time Memory
563990 2022-05-18T11:12:58 Z KoD Editor (BOI15_edi) C++17
35 / 100
 3000 ms 5292 KB 
#include <bits/stdc++.h>
 
using ll = long long;
 
using std::vector;
using std::array;
using std::pair;
using std::tuple;
 
template <class T> constexpr T infty = std::numeric_limits<T>::max() / 2;
 
int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int N;
    std::cin >> N;
    vector<int> op(N);
    for (auto& x : op) {
        std::cin >> x;
    }
    vector<char> active(N);
    vector<int> par(N);
    for (int i = 0; i < N; ++i) {
        active[i] = true;
        if (op[i] < 0) {
            int j = i - 1;
            while (op[j] <= op[i] or !active[j]) {
                j -= 1;
            }
            par[i] = j;
            int k = i;
            while (op[k] < 0) {
                active[par[k]] ^= 1;
                k = par[k];
            }
        } else {
            par[i] = -1;
        }
        int ans = 0;
        for (int j = i; j >= 0; --j) {
            if (active[j] and op[j] > 0) {
                ans = op[j];
                break;
            }
        }
        std::cout << ans << '\n';
    }
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 9 ms 412 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 44 ms 376 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 340 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 711 ms 5108 KB Output is correct
2 Correct 781 ms 5292 KB Output is correct

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3051 ms 2668 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 9 ms 412 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 44 ms 376 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 711 ms 5108 KB Output is correct
11 Correct 781 ms 5292 KB Output is correct
12 Execution timed out 3051 ms 2668 KB Time limit exceeded
13 Halted 0 ms 0 KB -