oj.uz

Submission #720951

# Submission time Handle Problem Language Result Execution time Memory
720951 2023-04-09T21:21:50 Z urosk Dungeons Game (IOI21_dungeons) C++17
100 / 100
 3581 ms 1740932 KB 
#include "dungeons.h"
#include <bits/stdc++.h>
#define here cerr<<"===========================================\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#define ll long long
#define llinf 1000000000000000000LL
#define pb push_back
#define ceri(a,l,r) {cerr<<#a<<": ";for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}

using namespace std;
#define maxn 400005
#define lg 25
#define lg2 9
#define B 8
ll n;
int a[maxn],b[maxn],w[maxn],l[maxn];
ll bs[lg2];
int st[lg2][lg][maxn];
ll sum[lg2][lg][maxn];
ll mx[lg2][lg][maxn];
void init(int N, vector<int> s, vector<int> p, vector<int> W, vector<int> L) {
    bs[0] = 1;
    for(int i = 1;i<lg2;i++) bs[i] = bs[i-1]*B;
    n = N;
    for(int i = 1;i<=n;i++) a[i] = s[i-1],b[i] = p[i-1],w[i] = W[i-1]+1,l[i] = L[i-1]+1;
    for(int j = 0;j<lg2;j++){
        for(int i = 1;i<=n;i++){
            st[j][0][i] = -1;
            if(bs[j]>a[i]){
                if(w[i]!=n+1){
                    st[j][0][i] = w[i];
                    sum[j][0][i] = a[i];
                    mx[j][0][i] = llinf;
                }
            }else{
                if(l[i]!=n+1){
                    st[j][0][i] = l[i];
                    sum[j][0][i] = b[i];
                    mx[j][0][i] = a[i];
                }
            }
        }
    }
    for(int j = 0;j<lg2;j++){
        for(int k = 1;k<lg;k++){
            for(int i = 1;i<=n;i++){
                if(st[j][k-1][i]==-1||st[j][k-1][st[j][k-1][i]]==-1){
                    st[j][k][i] = -1;
                    continue;
                }
                st[j][k][i] = st[j][k-1][st[j][k-1][i]];
                sum[j][k][i] = sum[j][k-1][i] + sum[j][k-1][st[j][k-1][i]];
                mx[j][k][i] = min(mx[j][k-1][i],mx[j][k-1][st[j][k-1][i]]-sum[j][k-1][i]);
            }
        }
    }
    return;
}

long long simulate(int x, int Z) {
    ll z = Z;
    x++;
    int j = 0;
    while(x!=n+1){
        while(j+1<lg2&&bs[j+1]<=z) j++;
        for(int k = lg-1;k>=0;k--){
            if(st[j][k][x]==-1) continue;
            if(z>=mx[j][k][x]) continue;
            z+=sum[j][k][x];
            x = st[j][k][x];
        }
        if(z>=a[x]){
            z+=a[x];
            x = w[x];
        }else{
            z+=b[x];
            x = l[x];
        }
    }
    return z;
}
/**
3 2
2 6 9
3 1 2
2 2 3
1 0 1
0 1
2 3

3 2
9 9 9
3 1 2
2 2 3
1 0 1
0 1
2 3
**/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3924 KB Output is correct
2 Correct 2 ms 4052 KB Output is correct
3 Correct 4 ms 7508 KB Output is correct
4 Correct 105 ms 163656 KB Output is correct
5 Correct 6 ms 10324 KB Output is correct
6 Correct 108 ms 163840 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9424 KB Output is correct
2 Correct 1034 ms 1731252 KB Output is correct
3 Correct 1006 ms 1735572 KB Output is correct
4 Correct 986 ms 1689852 KB Output is correct
5 Correct 1056 ms 1530608 KB Output is correct
6 Correct 1175 ms 1731360 KB Output is correct
7 Correct 1131 ms 1735432 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9300 KB Output is correct
2 Correct 227 ms 212684 KB Output is correct
3 Correct 207 ms 219852 KB Output is correct
4 Correct 134 ms 164152 KB Output is correct
5 Correct 129 ms 168692 KB Output is correct
6 Correct 296 ms 214072 KB Output is correct
7 Correct 242 ms 213804 KB Output is correct
8 Correct 171 ms 172108 KB Output is correct
9 Correct 119 ms 101272 KB Output is correct
10 Correct 152 ms 163776 KB Output is correct
11 Correct 162 ms 159596 KB Output is correct
12 Correct 300 ms 217172 KB Output is correct
13 Correct 204 ms 209992 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9300 KB Output is correct
2 Correct 227 ms 212684 KB Output is correct
3 Correct 207 ms 219852 KB Output is correct
4 Correct 134 ms 164152 KB Output is correct
5 Correct 129 ms 168692 KB Output is correct
6 Correct 296 ms 214072 KB Output is correct
7 Correct 242 ms 213804 KB Output is correct
8 Correct 171 ms 172108 KB Output is correct
9 Correct 119 ms 101272 KB Output is correct
10 Correct 152 ms 163776 KB Output is correct
11 Correct 162 ms 159596 KB Output is correct
12 Correct 300 ms 217172 KB Output is correct
13 Correct 204 ms 209992 KB Output is correct
14 Correct 5 ms 9300 KB Output is correct
15 Correct 174 ms 214076 KB Output is correct
16 Correct 232 ms 214276 KB Output is correct
17 Correct 151 ms 211740 KB Output is correct
18 Correct 164 ms 220916 KB Output is correct
19 Correct 253 ms 213924 KB Output is correct
20 Correct 208 ms 212228 KB Output is correct
21 Correct 216 ms 221004 KB Output is correct
22 Correct 160 ms 146516 KB Output is correct
23 Correct 202 ms 204284 KB Output is correct
24 Correct 327 ms 204348 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9300 KB Output is correct
2 Correct 227 ms 212684 KB Output is correct
3 Correct 207 ms 219852 KB Output is correct
4 Correct 134 ms 164152 KB Output is correct
5 Correct 129 ms 168692 KB Output is correct
6 Correct 296 ms 214072 KB Output is correct
7 Correct 242 ms 213804 KB Output is correct
8 Correct 171 ms 172108 KB Output is correct
9 Correct 119 ms 101272 KB Output is correct
10 Correct 152 ms 163776 KB Output is correct
11 Correct 162 ms 159596 KB Output is correct
12 Correct 300 ms 217172 KB Output is correct
13 Correct 204 ms 209992 KB Output is correct
14 Correct 5 ms 9300 KB Output is correct
15 Correct 174 ms 214076 KB Output is correct
16 Correct 232 ms 214276 KB Output is correct
17 Correct 151 ms 211740 KB Output is correct
18 Correct 164 ms 220916 KB Output is correct
19 Correct 253 ms 213924 KB Output is correct
20 Correct 208 ms 212228 KB Output is correct
21 Correct 216 ms 221004 KB Output is correct
22 Correct 160 ms 146516 KB Output is correct
23 Correct 202 ms 204284 KB Output is correct
24 Correct 327 ms 204348 KB Output is correct
25 Correct 130 ms 213180 KB Output is correct
26 Correct 217 ms 214440 KB Output is correct
27 Correct 174 ms 206292 KB Output is correct
28 Correct 189 ms 213812 KB Output is correct
29 Correct 239 ms 214172 KB Output is correct
30 Correct 261 ms 221740 KB Output is correct
31 Correct 237 ms 221436 KB Output is correct
32 Correct 361 ms 204192 KB Output is correct
33 Correct 913 ms 217536 KB Output is correct
34 Correct 1362 ms 217824 KB Output is correct
35 Correct 776 ms 209840 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9424 KB Output is correct
2 Correct 1034 ms 1731252 KB Output is correct
3 Correct 1006 ms 1735572 KB Output is correct
4 Correct 986 ms 1689852 KB Output is correct
5 Correct 1056 ms 1530608 KB Output is correct
6 Correct 1175 ms 1731360 KB Output is correct
7 Correct 1131 ms 1735432 KB Output is correct
8 Correct 5 ms 9300 KB Output is correct
9 Correct 227 ms 212684 KB Output is correct
10 Correct 207 ms 219852 KB Output is correct
11 Correct 134 ms 164152 KB Output is correct
12 Correct 129 ms 168692 KB Output is correct
13 Correct 296 ms 214072 KB Output is correct
14 Correct 242 ms 213804 KB Output is correct
15 Correct 171 ms 172108 KB Output is correct
16 Correct 119 ms 101272 KB Output is correct
17 Correct 152 ms 163776 KB Output is correct
18 Correct 162 ms 159596 KB Output is correct
19 Correct 300 ms 217172 KB Output is correct
20 Correct 204 ms 209992 KB Output is correct
21 Correct 5 ms 9300 KB Output is correct
22 Correct 174 ms 214076 KB Output is correct
23 Correct 232 ms 214276 KB Output is correct
24 Correct 151 ms 211740 KB Output is correct
25 Correct 164 ms 220916 KB Output is correct
26 Correct 253 ms 213924 KB Output is correct
27 Correct 208 ms 212228 KB Output is correct
28 Correct 216 ms 221004 KB Output is correct
29 Correct 160 ms 146516 KB Output is correct
30 Correct 202 ms 204284 KB Output is correct
31 Correct 327 ms 204348 KB Output is correct
32 Correct 130 ms 213180 KB Output is correct
33 Correct 217 ms 214440 KB Output is correct
34 Correct 174 ms 206292 KB Output is correct
35 Correct 189 ms 213812 KB Output is correct
36 Correct 239 ms 214172 KB Output is correct
37 Correct 261 ms 221740 KB Output is correct
38 Correct 237 ms 221436 KB Output is correct
39 Correct 361 ms 204192 KB Output is correct
40 Correct 913 ms 217536 KB Output is correct
41 Correct 1362 ms 217824 KB Output is correct
42 Correct 776 ms 209840 KB Output is correct
43 Correct 2 ms 2772 KB Output is correct
44 Correct 6 ms 9284 KB Output is correct
45 Correct 1477 ms 1667496 KB Output is correct
46 Correct 1106 ms 1662896 KB Output is correct
47 Correct 1098 ms 1663332 KB Output is correct
48 Correct 1103 ms 1740932 KB Output is correct
49 Correct 1436 ms 1667508 KB Output is correct
50 Correct 1128 ms 1740656 KB Output is correct
51 Correct 1027 ms 1738708 KB Output is correct
52 Correct 1710 ms 1738744 KB Output is correct
53 Correct 2089 ms 1613768 KB Output is correct
54 Correct 2194 ms 1712568 KB Output is correct
55 Correct 2640 ms 1714396 KB Output is correct
56 Correct 2475 ms 1670692 KB Output is correct
57 Correct 3581 ms 1664824 KB Output is correct
58 Correct 2947 ms 1664760 KB Output is correct
59 Correct 2889 ms 1665028 KB Output is correct
60 Correct 2201 ms 1732332 KB Output is correct
61 Correct 2045 ms 1714344 KB Output is correct