oj.uz

Submission #929122

# Submission time Handle Problem Language Result Execution time Memory
929122 2024-02-17T18:18:16 Z abcvuitunggio Dungeons Game (IOI21_dungeons) C++17
100 / 100
 2076 ms 1899344 KB 
#include "dungeons.h"
#include <bits/stdc++.h>
using namespace std;
const int base=6,sz=10;
const long long INF=1e18;
int N,nxt[24][400001][sz];
long long mn[24][400001][sz],sum[24][400001][sz];
vector <int> S,P,W,L,ve={1};
void init(int n, vector <int> s, vector <int> p, vector <int> w, vector <int> l){
    N=n,S=s,P=p,W=w,L=l;
    for (int i=1;i<sz;i++)
        ve.push_back(ve.back()*base);
    memset(nxt,-1,sizeof(nxt));
    for (int i=0;i<n;i++){
        for (int j=0;j<sz;j++)
            if (s[i]<=ve[j]){
                nxt[0][i][j]=w[i];
                sum[0][i][j]=s[i];
                mn[0][i][j]=INF;
            }
            else{
                nxt[0][i][j]=l[i];
                sum[0][i][j]=p[i];
                mn[0][i][j]=s[i];
            }
        nxt[0][i][sz]=w[i];
    }
    for (int j=1;j<24;j++){
        for (int i=0;i<n;i++)
            for (int k=0;k<sz;k++){
                if (nxt[j-1][i][k]==-1)
                    continue;
                int u=nxt[j-1][i][k];
                nxt[j][i][k]=nxt[j-1][u][k];
                mn[j][i][k]=min(mn[j-1][i][k],mn[j-1][u][k]-sum[j-1][i][k]);
                sum[j][i][k]=sum[j-1][i][k]+sum[j-1][u][k];
            }
    }
}
long long simulate(int x, int Z){
    int cur=0;
    long long z=Z;
    while (cur<sz){
        while (cur<sz&&ve[cur]<=z)
            cur++;
        int j=cur-1;
        for (int i=23;i>=0;i--)
            if (nxt[i][x][j]!=-1&&z<mn[i][x][j]){
                z+=sum[i][x][j];
                x=nxt[i][x][j];
            }
        if (x==N)
            break;
        if (z<S[x]){
            z+=P[x];
            x=L[x];
        }
        else{
            z+=S[x];
            x=W[x];
        }
    }
    int j=cur-1;
    for (int i=23;i>=0;i--)
        if (nxt[i][x][j]!=-1){
            z+=sum[i][x][j];
            x=nxt[i][x][j];
        }
    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:26:21: warning: array subscript 10 is above array bounds of 'int [10]' [-Warray-bounds]
   26 |         nxt[0][i][sz]=w[i];
      |         ~~~~~~~~~~~~^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 473168 KB Output is correct
2 Correct 52 ms 473168 KB Output is correct
3 Correct 57 ms 481620 KB Output is correct
4 Correct 136 ms 660256 KB Output is correct
5 Correct 54 ms 481620 KB Output is correct
6 Correct 119 ms 660264 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 477520 KB Output is correct
2 Correct 980 ms 1898556 KB Output is correct
3 Correct 884 ms 1899064 KB Output is correct
4 Correct 657 ms 1898580 KB Output is correct
5 Correct 669 ms 1898568 KB Output is correct
6 Correct 961 ms 1898624 KB Output is correct
7 Correct 593 ms 1898576 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 477524 KB Output is correct
2 Correct 178 ms 661256 KB Output is correct
3 Correct 166 ms 661160 KB Output is correct
4 Correct 140 ms 661076 KB Output is correct
5 Correct 136 ms 661216 KB Output is correct
6 Correct 177 ms 661084 KB Output is correct
7 Correct 151 ms 661152 KB Output is correct
8 Correct 148 ms 661204 KB Output is correct
9 Correct 143 ms 661120 KB Output is correct
10 Correct 142 ms 661076 KB Output is correct
11 Correct 178 ms 581164 KB Output is correct
12 Correct 313 ms 661068 KB Output is correct
13 Correct 213 ms 661248 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 477524 KB Output is correct
2 Correct 178 ms 661256 KB Output is correct
3 Correct 166 ms 661160 KB Output is correct
4 Correct 140 ms 661076 KB Output is correct
5 Correct 136 ms 661216 KB Output is correct
6 Correct 177 ms 661084 KB Output is correct
7 Correct 151 ms 661152 KB Output is correct
8 Correct 148 ms 661204 KB Output is correct
9 Correct 143 ms 661120 KB Output is correct
10 Correct 142 ms 661076 KB Output is correct
11 Correct 178 ms 581164 KB Output is correct
12 Correct 313 ms 661068 KB Output is correct
13 Correct 213 ms 661248 KB Output is correct
14 Correct 58 ms 477524 KB Output is correct
15 Correct 158 ms 661076 KB Output is correct
16 Correct 178 ms 661100 KB Output is correct
17 Correct 143 ms 661356 KB Output is correct
18 Correct 149 ms 661044 KB Output is correct
19 Correct 164 ms 661072 KB Output is correct
20 Correct 168 ms 661076 KB Output is correct
21 Correct 171 ms 661072 KB Output is correct
22 Correct 174 ms 566700 KB Output is correct
23 Correct 224 ms 661132 KB Output is correct
24 Correct 353 ms 661112 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 477524 KB Output is correct
2 Correct 178 ms 661256 KB Output is correct
3 Correct 166 ms 661160 KB Output is correct
4 Correct 140 ms 661076 KB Output is correct
5 Correct 136 ms 661216 KB Output is correct
6 Correct 177 ms 661084 KB Output is correct
7 Correct 151 ms 661152 KB Output is correct
8 Correct 148 ms 661204 KB Output is correct
9 Correct 143 ms 661120 KB Output is correct
10 Correct 142 ms 661076 KB Output is correct
11 Correct 178 ms 581164 KB Output is correct
12 Correct 313 ms 661068 KB Output is correct
13 Correct 213 ms 661248 KB Output is correct
14 Correct 58 ms 477524 KB Output is correct
15 Correct 158 ms 661076 KB Output is correct
16 Correct 178 ms 661100 KB Output is correct
17 Correct 143 ms 661356 KB Output is correct
18 Correct 149 ms 661044 KB Output is correct
19 Correct 164 ms 661072 KB Output is correct
20 Correct 168 ms 661076 KB Output is correct
21 Correct 171 ms 661072 KB Output is correct
22 Correct 174 ms 566700 KB Output is correct
23 Correct 224 ms 661132 KB Output is correct
24 Correct 353 ms 661112 KB Output is correct
25 Correct 162 ms 660308 KB Output is correct
26 Correct 183 ms 661112 KB Output is correct
27 Correct 166 ms 661076 KB Output is correct
28 Correct 164 ms 661076 KB Output is correct
29 Correct 221 ms 661168 KB Output is correct
30 Correct 187 ms 661288 KB Output is correct
31 Correct 209 ms 661216 KB Output is correct
32 Correct 277 ms 661072 KB Output is correct
33 Correct 496 ms 661076 KB Output is correct
34 Correct 1099 ms 661152 KB Output is correct
35 Correct 389 ms 661184 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 477520 KB Output is correct
2 Correct 980 ms 1898556 KB Output is correct
3 Correct 884 ms 1899064 KB Output is correct
4 Correct 657 ms 1898580 KB Output is correct
5 Correct 669 ms 1898568 KB Output is correct
6 Correct 961 ms 1898624 KB Output is correct
7 Correct 593 ms 1898576 KB Output is correct
8 Correct 52 ms 477524 KB Output is correct
9 Correct 178 ms 661256 KB Output is correct
10 Correct 166 ms 661160 KB Output is correct
11 Correct 140 ms 661076 KB Output is correct
12 Correct 136 ms 661216 KB Output is correct
13 Correct 177 ms 661084 KB Output is correct
14 Correct 151 ms 661152 KB Output is correct
15 Correct 148 ms 661204 KB Output is correct
16 Correct 143 ms 661120 KB Output is correct
17 Correct 142 ms 661076 KB Output is correct
18 Correct 178 ms 581164 KB Output is correct
19 Correct 313 ms 661068 KB Output is correct
20 Correct 213 ms 661248 KB Output is correct
21 Correct 58 ms 477524 KB Output is correct
22 Correct 158 ms 661076 KB Output is correct
23 Correct 178 ms 661100 KB Output is correct
24 Correct 143 ms 661356 KB Output is correct
25 Correct 149 ms 661044 KB Output is correct
26 Correct 164 ms 661072 KB Output is correct
27 Correct 168 ms 661076 KB Output is correct
28 Correct 171 ms 661072 KB Output is correct
29 Correct 174 ms 566700 KB Output is correct
30 Correct 224 ms 661132 KB Output is correct
31 Correct 353 ms 661112 KB Output is correct
32 Correct 162 ms 660308 KB Output is correct
33 Correct 183 ms 661112 KB Output is correct
34 Correct 166 ms 661076 KB Output is correct
35 Correct 164 ms 661076 KB Output is correct
36 Correct 221 ms 661168 KB Output is correct
37 Correct 187 ms 661288 KB Output is correct
38 Correct 209 ms 661216 KB Output is correct
39 Correct 277 ms 661072 KB Output is correct
40 Correct 496 ms 661076 KB Output is correct
41 Correct 1099 ms 661152 KB Output is correct
42 Correct 389 ms 661184 KB Output is correct
43 Correct 52 ms 473212 KB Output is correct
44 Correct 55 ms 477540 KB Output is correct
45 Correct 1136 ms 1898568 KB Output is correct
46 Correct 925 ms 1898580 KB Output is correct
47 Correct 871 ms 1898496 KB Output is correct
48 Correct 719 ms 1898552 KB Output is correct
49 Correct 1014 ms 1898468 KB Output is correct
50 Correct 911 ms 1898576 KB Output is correct
51 Correct 629 ms 1898556 KB Output is correct
52 Correct 911 ms 1898504 KB Output is correct
53 Correct 2017 ms 1898600 KB Output is correct
54 Correct 1214 ms 1898576 KB Output is correct
55 Correct 1785 ms 1898752 KB Output is correct
56 Correct 1911 ms 1898848 KB Output is correct
57 Correct 1959 ms 1898648 KB Output is correct
58 Correct 2076 ms 1899344 KB Output is correct
59 Correct 2076 ms 1898628 KB Output is correct
60 Correct 2075 ms 1898668 KB Output is correct
61 Correct 1591 ms 1898664 KB Output is correct