oj.uz

답안 #856894

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
856894 2023-10-04T19:20:01 Z andrei_boaca 던전 (IOI21_dungeons) C++17
63 / 100
 7000 ms 1599288 KB 
#include "dungeons.h"
#include <vector>
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
typedef long long ll;
ll s[400005],p[400005],w[400005],l[400005],cost[400005],to[25][400005];
ll n;
int dp[25][400005][10];
ll suma[25][400005][10];
int who[25][400005][10];
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<=9;j++)
        {
            for(int i=0;i<=n;i++)
            {
                ll sum=0;
                ll x=i;
                for(int c=1;c<=8;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<=9;j++)
        {
            for(int i=0;i<=n;i++)
            {
                ll x=i;
                ll maxim=-1e9;
                ll sum=0;
                for(int c=1;c<=8;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][9];
                x=who[k][x][9];
            }
            continue;
        }
        for(int i=9;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

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 213848 KB Output is correct
2 Correct 20 ms 213588 KB Output is correct
3 Correct 38 ms 222044 KB Output is correct
4 Correct 605 ms 423084 KB Output is correct
5 Correct 42 ms 222036 KB Output is correct
6 Correct 585 ms 423012 KB Output is correct

Subtask #2
0.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 218048 KB Output is correct
2 Execution timed out 7044 ms 1599288 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 217936 KB Output is correct
2 Correct 750 ms 423588 KB Output is correct
3 Correct 562 ms 423432 KB Output is correct
4 Correct 547 ms 423588 KB Output is correct
5 Correct 544 ms 423508 KB Output is correct
6 Correct 660 ms 423656 KB Output is correct
7 Correct 725 ms 423512 KB Output is correct
8 Correct 584 ms 423664 KB Output is correct
9 Correct 570 ms 423528 KB Output is correct
10 Correct 550 ms 423612 KB Output is correct
11 Correct 988 ms 423616 KB Output is correct
12 Correct 1451 ms 423816 KB Output is correct
13 Correct 636 ms 423432 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 217936 KB Output is correct
2 Correct 750 ms 423588 KB Output is correct
3 Correct 562 ms 423432 KB Output is correct
4 Correct 547 ms 423588 KB Output is correct
5 Correct 544 ms 423508 KB Output is correct
6 Correct 660 ms 423656 KB Output is correct
7 Correct 725 ms 423512 KB Output is correct
8 Correct 584 ms 423664 KB Output is correct
9 Correct 570 ms 423528 KB Output is correct
10 Correct 550 ms 423612 KB Output is correct
11 Correct 988 ms 423616 KB Output is correct
12 Correct 1451 ms 423816 KB Output is correct
13 Correct 636 ms 423432 KB Output is correct
14 Correct 29 ms 217944 KB Output is correct
15 Correct 649 ms 423612 KB Output is correct
16 Correct 752 ms 423564 KB Output is correct
17 Correct 591 ms 423456 KB Output is correct
18 Correct 615 ms 423620 KB Output is correct
19 Correct 700 ms 423544 KB Output is correct
20 Correct 585 ms 423652 KB Output is correct
21 Correct 607 ms 423492 KB Output is correct
22 Correct 614 ms 423612 KB Output is correct
23 Correct 958 ms 423584 KB Output is correct
24 Correct 1335 ms 423556 KB Output is correct

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 217936 KB Output is correct
2 Correct 750 ms 423588 KB Output is correct
3 Correct 562 ms 423432 KB Output is correct
4 Correct 547 ms 423588 KB Output is correct
5 Correct 544 ms 423508 KB Output is correct
6 Correct 660 ms 423656 KB Output is correct
7 Correct 725 ms 423512 KB Output is correct
8 Correct 584 ms 423664 KB Output is correct
9 Correct 570 ms 423528 KB Output is correct
10 Correct 550 ms 423612 KB Output is correct
11 Correct 988 ms 423616 KB Output is correct
12 Correct 1451 ms 423816 KB Output is correct
13 Correct 636 ms 423432 KB Output is correct
14 Correct 29 ms 217944 KB Output is correct
15 Correct 649 ms 423612 KB Output is correct
16 Correct 752 ms 423564 KB Output is correct
17 Correct 591 ms 423456 KB Output is correct
18 Correct 615 ms 423620 KB Output is correct
19 Correct 700 ms 423544 KB Output is correct
20 Correct 585 ms 423652 KB Output is correct
21 Correct 607 ms 423492 KB Output is correct
22 Correct 614 ms 423612 KB Output is correct
23 Correct 958 ms 423584 KB Output is correct
24 Correct 1335 ms 423556 KB Output is correct
25 Correct 675 ms 422736 KB Output is correct
26 Correct 681 ms 423836 KB Output is correct
27 Correct 604 ms 423388 KB Output is correct
28 Correct 601 ms 423736 KB Output is correct
29 Correct 743 ms 423616 KB Output is correct
30 Correct 587 ms 423744 KB Output is correct
31 Correct 648 ms 423688 KB Output is correct
32 Correct 1217 ms 423772 KB Output is correct
33 Correct 647 ms 423588 KB Output is correct
34 Correct 904 ms 423764 KB Output is correct
35 Correct 902 ms 423548 KB Output is correct

Subtask #6
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 218048 KB Output is correct
2 Execution timed out 7044 ms 1599288 KB Time limit exceeded
3 Halted 0 ms 0 KB -