oj.uz

Submission #1053377

# Submission time Handle Problem Language Result Execution time Memory
1053377 2024-08-11T11:07:26 Z Zicrus Dungeons Game (IOI21_dungeons) C++17
25 / 100
 749 ms 2097152 KB 
#include <bits/stdc++.h>
#include "dungeons.h"
using namespace std;
 
typedef long long ll;
 
ll n;
vector<int> s1, p, w, l;
vector<ll> s;
vector<vector<vector<pair<ll, ll>>>> jmp;
vector<ll> dp;
 
void init(int n1, vector<int> s11, vector<int> p1, vector<int> w1, vector<int> l1) {
    n = n1; p = p1; w = w1; l = l1; s1 = s11;
    vector<int> s22 = s11;
    s.clear();
    jmp.clear();
    sort(s22.begin(), s22.end());
    ll prev = -1;
    for (int i = 0; i < n; i++) {
        if (s22[i] != prev) {
            jmp.push_back(vector<vector<pair<ll, ll>>>(n, vector<pair<ll, ll>>(30)));
            s.push_back(s22[i]);
            prev = s22[i];
        }
    }
    for (int h = 0; h < s.size(); h++) {
        for (int i = 0; i < n; i++) {
            pair<ll, ll> win = {s1[i], w[i]};
            pair<ll, ll> lose = {p[i], l[i]};
            jmp[h][i][0] = (h > 0 && s1[i] <= s[h-1]) ? win : lose;
            if (jmp[h][i][0].second == n) jmp[h][i][0].first = 1ll << 31ll;
        }
    }
    for (int h = 0; h < s.size(); h++) {
        for (int j = 1; j < 30; j++) {
            for (int i = 0; i < n; i++) {
                if (jmp[h][i][j-1].second == n) {
                    jmp[h][i][j] = {1ll << 31ll, n};
                    continue;
                }
                if (jmp[h][jmp[h][i][j-1].second][j-1].second == n) {
                    jmp[h][i][j] = {1ll << 31ll, n};
                    continue;
                }
                jmp[h][i][j] = {jmp[h][jmp[h][i][j-1].second][j-1].first + jmp[h][i][j-1].first,
                            jmp[h][jmp[h][i][j-1].second][j-1].second};
            }
        }
    }
    dp = vector<ll>(n+1);
    dp[n] = 0;
    for (int i = n-1; i >= 0; i--) {
        dp[i] = s1[i] + dp[w[i]];
    }
}
 
ll simulate(int x1, int z1) {
	ll i = x1, z = z1;
    if (i == n || z >= s.back()) return z + dp[i];

    ll h = 0;
    while (z < s.back() && i < n) {
        while (z >= s[h]) h++;

        for (int j = 30-1; j >= 0; j--) {
            if (z + jmp[h][i][j].first < s[h]) {
                z += jmp[h][i][j].first;
                i = jmp[h][i][j].second;
            }
        }
        if (z < s[h]) {
            bool win = h > 0 && s1[i] <= s[h-1];
            z += win ? s1[i] : p[i];
            i = win ? w[i] : l[i];
        }
    }
    z += dp[i];
    return z;
}

Compilation message

dungeons.cpp: In function 'void init(int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
dungeons.cpp:27:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for (int h = 0; h < s.size(); h++) {
      |                     ~~^~~~~~~~~~
dungeons.cpp:35:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for (int h = 0; h < s.size(); h++) {
      |                     ~~^~~~~~~~~~

Subtask #1
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 388 KB Output is correct
3 Correct 6 ms 10588 KB Output is correct
4 Runtime error 657 ms 2097152 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #2
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 308 ms 509100 KB Output is correct
2 Runtime error 749 ms 2097152 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 39 ms 29400 KB Output is correct
3 Correct 40 ms 29524 KB Output is correct
4 Correct 34 ms 29524 KB Output is correct
5 Correct 34 ms 29520 KB Output is correct
6 Correct 49 ms 29524 KB Output is correct
7 Correct 44 ms 30812 KB Output is correct
8 Correct 35 ms 29524 KB Output is correct
9 Correct 38 ms 29524 KB Output is correct
10 Correct 37 ms 29532 KB Output is correct
11 Correct 50 ms 29532 KB Output is correct
12 Correct 70 ms 29532 KB Output is correct
13 Correct 70 ms 29400 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 39 ms 29400 KB Output is correct
3 Correct 40 ms 29524 KB Output is correct
4 Correct 34 ms 29524 KB Output is correct
5 Correct 34 ms 29520 KB Output is correct
6 Correct 49 ms 29524 KB Output is correct
7 Correct 44 ms 30812 KB Output is correct
8 Correct 35 ms 29524 KB Output is correct
9 Correct 38 ms 29524 KB Output is correct
10 Correct 37 ms 29532 KB Output is correct
11 Correct 50 ms 29532 KB Output is correct
12 Correct 70 ms 29532 KB Output is correct
13 Correct 70 ms 29400 KB Output is correct
14 Correct 2 ms 2392 KB Output is correct
15 Correct 78 ms 81820 KB Output is correct
16 Correct 101 ms 107400 KB Output is correct
17 Correct 121 ms 132348 KB Output is correct
18 Correct 122 ms 132360 KB Output is correct
19 Correct 131 ms 132480 KB Output is correct
20 Correct 95 ms 81276 KB Output is correct
21 Correct 122 ms 106836 KB Output is correct
22 Correct 74 ms 55932 KB Output is correct
23 Correct 123 ms 107092 KB Output is correct
24 Correct 149 ms 81532 KB Output is correct

Subtask #5
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 39 ms 29400 KB Output is correct
3 Correct 40 ms 29524 KB Output is correct
4 Correct 34 ms 29524 KB Output is correct
5 Correct 34 ms 29520 KB Output is correct
6 Correct 49 ms 29524 KB Output is correct
7 Correct 44 ms 30812 KB Output is correct
8 Correct 35 ms 29524 KB Output is correct
9 Correct 38 ms 29524 KB Output is correct
10 Correct 37 ms 29532 KB Output is correct
11 Correct 50 ms 29532 KB Output is correct
12 Correct 70 ms 29532 KB Output is correct
13 Correct 70 ms 29400 KB Output is correct
14 Correct 2 ms 2392 KB Output is correct
15 Correct 78 ms 81820 KB Output is correct
16 Correct 101 ms 107400 KB Output is correct
17 Correct 121 ms 132348 KB Output is correct
18 Correct 122 ms 132360 KB Output is correct
19 Correct 131 ms 132480 KB Output is correct
20 Correct 95 ms 81276 KB Output is correct
21 Correct 122 ms 106836 KB Output is correct
22 Correct 74 ms 55932 KB Output is correct
23 Correct 123 ms 107092 KB Output is correct
24 Correct 149 ms 81532 KB Output is correct
25 Runtime error 683 ms 2097152 KB Execution killed with signal 9
26 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 308 ms 509100 KB Output is correct
2 Runtime error 749 ms 2097152 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -