oj.uz

Submission #442526

# Submission time Handle Problem Language Result Execution time Memory
442526 2021-07-08T05:58:04 Z JovanB Dungeons Game (IOI21_dungeons) C++17
100 / 100
 6142 ms 1711568 KB 
#include "dungeons.h"
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int MAXN = 400000;
const int LOG2 = 23;
const int LOG8 = 8;

const ll INF = 1000000000000000000LL;

ll dp[LOG8+1][MAXN+5][LOG2+1];
ll dod[LOG8+1][MAXN+5][LOG2+1];
int gde[LOG8+1][MAXN+5][LOG2+1];

int s[MAXN+5];
int pl[MAXN+5];
int win[MAXN+5];
int lose[MAXN+5];
int step8[MAXN+5];

int N;

void init(int n, std::vector<int> S, std::vector<int> P, std::vector<int> W, std::vector<int> L){
    N = n;
    for(int i=0; i<n; i++){
        s[i] = S[i];
        pl[i] = P[i];
        win[i] = W[i];
        lose[i] = L[i];
    }
    s[n] = 0;
    pl[n] = 0;
    win[n] = n;
    lose[n] = n;
    step8[0] = 1;
    for(int i=1; i<=LOG8; i++) step8[i] = 8*step8[i-1];
    for(int k=0; k<=LOG8; k++){
        for(int i=0; i<=n; i++){
            if(step8[k] >= s[i]){
                dp[k][i][0] = INF;
                dod[k][i][0] = s[i];
                gde[k][i][0] = win[i];
            }
            else{
                dp[k][i][0] = s[i] - 1;
                dod[k][i][0] = pl[i];
                gde[k][i][0] = lose[i];
            }
        }
        for(int j=1; j<=LOG2; j++){
            for(int i=0; i<=n; i++){
                int h = gde[k][i][j-1];
                ll mndp = dp[k][i][j-1];
                ll udod = dod[k][i][j-1];
                for(int times=1; times<2; times++){
                    mndp = min(mndp, dp[k][h][j-1] - udod);
                    udod += dod[k][h][j-1];
                    h = gde[k][h][j-1];
                }
                gde[k][i][j] = h;
                dod[k][i][j] = udod;
                dp[k][i][j] = max(mndp, -5LL);
            }
        }
    }
	return;
}

ll simuliraj(int x, ll z){
    if(x == N) return z;
    int k = 0;
    for(int j=0; j<=LOG8; j++){
        if(step8[j] <= z) k = j;
    }
    if(k == LOG8) return z + dod[k][x][20];
    for(int j=LOG2; j>=0; j--){
        if(dp[k][x][j] >= z){
            z += dod[k][x][j];
            x = gde[k][x][j];
        }
    }
    if(x == N) return z;
    if(z >= s[x]) return simuliraj(win[x], z + s[x]);
    return simuliraj(lose[x], z + pl[x]);
}

long long simulate(int x, int z) {
    return simuliraj(x, z);
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 460 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 8 ms 9036 KB Output is correct
4 Correct 440 ms 214204 KB Output is correct
5 Correct 9 ms 9036 KB Output is correct
6 Correct 501 ms 214184 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4812 KB Output is correct
2 Correct 4635 ms 1710680 KB Output is correct
3 Correct 4349 ms 1711532 KB Output is correct
4 Correct 4069 ms 1711472 KB Output is correct
5 Correct 3723 ms 1711528 KB Output is correct
6 Correct 4766 ms 1711568 KB Output is correct
7 Correct 4596 ms 1711520 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4812 KB Output is correct
2 Correct 612 ms 215108 KB Output is correct
3 Correct 506 ms 215044 KB Output is correct
4 Correct 525 ms 214996 KB Output is correct
5 Correct 546 ms 215036 KB Output is correct
6 Correct 595 ms 214980 KB Output is correct
7 Correct 558 ms 214928 KB Output is correct
8 Correct 512 ms 215032 KB Output is correct
9 Correct 446 ms 214908 KB Output is correct
10 Correct 529 ms 214944 KB Output is correct
11 Correct 687 ms 215132 KB Output is correct
12 Correct 927 ms 214968 KB Output is correct
13 Correct 601 ms 215000 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4812 KB Output is correct
2 Correct 612 ms 215108 KB Output is correct
3 Correct 506 ms 215044 KB Output is correct
4 Correct 525 ms 214996 KB Output is correct
5 Correct 546 ms 215036 KB Output is correct
6 Correct 595 ms 214980 KB Output is correct
7 Correct 558 ms 214928 KB Output is correct
8 Correct 512 ms 215032 KB Output is correct
9 Correct 446 ms 214908 KB Output is correct
10 Correct 529 ms 214944 KB Output is correct
11 Correct 687 ms 215132 KB Output is correct
12 Correct 927 ms 214968 KB Output is correct
13 Correct 601 ms 215000 KB Output is correct
14 Correct 4 ms 4812 KB Output is correct
15 Correct 536 ms 214960 KB Output is correct
16 Correct 519 ms 215072 KB Output is correct
17 Correct 507 ms 214920 KB Output is correct
18 Correct 511 ms 215000 KB Output is correct
19 Correct 586 ms 215096 KB Output is correct
20 Correct 566 ms 215000 KB Output is correct
21 Correct 573 ms 215096 KB Output is correct
22 Correct 575 ms 215128 KB Output is correct
23 Correct 563 ms 215020 KB Output is correct
24 Correct 882 ms 214980 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4812 KB Output is correct
2 Correct 612 ms 215108 KB Output is correct
3 Correct 506 ms 215044 KB Output is correct
4 Correct 525 ms 214996 KB Output is correct
5 Correct 546 ms 215036 KB Output is correct
6 Correct 595 ms 214980 KB Output is correct
7 Correct 558 ms 214928 KB Output is correct
8 Correct 512 ms 215032 KB Output is correct
9 Correct 446 ms 214908 KB Output is correct
10 Correct 529 ms 214944 KB Output is correct
11 Correct 687 ms 215132 KB Output is correct
12 Correct 927 ms 214968 KB Output is correct
13 Correct 601 ms 215000 KB Output is correct
14 Correct 4 ms 4812 KB Output is correct
15 Correct 536 ms 214960 KB Output is correct
16 Correct 519 ms 215072 KB Output is correct
17 Correct 507 ms 214920 KB Output is correct
18 Correct 511 ms 215000 KB Output is correct
19 Correct 586 ms 215096 KB Output is correct
20 Correct 566 ms 215000 KB Output is correct
21 Correct 573 ms 215096 KB Output is correct
22 Correct 575 ms 215128 KB Output is correct
23 Correct 563 ms 215020 KB Output is correct
24 Correct 882 ms 214980 KB Output is correct
25 Correct 518 ms 214180 KB Output is correct
26 Correct 603 ms 215492 KB Output is correct
27 Correct 505 ms 214980 KB Output is correct
28 Correct 461 ms 214984 KB Output is correct
29 Correct 640 ms 214972 KB Output is correct
30 Correct 591 ms 215004 KB Output is correct
31 Correct 711 ms 215080 KB Output is correct
32 Correct 871 ms 215024 KB Output is correct
33 Correct 959 ms 215040 KB Output is correct
34 Correct 1560 ms 214880 KB Output is correct
35 Correct 784 ms 215020 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4812 KB Output is correct
2 Correct 4635 ms 1710680 KB Output is correct
3 Correct 4349 ms 1711532 KB Output is correct
4 Correct 4069 ms 1711472 KB Output is correct
5 Correct 3723 ms 1711528 KB Output is correct
6 Correct 4766 ms 1711568 KB Output is correct
7 Correct 4596 ms 1711520 KB Output is correct
8 Correct 5 ms 4812 KB Output is correct
9 Correct 612 ms 215108 KB Output is correct
10 Correct 506 ms 215044 KB Output is correct
11 Correct 525 ms 214996 KB Output is correct
12 Correct 546 ms 215036 KB Output is correct
13 Correct 595 ms 214980 KB Output is correct
14 Correct 558 ms 214928 KB Output is correct
15 Correct 512 ms 215032 KB Output is correct
16 Correct 446 ms 214908 KB Output is correct
17 Correct 529 ms 214944 KB Output is correct
18 Correct 687 ms 215132 KB Output is correct
19 Correct 927 ms 214968 KB Output is correct
20 Correct 601 ms 215000 KB Output is correct
21 Correct 4 ms 4812 KB Output is correct
22 Correct 536 ms 214960 KB Output is correct
23 Correct 519 ms 215072 KB Output is correct
24 Correct 507 ms 214920 KB Output is correct
25 Correct 511 ms 215000 KB Output is correct
26 Correct 586 ms 215096 KB Output is correct
27 Correct 566 ms 215000 KB Output is correct
28 Correct 573 ms 215096 KB Output is correct
29 Correct 575 ms 215128 KB Output is correct
30 Correct 563 ms 215020 KB Output is correct
31 Correct 882 ms 214980 KB Output is correct
32 Correct 518 ms 214180 KB Output is correct
33 Correct 603 ms 215492 KB Output is correct
34 Correct 505 ms 214980 KB Output is correct
35 Correct 461 ms 214984 KB Output is correct
36 Correct 640 ms 214972 KB Output is correct
37 Correct 591 ms 215004 KB Output is correct
38 Correct 711 ms 215080 KB Output is correct
39 Correct 871 ms 215024 KB Output is correct
40 Correct 959 ms 215040 KB Output is correct
41 Correct 1560 ms 214880 KB Output is correct
42 Correct 784 ms 215020 KB Output is correct
43 Correct 6 ms 460 KB Output is correct
44 Correct 5 ms 4812 KB Output is correct
45 Correct 4982 ms 1710584 KB Output is correct
46 Correct 4111 ms 1710620 KB Output is correct
47 Correct 4228 ms 1710840 KB Output is correct
48 Correct 3737 ms 1710696 KB Output is correct
49 Correct 5153 ms 1710620 KB Output is correct
50 Correct 4344 ms 1710620 KB Output is correct
51 Correct 3649 ms 1710668 KB Output is correct
52 Correct 4073 ms 1710620 KB Output is correct
53 Correct 5911 ms 1710660 KB Output is correct
54 Correct 4807 ms 1710604 KB Output is correct
55 Correct 5336 ms 1710624 KB Output is correct
56 Correct 5308 ms 1710692 KB Output is correct
57 Correct 5864 ms 1710648 KB Output is correct
58 Correct 5506 ms 1711052 KB Output is correct
59 Correct 5660 ms 1711016 KB Output is correct
60 Correct 6142 ms 1711012 KB Output is correct
61 Correct 5550 ms 1711004 KB Output is correct