oj.uz

Submission #929131

# Submission time Handle Problem Language Result Execution time Memory
929131 2024-02-17T18:29:01 Z abcvuitunggio Dungeons Game (IOI21_dungeons) C++17
89 / 100
 1890 ms 1899232 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)
                    break;
                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=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: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 93 ms 473172 KB Output is correct
2 Correct 51 ms 473168 KB Output is correct
3 Correct 53 ms 481708 KB Output is correct
4 Correct 133 ms 660308 KB Output is correct
5 Correct 56 ms 481620 KB Output is correct
6 Correct 118 ms 660384 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 477904 KB Output is correct
2 Correct 993 ms 1898580 KB Output is correct
3 Correct 883 ms 1898584 KB Output is correct
4 Correct 676 ms 1898608 KB Output is correct
5 Correct 657 ms 1898580 KB Output is correct
6 Correct 994 ms 1898556 KB Output is correct
7 Correct 583 ms 1898672 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 477524 KB Output is correct
2 Correct 183 ms 661072 KB Output is correct
3 Correct 167 ms 661220 KB Output is correct
4 Correct 135 ms 661072 KB Output is correct
5 Correct 137 ms 661148 KB Output is correct
6 Correct 164 ms 661076 KB Output is correct
7 Correct 152 ms 661092 KB Output is correct
8 Correct 145 ms 661068 KB Output is correct
9 Correct 140 ms 661076 KB Output is correct
10 Correct 137 ms 661276 KB Output is correct
11 Correct 171 ms 581204 KB Output is correct
12 Correct 304 ms 661108 KB Output is correct
13 Correct 204 ms 661116 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 477524 KB Output is correct
2 Correct 183 ms 661072 KB Output is correct
3 Correct 167 ms 661220 KB Output is correct
4 Correct 135 ms 661072 KB Output is correct
5 Correct 137 ms 661148 KB Output is correct
6 Correct 164 ms 661076 KB Output is correct
7 Correct 152 ms 661092 KB Output is correct
8 Correct 145 ms 661068 KB Output is correct
9 Correct 140 ms 661076 KB Output is correct
10 Correct 137 ms 661276 KB Output is correct
11 Correct 171 ms 581204 KB Output is correct
12 Correct 304 ms 661108 KB Output is correct
13 Correct 204 ms 661116 KB Output is correct
14 Correct 58 ms 477364 KB Output is correct
15 Correct 158 ms 661220 KB Output is correct
16 Correct 181 ms 661076 KB Output is correct
17 Correct 140 ms 661108 KB Output is correct
18 Correct 149 ms 661076 KB Output is correct
19 Correct 168 ms 661216 KB Output is correct
20 Correct 157 ms 661128 KB Output is correct
21 Correct 167 ms 661328 KB Output is correct
22 Correct 161 ms 566872 KB Output is correct
23 Correct 195 ms 661152 KB Output is correct
24 Correct 319 ms 661344 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 477524 KB Output is correct
2 Correct 183 ms 661072 KB Output is correct
3 Correct 167 ms 661220 KB Output is correct
4 Correct 135 ms 661072 KB Output is correct
5 Correct 137 ms 661148 KB Output is correct
6 Correct 164 ms 661076 KB Output is correct
7 Correct 152 ms 661092 KB Output is correct
8 Correct 145 ms 661068 KB Output is correct
9 Correct 140 ms 661076 KB Output is correct
10 Correct 137 ms 661276 KB Output is correct
11 Correct 171 ms 581204 KB Output is correct
12 Correct 304 ms 661108 KB Output is correct
13 Correct 204 ms 661116 KB Output is correct
14 Correct 58 ms 477364 KB Output is correct
15 Correct 158 ms 661220 KB Output is correct
16 Correct 181 ms 661076 KB Output is correct
17 Correct 140 ms 661108 KB Output is correct
18 Correct 149 ms 661076 KB Output is correct
19 Correct 168 ms 661216 KB Output is correct
20 Correct 157 ms 661128 KB Output is correct
21 Correct 167 ms 661328 KB Output is correct
22 Correct 161 ms 566872 KB Output is correct
23 Correct 195 ms 661152 KB Output is correct
24 Correct 319 ms 661344 KB Output is correct
25 Correct 126 ms 660496 KB Output is correct
26 Correct 179 ms 661204 KB Output is correct
27 Correct 159 ms 661304 KB Output is correct
28 Correct 167 ms 661080 KB Output is correct
29 Correct 185 ms 661072 KB Output is correct
30 Correct 197 ms 661488 KB Output is correct
31 Correct 188 ms 661196 KB Output is correct
32 Correct 297 ms 661076 KB Output is correct
33 Correct 431 ms 661096 KB Output is correct
34 Correct 1172 ms 661072 KB Output is correct
35 Correct 279 ms 581200 KB Output is correct

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 477904 KB Output is correct
2 Correct 993 ms 1898580 KB Output is correct
3 Correct 883 ms 1898584 KB Output is correct
4 Correct 676 ms 1898608 KB Output is correct
5 Correct 657 ms 1898580 KB Output is correct
6 Correct 994 ms 1898556 KB Output is correct
7 Correct 583 ms 1898672 KB Output is correct
8 Correct 53 ms 477524 KB Output is correct
9 Correct 183 ms 661072 KB Output is correct
10 Correct 167 ms 661220 KB Output is correct
11 Correct 135 ms 661072 KB Output is correct
12 Correct 137 ms 661148 KB Output is correct
13 Correct 164 ms 661076 KB Output is correct
14 Correct 152 ms 661092 KB Output is correct
15 Correct 145 ms 661068 KB Output is correct
16 Correct 140 ms 661076 KB Output is correct
17 Correct 137 ms 661276 KB Output is correct
18 Correct 171 ms 581204 KB Output is correct
19 Correct 304 ms 661108 KB Output is correct
20 Correct 204 ms 661116 KB Output is correct
21 Correct 58 ms 477364 KB Output is correct
22 Correct 158 ms 661220 KB Output is correct
23 Correct 181 ms 661076 KB Output is correct
24 Correct 140 ms 661108 KB Output is correct
25 Correct 149 ms 661076 KB Output is correct
26 Correct 168 ms 661216 KB Output is correct
27 Correct 157 ms 661128 KB Output is correct
28 Correct 167 ms 661328 KB Output is correct
29 Correct 161 ms 566872 KB Output is correct
30 Correct 195 ms 661152 KB Output is correct
31 Correct 319 ms 661344 KB Output is correct
32 Correct 126 ms 660496 KB Output is correct
33 Correct 179 ms 661204 KB Output is correct
34 Correct 159 ms 661304 KB Output is correct
35 Correct 167 ms 661080 KB Output is correct
36 Correct 185 ms 661072 KB Output is correct
37 Correct 197 ms 661488 KB Output is correct
38 Correct 188 ms 661196 KB Output is correct
39 Correct 297 ms 661076 KB Output is correct
40 Correct 431 ms 661096 KB Output is correct
41 Correct 1172 ms 661072 KB Output is correct
42 Correct 279 ms 581200 KB Output is correct
43 Correct 51 ms 473244 KB Output is correct
44 Correct 53 ms 477524 KB Output is correct
45 Correct 1000 ms 1898832 KB Output is correct
46 Correct 952 ms 1898576 KB Output is correct
47 Correct 882 ms 1898832 KB Output is correct
48 Correct 693 ms 1898580 KB Output is correct
49 Correct 999 ms 1898680 KB Output is correct
50 Correct 935 ms 1898576 KB Output is correct
51 Correct 645 ms 1898580 KB Output is correct
52 Correct 906 ms 1899088 KB Output is correct
53 Correct 1890 ms 1899232 KB Output is correct
54 Correct 1184 ms 1898580 KB Output is correct
55 Correct 1771 ms 1898580 KB Output is correct
56 Correct 1643 ms 1652284 KB Output is correct
57 Correct 1675 ms 1652628 KB Output is correct
58 Incorrect 1650 ms 1652280 KB Output isn't correct
59 Halted 0 ms 0 KB -