oj.uz

Submission #600206

# Submission time Handle Problem Language Result Execution time Memory
600206 2022-07-20T14:16:13 Z Jarif_Rahman Dungeons Game (IOI21_dungeons) C++17
100 / 100
 5221 ms 1371116 KB 
#include "dungeons.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

const int K1 = 19, K2 = 9;
const ll inf = 1e18;

ll p5[35];

int n;
vector<int> S, P, W, L;

int* nxt[K1][K2];
ll* sum[K1][K2];
ll* dp[K1][K2];

int msb(ll x){
    return floor(log(x)/log(5));
}

pair<int, ll> binlift(int nd, ll s){
    if(s > dp[msb(s)][0][nd]) return {nd, s};
    for(int i = K2-1; i >= 0; i--) if(s <= dp[msb(s)][i][nd])
        return binlift(nxt[msb(s)][i][nd], s+sum[msb(s)][i][nd]);
    return {-1, -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;

    S.pb(0);
    P.pb(0);

    p5[0] = 1;
    for(int i = 1; i < 25; i++) p5[i] = p5[i-1]*5;

    for(int j = 0; j < K1; j++) for(int k = 0; k < K2; k++){
        nxt[j][k] = new int[n+1];
        sum[j][k] = new ll[n+1];
        dp[j][k] = new ll[n+1];

        fill(nxt[j][k], nxt[j][k]+n+1, n);
        fill(sum[j][k], sum[j][k]+n+1, 0);
        fill(dp[j][k], dp[j][k]+n+1, 0);
    }

    for(int k = 0; k < K1; k++) for(int i = 0; i < n; i++){
        if(S[i] <= p5[k]){
            nxt[k][0][i] = W[i];
            sum[k][0][i] = S[i];
            dp[k][0][i] = inf;
        }
        else{
            nxt[k][0][i] = L[i];
            sum[k][0][i] = P[i];
            dp[k][0][i] = S[i]-1;
        }
    }

    for(int k = 0; k < K1; k++){
        for(int p = 1; p < K2; p++) for(int i = 0; i <= n; i++){
            nxt[k][p][i] = nxt[k][p-1][nxt[k][p-1][nxt[k][p-1][nxt[k][p-1][nxt[k][p-1][i]]]]];

            sum[k][p][i] = sum[k][p-1][i]+sum[k][p-1][nxt[k][p-1][i]]+
                sum[k][p-1][nxt[k][p-1][nxt[k][p-1][i]]] +
                sum[k][p-1][nxt[k][p-1][nxt[k][p-1][nxt[k][p-1][i]]]] +
                sum[k][p-1][nxt[k][p-1][nxt[k][p-1][nxt[k][p-1][nxt[k][p-1][i]]]]];

            dp[k][p][i] = min(dp[k][p-1][i],
                min(dp[k][p-1][nxt[k][p-1][i]]-sum[k][p-1][i],
                min(
                dp[k][p-1][nxt[k][p-1][nxt[k][p-1][i]]]-sum[k][p-1][i]-sum[k][p-1][nxt[k][p-1][i]],
                min(
                dp[k][p-1][nxt[k][p-1][nxt[k][p-1][nxt[k][p-1][i]]]]-sum[k][p-1][i]
                -sum[k][p-1][nxt[k][p-1][i]]-
                sum[k][p-1][nxt[k][p-1][nxt[k][p-1][i]]],

                dp[k][p-1][nxt[k][p-1][nxt[k][p-1][nxt[k][p-1][nxt[k][p-1][i]]]]]
                -sum[k][p-1][i]-sum[k][p-1][nxt[k][p-1][i]]-
                sum[k][p-1][nxt[k][p-1][nxt[k][p-1][i]]]-
                sum[k][p-1][nxt[k][p-1][nxt[k][p-1][nxt[k][p-1][i]]]]
                ))));
        }
    }
}

ll simulate(int x, int z){
    ll s = z;

    while(x != n){
        tie(x, s) = binlift(x, s);
        if(x == n) break;
        if(s >= S[x]) s+=S[x], x = W[x];
        else s+=P[x], x = L[x];
    }

    return s;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 8 ms 6996 KB Output is correct
4 Correct 176 ms 171196 KB Output is correct
5 Correct 10 ms 7100 KB Output is correct
6 Correct 173 ms 171208 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3668 KB Output is correct
2 Correct 1370 ms 1366440 KB Output is correct
3 Correct 1417 ms 1366388 KB Output is correct
4 Correct 1420 ms 1367956 KB Output is correct
5 Correct 1463 ms 1367924 KB Output is correct
6 Correct 1654 ms 1366476 KB Output is correct
7 Correct 1666 ms 1364580 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3668 KB Output is correct
2 Correct 301 ms 171236 KB Output is correct
3 Correct 326 ms 171176 KB Output is correct
4 Correct 300 ms 171136 KB Output is correct
5 Correct 289 ms 171228 KB Output is correct
6 Correct 403 ms 171220 KB Output is correct
7 Correct 470 ms 171228 KB Output is correct
8 Correct 325 ms 171332 KB Output is correct
9 Correct 272 ms 171208 KB Output is correct
10 Correct 304 ms 171232 KB Output is correct
11 Correct 388 ms 171336 KB Output is correct
12 Correct 903 ms 171228 KB Output is correct
13 Correct 728 ms 171152 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3668 KB Output is correct
2 Correct 301 ms 171236 KB Output is correct
3 Correct 326 ms 171176 KB Output is correct
4 Correct 300 ms 171136 KB Output is correct
5 Correct 289 ms 171228 KB Output is correct
6 Correct 403 ms 171220 KB Output is correct
7 Correct 470 ms 171228 KB Output is correct
8 Correct 325 ms 171332 KB Output is correct
9 Correct 272 ms 171208 KB Output is correct
10 Correct 304 ms 171232 KB Output is correct
11 Correct 388 ms 171336 KB Output is correct
12 Correct 903 ms 171228 KB Output is correct
13 Correct 728 ms 171152 KB Output is correct
14 Correct 5 ms 3668 KB Output is correct
15 Correct 277 ms 171212 KB Output is correct
16 Correct 297 ms 171192 KB Output is correct
17 Correct 278 ms 171212 KB Output is correct
18 Correct 317 ms 171336 KB Output is correct
19 Correct 378 ms 171260 KB Output is correct
20 Correct 351 ms 171140 KB Output is correct
21 Correct 358 ms 171328 KB Output is correct
22 Correct 332 ms 171208 KB Output is correct
23 Correct 426 ms 171228 KB Output is correct
24 Correct 638 ms 171328 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3668 KB Output is correct
2 Correct 301 ms 171236 KB Output is correct
3 Correct 326 ms 171176 KB Output is correct
4 Correct 300 ms 171136 KB Output is correct
5 Correct 289 ms 171228 KB Output is correct
6 Correct 403 ms 171220 KB Output is correct
7 Correct 470 ms 171228 KB Output is correct
8 Correct 325 ms 171332 KB Output is correct
9 Correct 272 ms 171208 KB Output is correct
10 Correct 304 ms 171232 KB Output is correct
11 Correct 388 ms 171336 KB Output is correct
12 Correct 903 ms 171228 KB Output is correct
13 Correct 728 ms 171152 KB Output is correct
14 Correct 5 ms 3668 KB Output is correct
15 Correct 277 ms 171212 KB Output is correct
16 Correct 297 ms 171192 KB Output is correct
17 Correct 278 ms 171212 KB Output is correct
18 Correct 317 ms 171336 KB Output is correct
19 Correct 378 ms 171260 KB Output is correct
20 Correct 351 ms 171140 KB Output is correct
21 Correct 358 ms 171328 KB Output is correct
22 Correct 332 ms 171208 KB Output is correct
23 Correct 426 ms 171228 KB Output is correct
24 Correct 638 ms 171328 KB Output is correct
25 Correct 168 ms 170440 KB Output is correct
26 Correct 295 ms 171108 KB Output is correct
27 Correct 260 ms 171204 KB Output is correct
28 Correct 264 ms 171156 KB Output is correct
29 Correct 360 ms 171316 KB Output is correct
30 Correct 546 ms 171212 KB Output is correct
31 Correct 690 ms 171220 KB Output is correct
32 Correct 753 ms 171224 KB Output is correct
33 Correct 1810 ms 171152 KB Output is correct
34 Correct 3460 ms 171212 KB Output is correct
35 Correct 1174 ms 171160 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3668 KB Output is correct
2 Correct 1370 ms 1366440 KB Output is correct
3 Correct 1417 ms 1366388 KB Output is correct
4 Correct 1420 ms 1367956 KB Output is correct
5 Correct 1463 ms 1367924 KB Output is correct
6 Correct 1654 ms 1366476 KB Output is correct
7 Correct 1666 ms 1364580 KB Output is correct
8 Correct 4 ms 3668 KB Output is correct
9 Correct 301 ms 171236 KB Output is correct
10 Correct 326 ms 171176 KB Output is correct
11 Correct 300 ms 171136 KB Output is correct
12 Correct 289 ms 171228 KB Output is correct
13 Correct 403 ms 171220 KB Output is correct
14 Correct 470 ms 171228 KB Output is correct
15 Correct 325 ms 171332 KB Output is correct
16 Correct 272 ms 171208 KB Output is correct
17 Correct 304 ms 171232 KB Output is correct
18 Correct 388 ms 171336 KB Output is correct
19 Correct 903 ms 171228 KB Output is correct
20 Correct 728 ms 171152 KB Output is correct
21 Correct 5 ms 3668 KB Output is correct
22 Correct 277 ms 171212 KB Output is correct
23 Correct 297 ms 171192 KB Output is correct
24 Correct 278 ms 171212 KB Output is correct
25 Correct 317 ms 171336 KB Output is correct
26 Correct 378 ms 171260 KB Output is correct
27 Correct 351 ms 171140 KB Output is correct
28 Correct 358 ms 171328 KB Output is correct
29 Correct 332 ms 171208 KB Output is correct
30 Correct 426 ms 171228 KB Output is correct
31 Correct 638 ms 171328 KB Output is correct
32 Correct 168 ms 170440 KB Output is correct
33 Correct 295 ms 171108 KB Output is correct
34 Correct 260 ms 171204 KB Output is correct
35 Correct 264 ms 171156 KB Output is correct
36 Correct 360 ms 171316 KB Output is correct
37 Correct 546 ms 171212 KB Output is correct
38 Correct 690 ms 171220 KB Output is correct
39 Correct 753 ms 171224 KB Output is correct
40 Correct 1810 ms 171152 KB Output is correct
41 Correct 3460 ms 171212 KB Output is correct
42 Correct 1174 ms 171160 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 5 ms 3668 KB Output is correct
45 Correct 2078 ms 1371100 KB Output is correct
46 Correct 1502 ms 1366512 KB Output is correct
47 Correct 1578 ms 1367024 KB Output is correct
48 Correct 1540 ms 1369056 KB Output is correct
49 Correct 2019 ms 1371116 KB Output is correct
50 Correct 1481 ms 1368664 KB Output is correct
51 Correct 1501 ms 1369104 KB Output is correct
52 Correct 1571 ms 1366808 KB Output is correct
53 Correct 3089 ms 1367520 KB Output is correct
54 Correct 3431 ms 1368804 KB Output is correct
55 Correct 5221 ms 1367656 KB Output is correct
56 Correct 3605 ms 1368432 KB Output is correct
57 Correct 3771 ms 1368436 KB Output is correct
58 Correct 4358 ms 1368528 KB Output is correct
59 Correct 4654 ms 1368568 KB Output is correct
60 Correct 4241 ms 1367792 KB Output is correct
61 Correct 3714 ms 1367788 KB Output is correct