oj.uz

Submission #929755

# Submission time Handle Problem Language Result Execution time Memory
929755 2024-02-18T07:55:08 Z abcvuitunggio Dungeons Game (IOI21_dungeons) C++17
100 / 100
 3024 ms 1222612 KB 
#include "dungeons.h"
#include <bits/stdc++.h>
using namespace std;
const int base=10,sz=8;
int N,nxt[24][400001][sz],mn[24][400001][sz];
long long 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]=1e9;
            }
            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],(int)max(mn[j-1][u][k]-sum[j-1][i][k],0LL));
                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 (x<N){
        while (cur<sz&&ve[cur]<=z)
            cur++;
        if (cur==sz)
            break;
        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=18;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:25:21: warning: array subscript 8 is above array bounds of 'int [8]' [-Warray-bounds]
   25 |         nxt[0][i][sz]=w[i];
      |         ~~~~~~~~~~~~^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 398176 KB Output is correct
2 Correct 50 ms 398080 KB Output is correct
3 Correct 53 ms 404340 KB Output is correct
4 Correct 122 ms 509392 KB Output is correct
5 Correct 55 ms 404448 KB Output is correct
6 Correct 103 ms 509268 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 402260 KB Output is correct
2 Correct 939 ms 1222584 KB Output is correct
3 Correct 870 ms 1222360 KB Output is correct
4 Correct 715 ms 1222156 KB Output is correct
5 Correct 801 ms 1222220 KB Output is correct
6 Correct 868 ms 1222296 KB Output is correct
7 Correct 640 ms 1222224 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 402428 KB Output is correct
2 Correct 210 ms 510116 KB Output is correct
3 Correct 176 ms 510404 KB Output is correct
4 Correct 124 ms 510276 KB Output is correct
5 Correct 171 ms 510084 KB Output is correct
6 Correct 162 ms 510284 KB Output is correct
7 Correct 132 ms 510036 KB Output is correct
8 Correct 142 ms 510196 KB Output is correct
9 Correct 155 ms 510168 KB Output is correct
10 Correct 145 ms 510072 KB Output is correct
11 Correct 151 ms 450640 KB Output is correct
12 Correct 314 ms 510432 KB Output is correct
13 Correct 216 ms 510136 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 402428 KB Output is correct
2 Correct 210 ms 510116 KB Output is correct
3 Correct 176 ms 510404 KB Output is correct
4 Correct 124 ms 510276 KB Output is correct
5 Correct 171 ms 510084 KB Output is correct
6 Correct 162 ms 510284 KB Output is correct
7 Correct 132 ms 510036 KB Output is correct
8 Correct 142 ms 510196 KB Output is correct
9 Correct 155 ms 510168 KB Output is correct
10 Correct 145 ms 510072 KB Output is correct
11 Correct 151 ms 450640 KB Output is correct
12 Correct 314 ms 510432 KB Output is correct
13 Correct 216 ms 510136 KB Output is correct
14 Correct 53 ms 402252 KB Output is correct
15 Correct 174 ms 510188 KB Output is correct
16 Correct 187 ms 510032 KB Output is correct
17 Correct 140 ms 510300 KB Output is correct
18 Correct 160 ms 510032 KB Output is correct
19 Correct 173 ms 510032 KB Output is correct
20 Correct 205 ms 510192 KB Output is correct
21 Correct 171 ms 510036 KB Output is correct
22 Correct 190 ms 436408 KB Output is correct
23 Correct 191 ms 510268 KB Output is correct
24 Correct 462 ms 510220 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 402428 KB Output is correct
2 Correct 210 ms 510116 KB Output is correct
3 Correct 176 ms 510404 KB Output is correct
4 Correct 124 ms 510276 KB Output is correct
5 Correct 171 ms 510084 KB Output is correct
6 Correct 162 ms 510284 KB Output is correct
7 Correct 132 ms 510036 KB Output is correct
8 Correct 142 ms 510196 KB Output is correct
9 Correct 155 ms 510168 KB Output is correct
10 Correct 145 ms 510072 KB Output is correct
11 Correct 151 ms 450640 KB Output is correct
12 Correct 314 ms 510432 KB Output is correct
13 Correct 216 ms 510136 KB Output is correct
14 Correct 53 ms 402252 KB Output is correct
15 Correct 174 ms 510188 KB Output is correct
16 Correct 187 ms 510032 KB Output is correct
17 Correct 140 ms 510300 KB Output is correct
18 Correct 160 ms 510032 KB Output is correct
19 Correct 173 ms 510032 KB Output is correct
20 Correct 205 ms 510192 KB Output is correct
21 Correct 171 ms 510036 KB Output is correct
22 Correct 190 ms 436408 KB Output is correct
23 Correct 191 ms 510268 KB Output is correct
24 Correct 462 ms 510220 KB Output is correct
25 Correct 135 ms 509264 KB Output is correct
26 Correct 243 ms 510296 KB Output is correct
27 Correct 241 ms 510288 KB Output is correct
28 Correct 149 ms 510272 KB Output is correct
29 Correct 192 ms 510140 KB Output is correct
30 Correct 213 ms 510152 KB Output is correct
31 Correct 168 ms 510032 KB Output is correct
32 Correct 327 ms 510160 KB Output is correct
33 Correct 852 ms 510180 KB Output is correct
34 Correct 1412 ms 510256 KB Output is correct
35 Correct 454 ms 510228 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 402260 KB Output is correct
2 Correct 939 ms 1222584 KB Output is correct
3 Correct 870 ms 1222360 KB Output is correct
4 Correct 715 ms 1222156 KB Output is correct
5 Correct 801 ms 1222220 KB Output is correct
6 Correct 868 ms 1222296 KB Output is correct
7 Correct 640 ms 1222224 KB Output is correct
8 Correct 52 ms 402428 KB Output is correct
9 Correct 210 ms 510116 KB Output is correct
10 Correct 176 ms 510404 KB Output is correct
11 Correct 124 ms 510276 KB Output is correct
12 Correct 171 ms 510084 KB Output is correct
13 Correct 162 ms 510284 KB Output is correct
14 Correct 132 ms 510036 KB Output is correct
15 Correct 142 ms 510196 KB Output is correct
16 Correct 155 ms 510168 KB Output is correct
17 Correct 145 ms 510072 KB Output is correct
18 Correct 151 ms 450640 KB Output is correct
19 Correct 314 ms 510432 KB Output is correct
20 Correct 216 ms 510136 KB Output is correct
21 Correct 53 ms 402252 KB Output is correct
22 Correct 174 ms 510188 KB Output is correct
23 Correct 187 ms 510032 KB Output is correct
24 Correct 140 ms 510300 KB Output is correct
25 Correct 160 ms 510032 KB Output is correct
26 Correct 173 ms 510032 KB Output is correct
27 Correct 205 ms 510192 KB Output is correct
28 Correct 171 ms 510036 KB Output is correct
29 Correct 190 ms 436408 KB Output is correct
30 Correct 191 ms 510268 KB Output is correct
31 Correct 462 ms 510220 KB Output is correct
32 Correct 135 ms 509264 KB Output is correct
33 Correct 243 ms 510296 KB Output is correct
34 Correct 241 ms 510288 KB Output is correct
35 Correct 149 ms 510272 KB Output is correct
36 Correct 192 ms 510140 KB Output is correct
37 Correct 213 ms 510152 KB Output is correct
38 Correct 168 ms 510032 KB Output is correct
39 Correct 327 ms 510160 KB Output is correct
40 Correct 852 ms 510180 KB Output is correct
41 Correct 1412 ms 510256 KB Output is correct
42 Correct 454 ms 510228 KB Output is correct
43 Correct 52 ms 398020 KB Output is correct
44 Correct 53 ms 402260 KB Output is correct
45 Correct 1056 ms 1222224 KB Output is correct
46 Correct 1084 ms 1222268 KB Output is correct
47 Correct 961 ms 1222140 KB Output is correct
48 Correct 692 ms 1222176 KB Output is correct
49 Correct 1093 ms 1222612 KB Output is correct
50 Correct 832 ms 1222336 KB Output is correct
51 Correct 644 ms 1222364 KB Output is correct
52 Correct 814 ms 1222244 KB Output is correct
53 Correct 2518 ms 1222172 KB Output is correct
54 Correct 1615 ms 1222160 KB Output is correct
55 Correct 2041 ms 1222220 KB Output is correct
56 Correct 2692 ms 1222296 KB Output is correct
57 Correct 2435 ms 1222244 KB Output is correct
58 Correct 2981 ms 1222224 KB Output is correct
59 Correct 2827 ms 1222356 KB Output is correct
60 Correct 3024 ms 1222336 KB Output is correct
61 Correct 2212 ms 1222224 KB Output is correct