oj.uz

Submission #856906

# Submission time Handle Problem Language Result Execution time Memory
856906 2023-10-04T19:43:22 Z andrei_boaca Dungeons Game (IOI21_dungeons) C++17
89 / 100
 7000 ms 1950316 KB 
#include "dungeons.h"
#include <vector>
#include <bits/stdc++.h>
//#include "grader.cpp"
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("fast-math")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx2")
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];
int baza=3;
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;
    if(n>50000)
        baza=2;
    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<=baza;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<=baza;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 22 ms 199256 KB Output is correct
2 Correct 19 ms 199472 KB Output is correct
3 Correct 31 ms 209744 KB Output is correct
4 Correct 476 ms 435972 KB Output is correct
5 Correct 32 ms 209756 KB Output is correct
6 Correct 508 ms 436004 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 203612 KB Output is correct
2 Correct 3729 ms 1945180 KB Output is correct
3 Correct 3398 ms 1945604 KB Output is correct
4 Correct 3985 ms 1946848 KB Output is correct
5 Correct 5149 ms 1939400 KB Output is correct
6 Correct 4138 ms 1946272 KB Output is correct
7 Correct 3220 ms 1944332 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 203604 KB Output is correct
2 Correct 572 ms 437712 KB Output is correct
3 Correct 385 ms 437684 KB Output is correct
4 Correct 360 ms 437056 KB Output is correct
5 Correct 329 ms 436980 KB Output is correct
6 Correct 542 ms 437116 KB Output is correct
7 Correct 552 ms 437072 KB Output is correct
8 Correct 399 ms 436696 KB Output is correct
9 Correct 380 ms 436816 KB Output is correct
10 Correct 350 ms 436704 KB Output is correct
11 Correct 533 ms 437076 KB Output is correct
12 Correct 777 ms 437072 KB Output is correct
13 Correct 587 ms 437072 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 203604 KB Output is correct
2 Correct 572 ms 437712 KB Output is correct
3 Correct 385 ms 437684 KB Output is correct
4 Correct 360 ms 437056 KB Output is correct
5 Correct 329 ms 436980 KB Output is correct
6 Correct 542 ms 437116 KB Output is correct
7 Correct 552 ms 437072 KB Output is correct
8 Correct 399 ms 436696 KB Output is correct
9 Correct 380 ms 436816 KB Output is correct
10 Correct 350 ms 436704 KB Output is correct
11 Correct 533 ms 437076 KB Output is correct
12 Correct 777 ms 437072 KB Output is correct
13 Correct 587 ms 437072 KB Output is correct
14 Correct 28 ms 203596 KB Output is correct
15 Correct 569 ms 437216 KB Output is correct
16 Correct 471 ms 437788 KB Output is correct
17 Correct 331 ms 436976 KB Output is correct
18 Correct 455 ms 437048 KB Output is correct
19 Correct 600 ms 437404 KB Output is correct
20 Correct 420 ms 436936 KB Output is correct
21 Correct 367 ms 436900 KB Output is correct
22 Correct 519 ms 437076 KB Output is correct
23 Correct 1434 ms 437068 KB Output is correct
24 Correct 648 ms 437116 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 203604 KB Output is correct
2 Correct 572 ms 437712 KB Output is correct
3 Correct 385 ms 437684 KB Output is correct
4 Correct 360 ms 437056 KB Output is correct
5 Correct 329 ms 436980 KB Output is correct
6 Correct 542 ms 437116 KB Output is correct
7 Correct 552 ms 437072 KB Output is correct
8 Correct 399 ms 436696 KB Output is correct
9 Correct 380 ms 436816 KB Output is correct
10 Correct 350 ms 436704 KB Output is correct
11 Correct 533 ms 437076 KB Output is correct
12 Correct 777 ms 437072 KB Output is correct
13 Correct 587 ms 437072 KB Output is correct
14 Correct 28 ms 203596 KB Output is correct
15 Correct 569 ms 437216 KB Output is correct
16 Correct 471 ms 437788 KB Output is correct
17 Correct 331 ms 436976 KB Output is correct
18 Correct 455 ms 437048 KB Output is correct
19 Correct 600 ms 437404 KB Output is correct
20 Correct 420 ms 436936 KB Output is correct
21 Correct 367 ms 436900 KB Output is correct
22 Correct 519 ms 437076 KB Output is correct
23 Correct 1434 ms 437068 KB Output is correct
24 Correct 648 ms 437116 KB Output is correct
25 Correct 522 ms 436308 KB Output is correct
26 Correct 492 ms 437612 KB Output is correct
27 Correct 400 ms 436916 KB Output is correct
28 Correct 397 ms 437028 KB Output is correct
29 Correct 434 ms 437332 KB Output is correct
30 Correct 361 ms 437184 KB Output is correct
31 Correct 353 ms 436908 KB Output is correct
32 Correct 561 ms 437064 KB Output is correct
33 Correct 397 ms 437112 KB Output is correct
34 Correct 559 ms 437072 KB Output is correct
35 Correct 518 ms 436820 KB Output is correct

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 203612 KB Output is correct
2 Correct 3729 ms 1945180 KB Output is correct
3 Correct 3398 ms 1945604 KB Output is correct
4 Correct 3985 ms 1946848 KB Output is correct
5 Correct 5149 ms 1939400 KB Output is correct
6 Correct 4138 ms 1946272 KB Output is correct
7 Correct 3220 ms 1944332 KB Output is correct
8 Correct 28 ms 203604 KB Output is correct
9 Correct 572 ms 437712 KB Output is correct
10 Correct 385 ms 437684 KB Output is correct
11 Correct 360 ms 437056 KB Output is correct
12 Correct 329 ms 436980 KB Output is correct
13 Correct 542 ms 437116 KB Output is correct
14 Correct 552 ms 437072 KB Output is correct
15 Correct 399 ms 436696 KB Output is correct
16 Correct 380 ms 436816 KB Output is correct
17 Correct 350 ms 436704 KB Output is correct
18 Correct 533 ms 437076 KB Output is correct
19 Correct 777 ms 437072 KB Output is correct
20 Correct 587 ms 437072 KB Output is correct
21 Correct 28 ms 203596 KB Output is correct
22 Correct 569 ms 437216 KB Output is correct
23 Correct 471 ms 437788 KB Output is correct
24 Correct 331 ms 436976 KB Output is correct
25 Correct 455 ms 437048 KB Output is correct
26 Correct 600 ms 437404 KB Output is correct
27 Correct 420 ms 436936 KB Output is correct
28 Correct 367 ms 436900 KB Output is correct
29 Correct 519 ms 437076 KB Output is correct
30 Correct 1434 ms 437068 KB Output is correct
31 Correct 648 ms 437116 KB Output is correct
32 Correct 522 ms 436308 KB Output is correct
33 Correct 492 ms 437612 KB Output is correct
34 Correct 400 ms 436916 KB Output is correct
35 Correct 397 ms 437028 KB Output is correct
36 Correct 434 ms 437332 KB Output is correct
37 Correct 361 ms 437184 KB Output is correct
38 Correct 353 ms 436908 KB Output is correct
39 Correct 561 ms 437064 KB Output is correct
40 Correct 397 ms 437112 KB Output is correct
41 Correct 559 ms 437072 KB Output is correct
42 Correct 518 ms 436820 KB Output is correct
43 Correct 19 ms 199260 KB Output is correct
44 Correct 28 ms 203608 KB Output is correct
45 Correct 5719 ms 1950316 KB Output is correct
46 Correct 4462 ms 1946184 KB Output is correct
47 Correct 4283 ms 1946544 KB Output is correct
48 Correct 4225 ms 1948756 KB Output is correct
49 Correct 6093 ms 1949896 KB Output is correct
50 Correct 3099 ms 1946884 KB Output is correct
51 Correct 4173 ms 1944748 KB Output is correct
52 Correct 3200 ms 1939936 KB Output is correct
53 Execution timed out 7040 ms 1257984 KB Time limit exceeded
54 Halted 0 ms 0 KB -