oj.uz

Submission #415676

# Submission time Handle Problem Language Result Execution time Memory
415676 2021-06-01T11:03:39 Z KoD The short shank; Redemption (BOI21_prison) C++17
35 / 100
 2000 ms 15048 KB 
#include <bits/stdc++.h>

template <class T> using Vec = std::vector<T>;

template <class F> struct RecLambda : private F {
    explicit RecLambda(F&& f): F(std::forward<F>(f)) {}
    template <class... Args> decltype(auto) operator() (Args&&... args) const {
        return F::operator()(*this, std::forward<Args>(args)...);
    }
};

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int N, D, T;
    std::cin >> N >> D >> T;
    Vec<int> A(N);
    for (auto& x : A) {
        std::cin >> x;
    }
    Vec<int> match(N);
    Vec<char> done(N);
    Vec<int> stack;
    int ans = N;
    for (int i = 0; i < N; ++i) {
        if (A[i] <= T) {
            done[i] = true;
            stack.push_back(i);
        }
        else {
            while (!stack.empty()) {
                const int j = stack.back();
                if (j + (T - A[j]) >= i) {
                    break;
                }
                stack.pop_back();
            }
            if (stack.empty()) {
                done[i] = true;
                ans -= 1;
            }
            else {
                match[i] = stack.back();
            }
        }
    }
    Vec<int> gain;
    const auto dfs = RecLambda([&](auto&& dfs, const int u) -> int {
        done[u] = true;
        Vec<int> path;
        for (int v = u - 1; v >= match[u]; --v) {
            if (!done[v]) {
                assert(match[u] <= match[v]);
                path.push_back(dfs(v));
            }
        }
        if (path.empty()) {
            return 1;
        }
        std::sort(path.begin(), path.end());
        const int ret = path.back() + 1;
        path.pop_back();
        std::copy(path.begin(), path.end(), std::back_inserter(gain));
        return ret;
    });
    for (int u = N - 1; u >= 0; --u) {
        if (!done[u]) {
            gain.push_back(dfs(u));
        }
    }
    std::sort(gain.rbegin(), gain.rend());
    for (int i = 0; i < std::min(D, (int) gain.size()); ++i) {
        ans -= gain[i];
    }
    std::cout << ans << '\n';
    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 296 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 404 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 204 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 106 ms 8140 KB Output is correct
3 Correct 116 ms 11752 KB Output is correct
4 Correct 1062 ms 13532 KB Output is correct
5 Correct 85 ms 7224 KB Output is correct
6 Execution timed out 2008 ms 15048 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 296 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 404 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 2 ms 300 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 2 ms 232 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 312 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 204 KB Output is correct
23 Correct 3 ms 368 KB Output is correct
24 Correct 2 ms 344 KB Output is correct
25 Correct 2 ms 368 KB Output is correct
26 Correct 2 ms 368 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 2 ms 332 KB Output is correct
32 Correct 2 ms 284 KB Output is correct
33 Correct 2 ms 356 KB Output is correct
34 Correct 2 ms 332 KB Output is correct
35 Correct 4 ms 460 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 18 ms 2000 KB Output is correct
3 Correct 16 ms 2020 KB Output is correct
4 Correct 1531 ms 5916 KB Output is correct
5 Execution timed out 2019 ms 8140 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 296 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 404 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 2 ms 300 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 2 ms 232 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 312 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 204 KB Output is correct
23 Correct 3 ms 368 KB Output is correct
24 Correct 2 ms 344 KB Output is correct
25 Correct 2 ms 368 KB Output is correct
26 Correct 2 ms 368 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 2 ms 332 KB Output is correct
32 Correct 2 ms 284 KB Output is correct
33 Correct 2 ms 356 KB Output is correct
34 Correct 2 ms 332 KB Output is correct
35 Correct 4 ms 460 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 18 ms 2000 KB Output is correct
38 Correct 16 ms 2020 KB Output is correct
39 Correct 1531 ms 5916 KB Output is correct
40 Execution timed out 2019 ms 8140 KB Time limit exceeded
41 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 296 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 404 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 106 ms 8140 KB Output is correct
14 Correct 116 ms 11752 KB Output is correct
15 Correct 1062 ms 13532 KB Output is correct
16 Correct 85 ms 7224 KB Output is correct
17 Execution timed out 2008 ms 15048 KB Time limit exceeded
18 Halted 0 ms 0 KB -