oj.uz

Submission #856905

# Submission time Handle Problem Language Result Execution time Memory
856905 2023-10-04T19:42:54 Z andrei_boaca Dungeons Game (IOI21_dungeons) C++17
89 / 100
 7000 ms 1950428 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")
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 18 ms 199260 KB Output is correct
2 Correct 18 ms 199256 KB Output is correct
3 Correct 28 ms 207696 KB Output is correct
4 Correct 246 ms 436056 KB Output is correct
5 Correct 28 ms 207700 KB Output is correct
6 Correct 244 ms 435952 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 203600 KB Output is correct
2 Correct 2907 ms 1944448 KB Output is correct
3 Correct 2820 ms 1945356 KB Output is correct
4 Correct 2987 ms 1946688 KB Output is correct
5 Correct 2972 ms 1946528 KB Output is correct
6 Correct 2828 ms 1943360 KB Output is correct
7 Correct 2419 ms 1939764 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 203612 KB Output is correct
2 Correct 287 ms 435692 KB Output is correct
3 Correct 272 ms 436052 KB Output is correct
4 Correct 227 ms 435796 KB Output is correct
5 Correct 239 ms 435824 KB Output is correct
6 Correct 337 ms 435900 KB Output is correct
7 Correct 303 ms 435796 KB Output is correct
8 Correct 263 ms 436032 KB Output is correct
9 Correct 251 ms 435788 KB Output is correct
10 Correct 241 ms 435936 KB Output is correct
11 Correct 380 ms 435756 KB Output is correct
12 Correct 619 ms 435792 KB Output is correct
13 Correct 503 ms 437052 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 203612 KB Output is correct
2 Correct 287 ms 435692 KB Output is correct
3 Correct 272 ms 436052 KB Output is correct
4 Correct 227 ms 435796 KB Output is correct
5 Correct 239 ms 435824 KB Output is correct
6 Correct 337 ms 435900 KB Output is correct
7 Correct 303 ms 435796 KB Output is correct
8 Correct 263 ms 436032 KB Output is correct
9 Correct 251 ms 435788 KB Output is correct
10 Correct 241 ms 435936 KB Output is correct
11 Correct 380 ms 435756 KB Output is correct
12 Correct 619 ms 435792 KB Output is correct
13 Correct 503 ms 437052 KB Output is correct
14 Correct 23 ms 203620 KB Output is correct
15 Correct 269 ms 437308 KB Output is correct
16 Correct 346 ms 437452 KB Output is correct
17 Correct 266 ms 437076 KB Output is correct
18 Correct 266 ms 437060 KB Output is correct
19 Correct 328 ms 437228 KB Output is correct
20 Correct 272 ms 436924 KB Output is correct
21 Correct 297 ms 437064 KB Output is correct
22 Correct 315 ms 436968 KB Output is correct
23 Correct 476 ms 437032 KB Output is correct
24 Correct 624 ms 437416 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 203612 KB Output is correct
2 Correct 287 ms 435692 KB Output is correct
3 Correct 272 ms 436052 KB Output is correct
4 Correct 227 ms 435796 KB Output is correct
5 Correct 239 ms 435824 KB Output is correct
6 Correct 337 ms 435900 KB Output is correct
7 Correct 303 ms 435796 KB Output is correct
8 Correct 263 ms 436032 KB Output is correct
9 Correct 251 ms 435788 KB Output is correct
10 Correct 241 ms 435936 KB Output is correct
11 Correct 380 ms 435756 KB Output is correct
12 Correct 619 ms 435792 KB Output is correct
13 Correct 503 ms 437052 KB Output is correct
14 Correct 23 ms 203620 KB Output is correct
15 Correct 269 ms 437308 KB Output is correct
16 Correct 346 ms 437452 KB Output is correct
17 Correct 266 ms 437076 KB Output is correct
18 Correct 266 ms 437060 KB Output is correct
19 Correct 328 ms 437228 KB Output is correct
20 Correct 272 ms 436924 KB Output is correct
21 Correct 297 ms 437064 KB Output is correct
22 Correct 315 ms 436968 KB Output is correct
23 Correct 476 ms 437032 KB Output is correct
24 Correct 624 ms 437416 KB Output is correct
25 Correct 425 ms 436476 KB Output is correct
26 Correct 537 ms 437392 KB Output is correct
27 Correct 478 ms 437024 KB Output is correct
28 Correct 530 ms 437056 KB Output is correct
29 Correct 327 ms 437456 KB Output is correct
30 Correct 298 ms 437076 KB Output is correct
31 Correct 319 ms 436796 KB Output is correct
32 Correct 406 ms 437092 KB Output is correct
33 Correct 714 ms 437192 KB Output is correct
34 Correct 991 ms 436904 KB Output is correct
35 Correct 413 ms 436932 KB Output is correct

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 203600 KB Output is correct
2 Correct 2907 ms 1944448 KB Output is correct
3 Correct 2820 ms 1945356 KB Output is correct
4 Correct 2987 ms 1946688 KB Output is correct
5 Correct 2972 ms 1946528 KB Output is correct
6 Correct 2828 ms 1943360 KB Output is correct
7 Correct 2419 ms 1939764 KB Output is correct
8 Correct 22 ms 203612 KB Output is correct
9 Correct 287 ms 435692 KB Output is correct
10 Correct 272 ms 436052 KB Output is correct
11 Correct 227 ms 435796 KB Output is correct
12 Correct 239 ms 435824 KB Output is correct
13 Correct 337 ms 435900 KB Output is correct
14 Correct 303 ms 435796 KB Output is correct
15 Correct 263 ms 436032 KB Output is correct
16 Correct 251 ms 435788 KB Output is correct
17 Correct 241 ms 435936 KB Output is correct
18 Correct 380 ms 435756 KB Output is correct
19 Correct 619 ms 435792 KB Output is correct
20 Correct 503 ms 437052 KB Output is correct
21 Correct 23 ms 203620 KB Output is correct
22 Correct 269 ms 437308 KB Output is correct
23 Correct 346 ms 437452 KB Output is correct
24 Correct 266 ms 437076 KB Output is correct
25 Correct 266 ms 437060 KB Output is correct
26 Correct 328 ms 437228 KB Output is correct
27 Correct 272 ms 436924 KB Output is correct
28 Correct 297 ms 437064 KB Output is correct
29 Correct 315 ms 436968 KB Output is correct
30 Correct 476 ms 437032 KB Output is correct
31 Correct 624 ms 437416 KB Output is correct
32 Correct 425 ms 436476 KB Output is correct
33 Correct 537 ms 437392 KB Output is correct
34 Correct 478 ms 437024 KB Output is correct
35 Correct 530 ms 437056 KB Output is correct
36 Correct 327 ms 437456 KB Output is correct
37 Correct 298 ms 437076 KB Output is correct
38 Correct 319 ms 436796 KB Output is correct
39 Correct 406 ms 437092 KB Output is correct
40 Correct 714 ms 437192 KB Output is correct
41 Correct 991 ms 436904 KB Output is correct
42 Correct 413 ms 436932 KB Output is correct
43 Correct 21 ms 199256 KB Output is correct
44 Correct 23 ms 203612 KB Output is correct
45 Correct 5213 ms 1949236 KB Output is correct
46 Correct 4002 ms 1939400 KB Output is correct
47 Correct 4293 ms 1946700 KB Output is correct
48 Correct 3954 ms 1948780 KB Output is correct
49 Correct 4817 ms 1950428 KB Output is correct
50 Correct 2973 ms 1948084 KB Output is correct
51 Correct 3291 ms 1948492 KB Output is correct
52 Correct 3032 ms 1946616 KB Output is correct
53 Execution timed out 7026 ms 1947340 KB Time limit exceeded
54 Halted 0 ms 0 KB -