oj.uz

Submission #924855

# Submission time Handle Problem Language Result Execution time Memory
924855 2024-02-09T23:25:42 Z Programmer123 Dungeons Game (IOI21_dungeons) C++17
11 / 100
 7000 ms 1374436 KB 
#include "dungeons.h"
#include <bits/stdc++.h>

std::vector<int> s, p, w, l;
int N;
long long *minBlitz, *gainBlitz;

long long dp(int node, long long str);

long long calc(int node, long long str) {
    if (str >= s[node]) {
        return dp(w[node], str + s[node]);
    } else return dp(l[node], str + p[node]);
}

std::unordered_map<long long, long long> *cache;

long long dp(int node, long long str) {
    assert(node != N);
    if (str >= minBlitz[node]) return str + gainBlitz[node];
    if (!cache[node].count(str)) {
        cache[node][str] = calc(node, str);
    }
    return cache[node][str];
}

void init(int n, std::vector<int> _s, std::vector<int> _p, std::vector<int> _w, std::vector<int> _l) {
    N = n;
    s = std::move(_s);
    p = std::move(_p);
    w = std::move(_w);
    l = std::move(_l);
    minBlitz = new long long[N + 1];
    gainBlitz = new long long[N + 1];
    for (int i = 0; i <= N; ++i) {
        gainBlitz[i] = -1;
    }
    std::function<void(int)> calc = [&](int x) {
        if (gainBlitz[x] != -1) return;
        if (x == N) {
            minBlitz[x] = 0;
            gainBlitz[x] = 0;
            return;
        }
        calc(w[x]);
        minBlitz[x] = std::max(minBlitz[w[x]] - s[x], (long long) s[x]);
        gainBlitz[x] = gainBlitz[w[x]] + s[x];
    };
    for (int i = 0; i <= N; ++i) {
        calc(i);
    }
    cache = new std::remove_pointer<decltype(cache)>::type[N + 1];
#ifdef LOCAL
    std::cout << "minBlitz:";
    for (int i = 0; i <= N; ++i) {
        std::cout << " " << minBlitz[i];
    }
    std::cout << std::endl;
    std::cout << "gainBlitz:";
    for (int i = 0; i <= N; ++i) {
        std::cout << " " << gainBlitz[i];
    }
    std::cout << std::endl;
#endif
}

long long simulate(int x, int z) {
    return dp(x, z);
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 856 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 16 ms 6464 KB Output is correct
5 Correct 3 ms 1372 KB Output is correct
6 Correct 19 ms 8008 KB Output is correct

Subtask #2
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Execution timed out 7082 ms 1374436 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 32 ms 10580 KB Output is correct
3 Correct 43 ms 13136 KB Output is correct
4 Correct 33 ms 9808 KB Output is correct
5 Correct 28 ms 9164 KB Output is correct
6 Execution timed out 7068 ms 1085544 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 32 ms 10580 KB Output is correct
3 Correct 43 ms 13136 KB Output is correct
4 Correct 33 ms 9808 KB Output is correct
5 Correct 28 ms 9164 KB Output is correct
6 Execution timed out 7068 ms 1085544 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 32 ms 10580 KB Output is correct
3 Correct 43 ms 13136 KB Output is correct
4 Correct 33 ms 9808 KB Output is correct
5 Correct 28 ms 9164 KB Output is correct
6 Execution timed out 7068 ms 1085544 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Execution timed out 7082 ms 1374436 KB Time limit exceeded
3 Halted 0 ms 0 KB -