oj.uz

Submission #856901

# Submission time Handle Problem Language Result Execution time Memory
856901 2023-10-04T19:36:29 Z andrei_boaca Dungeons Game (IOI21_dungeons) C++17
89 / 100
 7000 ms 1949332 KB 
#include "dungeons.h"
#include <vector>
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
typedef long long ll;
int s[400005],p[400005],w[400005],l[400005],cost[400005],to[25][400005];
ll n;
int dp[25][400005][12];
ll suma[25][400005][12];
int who[25][400005][12];
ll smax=0;
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];
        smax=max(smax,s[i]*1LL);
        p[i]=P[i];
        w[i]=W[i];
        l[i]=L[i];
    }
    w[n]=n;
    for(int k=0;k<25;k++)
    {
        for(int i=0;i<n;i++)
        {
            if(s[i]<(1<<k))
            {
                to[k][i]=w[i];
                cost[i]=s[i];
            }
            else
            {
                to[k][i]=l[i];
                cost[i]=p[i];
            }
            suma[k][i][0]=cost[i];
            who[k][i][0]=to[k][i];
        }
        cost[n]=0;
        to[k][n]=n;
        who[k][n][0]=n;
        suma[k][n][0]=0;
        for(int j=1;j<=11;j++)
        {
            for(int i=0;i<=n;i++)
            {
                ll sum=0;
                ll x=i;
                for(int c=1;c<=3;c++)
                {
                    sum+=suma[k][x][j-1];
                    x=who[k][x][j-1];
                }
                who[k][i][j]=x;
                suma[k][i][j]=sum;
            }
        }
        for(int i=0;i<n;i++)
        {
            if(s[i]>=(1<<k))
                dp[k][i][0]=0-s[i];
            else
                dp[k][i][0]=-1e9;
        }
        for(int j=1;j<=11;j++)
        {
            for(int i=0;i<=n;i++)
            {
                ll x=i;
                ll maxim=-1e9;
                ll sum=0;
                for(int c=1;c<=3;c++)
                {
                    ll val=-1e9;
                    if(dp[k][x][j-1]>-1e9)
                        val=min(0LL,dp[k][x][j-1]+sum);
                    maxim=max(maxim,val);
                    sum+=suma[k][x][j-1];
                    x=who[k][x][j-1];
                }
                dp[k][i][j]=maxim;
            }
        }
    }
}

long long simulate(int x, int z)
{
    ll rez=z;
    int cnt=0;
    while(x!=n)
    {
        cnt++;
        ll k=0;
        for(int i=0;i<25;i++)
            if((1<<i)<rez)
                k=i;
        if(k==24)
        {
            while(x!=n)
            {
                rez+=suma[k][x][11];
                x=who[k][x][11];
            }
            continue;
        }
        for(int i=11;i>=0;i--)
        {
            while(rez+dp[k][x][i]<0)
            {
                rez+=suma[k][x][i];
                x=who[k][x][i];
            }
        }
        rez+=s[x];
        //assert(x==n||s[x]>=(1<<k));
        x=w[x];
    }
    return rez;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 199260 KB Output is correct
2 Correct 18 ms 199260 KB Output is correct
3 Correct 27 ms 207700 KB Output is correct
4 Correct 240 ms 435136 KB Output is correct
5 Correct 26 ms 207700 KB Output is correct
6 Correct 240 ms 435168 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 203612 KB Output is correct
2 Correct 3593 ms 1939408 KB Output is correct
3 Correct 2760 ms 1939400 KB Output is correct
4 Correct 3085 ms 1942964 KB Output is correct
5 Correct 4411 ms 1945044 KB Output is correct
6 Correct 3144 ms 1944388 KB Output is correct
7 Correct 2559 ms 1940384 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 203612 KB Output is correct
2 Correct 291 ms 435936 KB Output is correct
3 Correct 252 ms 435992 KB Output is correct
4 Correct 227 ms 436904 KB Output is correct
5 Correct 228 ms 436820 KB Output is correct
6 Correct 283 ms 437044 KB Output is correct
7 Correct 292 ms 437208 KB Output is correct
8 Correct 242 ms 436736 KB Output is correct
9 Correct 253 ms 436932 KB Output is correct
10 Correct 242 ms 436564 KB Output is correct
11 Correct 349 ms 437076 KB Output is correct
12 Correct 557 ms 437260 KB Output is correct
13 Correct 470 ms 437332 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 203612 KB Output is correct
2 Correct 291 ms 435936 KB Output is correct
3 Correct 252 ms 435992 KB Output is correct
4 Correct 227 ms 436904 KB Output is correct
5 Correct 228 ms 436820 KB Output is correct
6 Correct 283 ms 437044 KB Output is correct
7 Correct 292 ms 437208 KB Output is correct
8 Correct 242 ms 436736 KB Output is correct
9 Correct 253 ms 436932 KB Output is correct
10 Correct 242 ms 436564 KB Output is correct
11 Correct 349 ms 437076 KB Output is correct
12 Correct 557 ms 437260 KB Output is correct
13 Correct 470 ms 437332 KB Output is correct
14 Correct 22 ms 203600 KB Output is correct
15 Correct 266 ms 437340 KB Output is correct
16 Correct 286 ms 437564 KB Output is correct
17 Correct 259 ms 436912 KB Output is correct
18 Correct 257 ms 437192 KB Output is correct
19 Correct 284 ms 437196 KB Output is correct
20 Correct 257 ms 437212 KB Output is correct
21 Correct 246 ms 436852 KB Output is correct
22 Correct 264 ms 436948 KB Output is correct
23 Correct 328 ms 437168 KB Output is correct
24 Correct 472 ms 437184 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 203612 KB Output is correct
2 Correct 291 ms 435936 KB Output is correct
3 Correct 252 ms 435992 KB Output is correct
4 Correct 227 ms 436904 KB Output is correct
5 Correct 228 ms 436820 KB Output is correct
6 Correct 283 ms 437044 KB Output is correct
7 Correct 292 ms 437208 KB Output is correct
8 Correct 242 ms 436736 KB Output is correct
9 Correct 253 ms 436932 KB Output is correct
10 Correct 242 ms 436564 KB Output is correct
11 Correct 349 ms 437076 KB Output is correct
12 Correct 557 ms 437260 KB Output is correct
13 Correct 470 ms 437332 KB Output is correct
14 Correct 22 ms 203600 KB Output is correct
15 Correct 266 ms 437340 KB Output is correct
16 Correct 286 ms 437564 KB Output is correct
17 Correct 259 ms 436912 KB Output is correct
18 Correct 257 ms 437192 KB Output is correct
19 Correct 284 ms 437196 KB Output is correct
20 Correct 257 ms 437212 KB Output is correct
21 Correct 246 ms 436852 KB Output is correct
22 Correct 264 ms 436948 KB Output is correct
23 Correct 328 ms 437168 KB Output is correct
24 Correct 472 ms 437184 KB Output is correct
25 Correct 253 ms 436304 KB Output is correct
26 Correct 300 ms 437524 KB Output is correct
27 Correct 267 ms 436940 KB Output is correct
28 Correct 253 ms 436880 KB Output is correct
29 Correct 312 ms 437448 KB Output is correct
30 Correct 258 ms 437100 KB Output is correct
31 Correct 263 ms 437140 KB Output is correct
32 Correct 373 ms 436820 KB Output is correct
33 Correct 290 ms 437108 KB Output is correct
34 Correct 441 ms 436880 KB Output is correct
35 Correct 415 ms 437100 KB Output is correct

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 203612 KB Output is correct
2 Correct 3593 ms 1939408 KB Output is correct
3 Correct 2760 ms 1939400 KB Output is correct
4 Correct 3085 ms 1942964 KB Output is correct
5 Correct 4411 ms 1945044 KB Output is correct
6 Correct 3144 ms 1944388 KB Output is correct
7 Correct 2559 ms 1940384 KB Output is correct
8 Correct 23 ms 203612 KB Output is correct
9 Correct 291 ms 435936 KB Output is correct
10 Correct 252 ms 435992 KB Output is correct
11 Correct 227 ms 436904 KB Output is correct
12 Correct 228 ms 436820 KB Output is correct
13 Correct 283 ms 437044 KB Output is correct
14 Correct 292 ms 437208 KB Output is correct
15 Correct 242 ms 436736 KB Output is correct
16 Correct 253 ms 436932 KB Output is correct
17 Correct 242 ms 436564 KB Output is correct
18 Correct 349 ms 437076 KB Output is correct
19 Correct 557 ms 437260 KB Output is correct
20 Correct 470 ms 437332 KB Output is correct
21 Correct 22 ms 203600 KB Output is correct
22 Correct 266 ms 437340 KB Output is correct
23 Correct 286 ms 437564 KB Output is correct
24 Correct 259 ms 436912 KB Output is correct
25 Correct 257 ms 437192 KB Output is correct
26 Correct 284 ms 437196 KB Output is correct
27 Correct 257 ms 437212 KB Output is correct
28 Correct 246 ms 436852 KB Output is correct
29 Correct 264 ms 436948 KB Output is correct
30 Correct 328 ms 437168 KB Output is correct
31 Correct 472 ms 437184 KB Output is correct
32 Correct 253 ms 436304 KB Output is correct
33 Correct 300 ms 437524 KB Output is correct
34 Correct 267 ms 436940 KB Output is correct
35 Correct 253 ms 436880 KB Output is correct
36 Correct 312 ms 437448 KB Output is correct
37 Correct 258 ms 437100 KB Output is correct
38 Correct 263 ms 437140 KB Output is correct
39 Correct 373 ms 436820 KB Output is correct
40 Correct 290 ms 437108 KB Output is correct
41 Correct 441 ms 436880 KB Output is correct
42 Correct 415 ms 437100 KB Output is correct
43 Correct 18 ms 199320 KB Output is correct
44 Correct 22 ms 203460 KB Output is correct
45 Correct 6080 ms 1939572 KB Output is correct
46 Correct 3934 ms 1945960 KB Output is correct
47 Correct 4228 ms 1946008 KB Output is correct
48 Correct 3855 ms 1947700 KB Output is correct
49 Correct 6074 ms 1949332 KB Output is correct
50 Correct 2856 ms 1947408 KB Output is correct
51 Correct 3991 ms 1947960 KB Output is correct
52 Correct 2895 ms 1946020 KB Output is correct
53 Execution timed out 7013 ms 1016040 KB Time limit exceeded
54 Halted 0 ms 0 KB -