oj.uz

답안 #856896

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
856896 2023-10-04T19:25:31 Z andrei_boaca 던전 (IOI21_dungeons) C++17
89 / 100
 7000 ms 1838548 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][11];
ll suma[25][400005][11];
int who[25][400005][11];
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<=10;j++)
        {
            for(int i=0;i<=n;i++)
            {
                ll sum=0;
                ll x=i;
                for(int c=1;c<=4;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<=10;j++)
        {
            for(int i=0;i<=n;i++)
            {
                ll x=i;
                ll maxim=-1e9;
                ll sum=0;
                for(int c=1;c<=4;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][10];
                x=who[k][x][10];
            }
            continue;
        }
        for(int i=10;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 21 ms 213852 KB Output is correct
2 Correct 19 ms 213804 KB Output is correct
3 Correct 31 ms 224200 KB Output is correct
4 Correct 335 ms 441304 KB Output is correct
5 Correct 31 ms 224092 KB Output is correct
6 Correct 344 ms 441072 KB Output is correct

Subtask #2
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 217944 KB Output is correct
2 Correct 3105 ms 1829964 KB Output is correct
3 Correct 2963 ms 1836628 KB Output is correct
4 Correct 3222 ms 1838548 KB Output is correct
5 Correct 4045 ms 1838444 KB Output is correct
6 Correct 2998 ms 1833464 KB Output is correct
7 Correct 2649 ms 1830168 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 217940 KB Output is correct
2 Correct 405 ms 442192 KB Output is correct
3 Correct 329 ms 441940 KB Output is correct
4 Correct 299 ms 441940 KB Output is correct
5 Correct 311 ms 442076 KB Output is correct
6 Correct 387 ms 442332 KB Output is correct
7 Correct 418 ms 441940 KB Output is correct
8 Correct 311 ms 441940 KB Output is correct
9 Correct 331 ms 441940 KB Output is correct
10 Correct 313 ms 441936 KB Output is correct
11 Correct 517 ms 442088 KB Output is correct
12 Correct 652 ms 441940 KB Output is correct
13 Correct 377 ms 442084 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 217940 KB Output is correct
2 Correct 405 ms 442192 KB Output is correct
3 Correct 329 ms 441940 KB Output is correct
4 Correct 299 ms 441940 KB Output is correct
5 Correct 311 ms 442076 KB Output is correct
6 Correct 387 ms 442332 KB Output is correct
7 Correct 418 ms 441940 KB Output is correct
8 Correct 311 ms 441940 KB Output is correct
9 Correct 331 ms 441940 KB Output is correct
10 Correct 313 ms 441936 KB Output is correct
11 Correct 517 ms 442088 KB Output is correct
12 Correct 652 ms 441940 KB Output is correct
13 Correct 377 ms 442084 KB Output is correct
14 Correct 25 ms 217948 KB Output is correct
15 Correct 353 ms 442056 KB Output is correct
16 Correct 397 ms 442196 KB Output is correct
17 Correct 327 ms 442132 KB Output is correct
18 Correct 323 ms 441936 KB Output is correct
19 Correct 399 ms 442136 KB Output is correct
20 Correct 320 ms 441936 KB Output is correct
21 Correct 332 ms 442412 KB Output is correct
22 Correct 341 ms 441940 KB Output is correct
23 Correct 491 ms 442052 KB Output is correct
24 Correct 625 ms 442076 KB Output is correct

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 217940 KB Output is correct
2 Correct 405 ms 442192 KB Output is correct
3 Correct 329 ms 441940 KB Output is correct
4 Correct 299 ms 441940 KB Output is correct
5 Correct 311 ms 442076 KB Output is correct
6 Correct 387 ms 442332 KB Output is correct
7 Correct 418 ms 441940 KB Output is correct
8 Correct 311 ms 441940 KB Output is correct
9 Correct 331 ms 441940 KB Output is correct
10 Correct 313 ms 441936 KB Output is correct
11 Correct 517 ms 442088 KB Output is correct
12 Correct 652 ms 441940 KB Output is correct
13 Correct 377 ms 442084 KB Output is correct
14 Correct 25 ms 217948 KB Output is correct
15 Correct 353 ms 442056 KB Output is correct
16 Correct 397 ms 442196 KB Output is correct
17 Correct 327 ms 442132 KB Output is correct
18 Correct 323 ms 441936 KB Output is correct
19 Correct 399 ms 442136 KB Output is correct
20 Correct 320 ms 441936 KB Output is correct
21 Correct 332 ms 442412 KB Output is correct
22 Correct 341 ms 441940 KB Output is correct
23 Correct 491 ms 442052 KB Output is correct
24 Correct 625 ms 442076 KB Output is correct
25 Correct 366 ms 441152 KB Output is correct
26 Correct 398 ms 442196 KB Output is correct
27 Correct 339 ms 442076 KB Output is correct
28 Correct 345 ms 442092 KB Output is correct
29 Correct 411 ms 442072 KB Output is correct
30 Correct 340 ms 441936 KB Output is correct
31 Correct 328 ms 441844 KB Output is correct
32 Correct 568 ms 442124 KB Output is correct
33 Correct 391 ms 442092 KB Output is correct
34 Correct 594 ms 441940 KB Output is correct
35 Correct 506 ms 442084 KB Output is correct

Subtask #6
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 217944 KB Output is correct
2 Correct 3105 ms 1829964 KB Output is correct
3 Correct 2963 ms 1836628 KB Output is correct
4 Correct 3222 ms 1838548 KB Output is correct
5 Correct 4045 ms 1838444 KB Output is correct
6 Correct 2998 ms 1833464 KB Output is correct
7 Correct 2649 ms 1830168 KB Output is correct
8 Correct 25 ms 217940 KB Output is correct
9 Correct 405 ms 442192 KB Output is correct
10 Correct 329 ms 441940 KB Output is correct
11 Correct 299 ms 441940 KB Output is correct
12 Correct 311 ms 442076 KB Output is correct
13 Correct 387 ms 442332 KB Output is correct
14 Correct 418 ms 441940 KB Output is correct
15 Correct 311 ms 441940 KB Output is correct
16 Correct 331 ms 441940 KB Output is correct
17 Correct 313 ms 441936 KB Output is correct
18 Correct 517 ms 442088 KB Output is correct
19 Correct 652 ms 441940 KB Output is correct
20 Correct 377 ms 442084 KB Output is correct
21 Correct 25 ms 217948 KB Output is correct
22 Correct 353 ms 442056 KB Output is correct
23 Correct 397 ms 442196 KB Output is correct
24 Correct 327 ms 442132 KB Output is correct
25 Correct 323 ms 441936 KB Output is correct
26 Correct 399 ms 442136 KB Output is correct
27 Correct 320 ms 441936 KB Output is correct
28 Correct 332 ms 442412 KB Output is correct
29 Correct 341 ms 441940 KB Output is correct
30 Correct 491 ms 442052 KB Output is correct
31 Correct 625 ms 442076 KB Output is correct
32 Correct 366 ms 441152 KB Output is correct
33 Correct 398 ms 442196 KB Output is correct
34 Correct 339 ms 442076 KB Output is correct
35 Correct 345 ms 442092 KB Output is correct
36 Correct 411 ms 442072 KB Output is correct
37 Correct 340 ms 441936 KB Output is correct
38 Correct 328 ms 441844 KB Output is correct
39 Correct 568 ms 442124 KB Output is correct
40 Correct 391 ms 442092 KB Output is correct
41 Correct 594 ms 441940 KB Output is correct
42 Correct 506 ms 442084 KB Output is correct
43 Correct 19 ms 213584 KB Output is correct
44 Correct 25 ms 217948 KB Output is correct
45 Execution timed out 7097 ms 1703932 KB Time limit exceeded
46 Halted 0 ms 0 KB -