oj.uz

Submission #800467

# Submission time Handle Problem Language Result Execution time Memory
800467 2023-08-01T15:13:15 Z MohamedAliSaidane Dungeons Game (IOI21_dungeons) C++17
100 / 100
 4032 ms 1186504 KB 
#include <bits/stdc++.h>
//#include "dungeons.h"
using namespace std;

typedef vector<int> vi;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;

#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(),(x).end()

const int nax = 4e5 + 5;
const ll INF = 1e7;
const int LG = 24;
const int LG2 = 6;
const int b = 26;
int n;
vi S, P, W, L;

int sp[nax][LG2][LG];
ll mini[nax][LG2][LG];
ll ps[nax][LG2][LG];
ll POW[LG2];
int cor[(int)(INF + 1)];
void init(int N, vi s, vi p, vi w, vi l)
{
    n = N, S = s, P = p, W= w, L = l;
    S.pb(0);
    W.pb(n);
    POW[0] = 1ll;
    for(int i =1; i < LG2; i++)
        POW[i] = (POW[i - 1] * 1ll * b);
    for(int i = 1; i < b; i++)
        cor[i] = 0;
    for(int j = b; j <= INF; j++)
        cor[j] = cor[j/b] + 1;
    for(int i = 0; i <= n; i++)
    {
        for(int l = 0; l < LG2; l++)
        {
            if(S[i] <= POW[l])
            {
                sp[i][l][0] = W[i];
                mini[i][l][0] = INF * 1ll * INF;
                ps[i][l][0] = S[i];
            }
            else
            {
                sp[i][l][0] = L[i];
                mini[i][l][0] = S[i];
                ps[i][l][0] = P[i];
            }
        }
    }
    for(int j = 1; j < LG; j++)
    {
        for(int i = 0; i <= n; i++)
        {
            for(int l = 0; l < LG2; l++)
            {
                sp[i][l][j] = sp[sp[i][l][j - 1]][l][j - 1];
                mini[i][l][j] = min(mini[i][l][j - 1], mini[sp[i][l][j - 1]][l][j - 1] - ps[i][l][j -  1]);
                ps[i][l][j] = ps[i][l][j - 1] + ps[sp[i][l][j - 1]][l][j - 1];
            }
        }
    }
}
pair<int,ll> check(int i, ll z)
{
    ll delta = 0ll;
    int l = (z >= INF)? LG2 - 1: cor[z];
    //cout << '\t' <<  i << ' ' << z << ' ' << l << '\n';
    for(int j = LG - 1; j >= 0; j--)
    {
        bool cond = (mini[i][l][j] - delta <= z) || (sp[i][l][j] == n);
        if(!(cond))
        {
            delta += ps[i][l][j];
            i = sp[i][l][j];
        }
    }
    if(z + delta < mini[i][l][0])
    {
        delta += ps[i][l][0];
        i = sp[i][l][0];
    }
    return {i, delta};
}
ll simulate(int x, int Z)
{
    ll z = Z;
    while(x != n)
    {
       // cout << x << ' ' << z << '\n';
        pair<int,ll> u = check(x, z);
        x = u.ff;
        z += u.ss;
        z += S[x];
        x = W[x];
    }
    return z;
}
/*
int32_t main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    /*
    int n, q;
    cin >> n >> q;
    vi s(n), p(n), w(n), l(n);
    for(int i = 0; i < n; i++)
        cin >> s[i];
    for(int i = 0; i < n; i++)
        cin >> p[i];
    for(int i =0 ;i < n; i++)
        cin >> w[i];
    for(int i = 0;i < n; i++)
        cin >> l[i];
    init(n, s, p, w, l);
    while(q--)
    {
        int x, z;
        cin >> x >> z;
        cout << simulate(x, z) << '\n';
    }


    init(3, {2, 6, 9}, {3, 1, 2}, {2, 2, 3}, {1, 0, 1});
    cout << simulate(0, 1) << '\n';
    cout << simulate(2, 3) << '\n';


}
*/

Compilation message

dungeons.cpp:112:5: warning: "/*" within comment [-Wcomment]
  112 |     /*
      |

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 39372 KB Output is correct
2 Correct 25 ms 39368 KB Output is correct
3 Correct 29 ms 45216 KB Output is correct
4 Correct 253 ms 182976 KB Output is correct
5 Correct 33 ms 45232 KB Output is correct
6 Correct 234 ms 182904 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 42300 KB Output is correct
2 Correct 2302 ms 1186376 KB Output is correct
3 Correct 2352 ms 1186376 KB Output is correct
4 Correct 2423 ms 1186440 KB Output is correct
5 Correct 1981 ms 1186372 KB Output is correct
6 Correct 2393 ms 1186368 KB Output is correct
7 Correct 2974 ms 1186372 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 42264 KB Output is correct
2 Correct 307 ms 183636 KB Output is correct
3 Correct 313 ms 183500 KB Output is correct
4 Correct 298 ms 183636 KB Output is correct
5 Correct 309 ms 183620 KB Output is correct
6 Correct 295 ms 183628 KB Output is correct
7 Correct 287 ms 183616 KB Output is correct
8 Correct 316 ms 183680 KB Output is correct
9 Correct 273 ms 183608 KB Output is correct
10 Correct 322 ms 183696 KB Output is correct
11 Correct 337 ms 183628 KB Output is correct
12 Correct 451 ms 183744 KB Output is correct
13 Correct 367 ms 183504 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 42264 KB Output is correct
2 Correct 307 ms 183636 KB Output is correct
3 Correct 313 ms 183500 KB Output is correct
4 Correct 298 ms 183636 KB Output is correct
5 Correct 309 ms 183620 KB Output is correct
6 Correct 295 ms 183628 KB Output is correct
7 Correct 287 ms 183616 KB Output is correct
8 Correct 316 ms 183680 KB Output is correct
9 Correct 273 ms 183608 KB Output is correct
10 Correct 322 ms 183696 KB Output is correct
11 Correct 337 ms 183628 KB Output is correct
12 Correct 451 ms 183744 KB Output is correct
13 Correct 367 ms 183504 KB Output is correct
14 Correct 27 ms 42276 KB Output is correct
15 Correct 275 ms 183536 KB Output is correct
16 Correct 300 ms 183612 KB Output is correct
17 Correct 298 ms 183484 KB Output is correct
18 Correct 306 ms 183520 KB Output is correct
19 Correct 300 ms 183724 KB Output is correct
20 Correct 356 ms 183624 KB Output is correct
21 Correct 348 ms 183640 KB Output is correct
22 Correct 364 ms 183564 KB Output is correct
23 Correct 370 ms 183616 KB Output is correct
24 Correct 509 ms 183560 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 42264 KB Output is correct
2 Correct 307 ms 183636 KB Output is correct
3 Correct 313 ms 183500 KB Output is correct
4 Correct 298 ms 183636 KB Output is correct
5 Correct 309 ms 183620 KB Output is correct
6 Correct 295 ms 183628 KB Output is correct
7 Correct 287 ms 183616 KB Output is correct
8 Correct 316 ms 183680 KB Output is correct
9 Correct 273 ms 183608 KB Output is correct
10 Correct 322 ms 183696 KB Output is correct
11 Correct 337 ms 183628 KB Output is correct
12 Correct 451 ms 183744 KB Output is correct
13 Correct 367 ms 183504 KB Output is correct
14 Correct 27 ms 42276 KB Output is correct
15 Correct 275 ms 183536 KB Output is correct
16 Correct 300 ms 183612 KB Output is correct
17 Correct 298 ms 183484 KB Output is correct
18 Correct 306 ms 183520 KB Output is correct
19 Correct 300 ms 183724 KB Output is correct
20 Correct 356 ms 183624 KB Output is correct
21 Correct 348 ms 183640 KB Output is correct
22 Correct 364 ms 183564 KB Output is correct
23 Correct 370 ms 183616 KB Output is correct
24 Correct 509 ms 183560 KB Output is correct
25 Correct 246 ms 182852 KB Output is correct
26 Correct 300 ms 183556 KB Output is correct
27 Correct 302 ms 183580 KB Output is correct
28 Correct 288 ms 183520 KB Output is correct
29 Correct 303 ms 183636 KB Output is correct
30 Correct 387 ms 183636 KB Output is correct
31 Correct 414 ms 183628 KB Output is correct
32 Correct 469 ms 183552 KB Output is correct
33 Correct 633 ms 183580 KB Output is correct
34 Correct 975 ms 183576 KB Output is correct
35 Correct 450 ms 183520 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 42300 KB Output is correct
2 Correct 2302 ms 1186376 KB Output is correct
3 Correct 2352 ms 1186376 KB Output is correct
4 Correct 2423 ms 1186440 KB Output is correct
5 Correct 1981 ms 1186372 KB Output is correct
6 Correct 2393 ms 1186368 KB Output is correct
7 Correct 2974 ms 1186372 KB Output is correct
8 Correct 27 ms 42264 KB Output is correct
9 Correct 307 ms 183636 KB Output is correct
10 Correct 313 ms 183500 KB Output is correct
11 Correct 298 ms 183636 KB Output is correct
12 Correct 309 ms 183620 KB Output is correct
13 Correct 295 ms 183628 KB Output is correct
14 Correct 287 ms 183616 KB Output is correct
15 Correct 316 ms 183680 KB Output is correct
16 Correct 273 ms 183608 KB Output is correct
17 Correct 322 ms 183696 KB Output is correct
18 Correct 337 ms 183628 KB Output is correct
19 Correct 451 ms 183744 KB Output is correct
20 Correct 367 ms 183504 KB Output is correct
21 Correct 27 ms 42276 KB Output is correct
22 Correct 275 ms 183536 KB Output is correct
23 Correct 300 ms 183612 KB Output is correct
24 Correct 298 ms 183484 KB Output is correct
25 Correct 306 ms 183520 KB Output is correct
26 Correct 300 ms 183724 KB Output is correct
27 Correct 356 ms 183624 KB Output is correct
28 Correct 348 ms 183640 KB Output is correct
29 Correct 364 ms 183564 KB Output is correct
30 Correct 370 ms 183616 KB Output is correct
31 Correct 509 ms 183560 KB Output is correct
32 Correct 246 ms 182852 KB Output is correct
33 Correct 300 ms 183556 KB Output is correct
34 Correct 302 ms 183580 KB Output is correct
35 Correct 288 ms 183520 KB Output is correct
36 Correct 303 ms 183636 KB Output is correct
37 Correct 387 ms 183636 KB Output is correct
38 Correct 414 ms 183628 KB Output is correct
39 Correct 469 ms 183552 KB Output is correct
40 Correct 633 ms 183580 KB Output is correct
41 Correct 975 ms 183576 KB Output is correct
42 Correct 450 ms 183520 KB Output is correct
43 Correct 23 ms 39436 KB Output is correct
44 Correct 26 ms 42292 KB Output is correct
45 Correct 2422 ms 1186368 KB Output is correct
46 Correct 2230 ms 1186376 KB Output is correct
47 Correct 2293 ms 1186300 KB Output is correct
48 Correct 2173 ms 1186376 KB Output is correct
49 Correct 2447 ms 1186308 KB Output is correct
50 Correct 2704 ms 1186368 KB Output is correct
51 Correct 1986 ms 1186244 KB Output is correct
52 Correct 2337 ms 1186244 KB Output is correct
53 Correct 3995 ms 1186248 KB Output is correct
54 Correct 3048 ms 1186436 KB Output is correct
55 Correct 3556 ms 1186488 KB Output is correct
56 Correct 3596 ms 1186404 KB Output is correct
57 Correct 3759 ms 1186504 KB Output is correct
58 Correct 3806 ms 1186496 KB Output is correct
59 Correct 3860 ms 1186452 KB Output is correct
60 Correct 4032 ms 1186452 KB Output is correct
61 Correct 3284 ms 1186312 KB Output is correct