oj.uz

답안 #856278

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
856278 2023-10-03T03:34:50 Z onepunchac168 던전 (IOI21_dungeons) C++17
100 / 100
 1512 ms 921776 KB 
//------------------------------------\\
//   ------------------------------   \\
//  |  created by Dinh Manh Hung   |  \\
//  |      tht.onepunchac168       |  \\
//  |     THPT CHUYEN HA TINH      |  \\
//  |      HA TINH, VIET NAM       |  \\
//  |           Siuuu              |  \\
//   ------------------------------   \\
//------------------------------------\\

#include <bits/stdc++.h>
#include "dungeons.h"
using namespace std;


// DEBUG
/*
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}


#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
*/

/* END OF TEMPLATE*/

// ================= Solution =================//

/*
void onepunchac168();

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    file(task);
    int tests;
    tests=1;
    //cin>>tests;
    while (tests--)
    {
        onepunchac168();
    }
}

const int N=2e5+5;

void onepunchac168()
{

}
*/

const int L1=6;
const int L2=24;
const int N=4e5+1;
int dp[L1][L2][N];
long long take[L1][L2][N];
int nxt[L1][L2][N];
int BS[L1];
int MAX=1e9+5;
int solve;
vector <int > S,P,W,L;

void init(int n, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l)
{
    solve=n;
    n++;
    solve++;
    BS[0]=1;
    S=s;
    P=p;
    W=w;
    L=l;
    for (int i=1;i<L1;i++)
    {
        BS[i]=BS[i-1]*32;
    }
    for (int i=0;i<L1;i++)
    {
        for (int j=1;j<n;j++)
        {
            if (BS[i]>s[j-1])
            {
                dp[i][0][j]=MAX+10;
                nxt[i][0][j]=w[j-1]+1;
                take[i][0][j]=s[j-1];
            }
            else
            {
                dp[i][0][j]=s[j-1];
                nxt[i][0][j]=l[j-1]+1;
                take[i][0][j]=p[j-1];
            }
        }
    }

    for (int i=0;i<L1;i++)
    {
        for (int j=0;j<L2;j++)
        {
            nxt[i][j][n]=n;
        }
        for (int j=1;j<L2;j++)
        {
            for (int h=1;h<n;h++)
            {
                int gg=nxt[i][j-1][h];
                nxt[i][j][h]=nxt[i][j-1][gg];
                take[i][j][h]=take[i][j-1][h]+take[i][j-1][gg];
                if (dp[i][j-1][gg]==MAX+10)
                {
                    dp[i][j][h]=dp[i][j-1][h];
                    continue;
                }
                if (take[i][j-1][h]>=dp[i][j-1][gg])
                {
                    dp[i][j][h]=0;
                    continue;
                }
                dp[i][j][h]=min(dp[i][j-1][h],dp[i][j-1][gg]-int(take[i][j-1][h]));
            }
        }
    }
    return;
}

long long simulate(int x, int z)
{
    x++;
    long long orz=z;
    int tmp=0;
    while (true)
    {
        if (x==solve)
        {
            break;
        }
        while (tmp+1<L1&&BS[tmp+1]<=orz)
        {
            tmp++;
        }
        for (int i=L2-1;i>=0;i--)
        {
            if (nxt[tmp][i][x]==solve||(dp[tmp][i][x]!=MAX+10&&orz>=dp[tmp][i][x]))
            {
                continue;
            }
            orz+=take[tmp][i][x];
            x=nxt[tmp][i][x];
        }
        if (orz>=S[x-1])
        {
            orz+=S[x-1];
            x=W[x-1]+1;
        }
        else
        {
            orz+=P[x-1];
            x=L[x-1]+1;
        }
    }
    return orz;
}

Compilation message

dungeons.cpp:1:1: warning: multi-line comment [-Wcomment]
    1 | //------------------------------------\\
      | ^

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 745300 KB Output is correct
2 Correct 69 ms 745124 KB Output is correct
3 Correct 69 ms 747228 KB Output is correct
4 Correct 105 ms 809160 KB Output is correct
5 Correct 70 ms 747348 KB Output is correct
6 Correct 104 ms 809300 KB Output is correct

Subtask #2
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 745300 KB Output is correct
2 Correct 337 ms 921664 KB Output is correct
3 Correct 325 ms 921684 KB Output is correct
4 Correct 328 ms 921684 KB Output is correct
5 Correct 364 ms 921680 KB Output is correct
6 Correct 392 ms 921740 KB Output is correct
7 Correct 358 ms 921680 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 745296 KB Output is correct
2 Correct 149 ms 810064 KB Output is correct
3 Correct 152 ms 810172 KB Output is correct
4 Correct 118 ms 810004 KB Output is correct
5 Correct 120 ms 810144 KB Output is correct
6 Correct 155 ms 809992 KB Output is correct
7 Correct 150 ms 810068 KB Output is correct
8 Correct 129 ms 810064 KB Output is correct
9 Correct 137 ms 810580 KB Output is correct
10 Correct 135 ms 810136 KB Output is correct
11 Correct 130 ms 810064 KB Output is correct
12 Correct 204 ms 810408 KB Output is correct
13 Correct 154 ms 810044 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 745296 KB Output is correct
2 Correct 149 ms 810064 KB Output is correct
3 Correct 152 ms 810172 KB Output is correct
4 Correct 118 ms 810004 KB Output is correct
5 Correct 120 ms 810144 KB Output is correct
6 Correct 155 ms 809992 KB Output is correct
7 Correct 150 ms 810068 KB Output is correct
8 Correct 129 ms 810064 KB Output is correct
9 Correct 137 ms 810580 KB Output is correct
10 Correct 135 ms 810136 KB Output is correct
11 Correct 130 ms 810064 KB Output is correct
12 Correct 204 ms 810408 KB Output is correct
13 Correct 154 ms 810044 KB Output is correct
14 Correct 70 ms 745296 KB Output is correct
15 Correct 128 ms 810088 KB Output is correct
16 Correct 142 ms 810012 KB Output is correct
17 Correct 126 ms 810000 KB Output is correct
18 Correct 123 ms 810104 KB Output is correct
19 Correct 159 ms 810140 KB Output is correct
20 Correct 134 ms 810068 KB Output is correct
21 Correct 135 ms 810088 KB Output is correct
22 Correct 155 ms 810152 KB Output is correct
23 Correct 133 ms 810064 KB Output is correct
24 Correct 176 ms 810064 KB Output is correct

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 745296 KB Output is correct
2 Correct 149 ms 810064 KB Output is correct
3 Correct 152 ms 810172 KB Output is correct
4 Correct 118 ms 810004 KB Output is correct
5 Correct 120 ms 810144 KB Output is correct
6 Correct 155 ms 809992 KB Output is correct
7 Correct 150 ms 810068 KB Output is correct
8 Correct 129 ms 810064 KB Output is correct
9 Correct 137 ms 810580 KB Output is correct
10 Correct 135 ms 810136 KB Output is correct
11 Correct 130 ms 810064 KB Output is correct
12 Correct 204 ms 810408 KB Output is correct
13 Correct 154 ms 810044 KB Output is correct
14 Correct 70 ms 745296 KB Output is correct
15 Correct 128 ms 810088 KB Output is correct
16 Correct 142 ms 810012 KB Output is correct
17 Correct 126 ms 810000 KB Output is correct
18 Correct 123 ms 810104 KB Output is correct
19 Correct 159 ms 810140 KB Output is correct
20 Correct 134 ms 810068 KB Output is correct
21 Correct 135 ms 810088 KB Output is correct
22 Correct 155 ms 810152 KB Output is correct
23 Correct 133 ms 810064 KB Output is correct
24 Correct 176 ms 810064 KB Output is correct
25 Correct 112 ms 809300 KB Output is correct
26 Correct 141 ms 810068 KB Output is correct
27 Correct 129 ms 810068 KB Output is correct
28 Correct 126 ms 810068 KB Output is correct
29 Correct 159 ms 810068 KB Output is correct
30 Correct 147 ms 809952 KB Output is correct
31 Correct 154 ms 810112 KB Output is correct
32 Correct 166 ms 810180 KB Output is correct
33 Correct 351 ms 810068 KB Output is correct
34 Correct 938 ms 810016 KB Output is correct
35 Correct 294 ms 810108 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 745300 KB Output is correct
2 Correct 337 ms 921664 KB Output is correct
3 Correct 325 ms 921684 KB Output is correct
4 Correct 328 ms 921684 KB Output is correct
5 Correct 364 ms 921680 KB Output is correct
6 Correct 392 ms 921740 KB Output is correct
7 Correct 358 ms 921680 KB Output is correct
8 Correct 70 ms 745296 KB Output is correct
9 Correct 149 ms 810064 KB Output is correct
10 Correct 152 ms 810172 KB Output is correct
11 Correct 118 ms 810004 KB Output is correct
12 Correct 120 ms 810144 KB Output is correct
13 Correct 155 ms 809992 KB Output is correct
14 Correct 150 ms 810068 KB Output is correct
15 Correct 129 ms 810064 KB Output is correct
16 Correct 137 ms 810580 KB Output is correct
17 Correct 135 ms 810136 KB Output is correct
18 Correct 130 ms 810064 KB Output is correct
19 Correct 204 ms 810408 KB Output is correct
20 Correct 154 ms 810044 KB Output is correct
21 Correct 70 ms 745296 KB Output is correct
22 Correct 128 ms 810088 KB Output is correct
23 Correct 142 ms 810012 KB Output is correct
24 Correct 126 ms 810000 KB Output is correct
25 Correct 123 ms 810104 KB Output is correct
26 Correct 159 ms 810140 KB Output is correct
27 Correct 134 ms 810068 KB Output is correct
28 Correct 135 ms 810088 KB Output is correct
29 Correct 155 ms 810152 KB Output is correct
30 Correct 133 ms 810064 KB Output is correct
31 Correct 176 ms 810064 KB Output is correct
32 Correct 112 ms 809300 KB Output is correct
33 Correct 141 ms 810068 KB Output is correct
34 Correct 129 ms 810068 KB Output is correct
35 Correct 126 ms 810068 KB Output is correct
36 Correct 159 ms 810068 KB Output is correct
37 Correct 147 ms 809952 KB Output is correct
38 Correct 154 ms 810112 KB Output is correct
39 Correct 166 ms 810180 KB Output is correct
40 Correct 351 ms 810068 KB Output is correct
41 Correct 938 ms 810016 KB Output is correct
42 Correct 294 ms 810108 KB Output is correct
43 Correct 69 ms 745296 KB Output is correct
44 Correct 69 ms 745300 KB Output is correct
45 Correct 461 ms 921756 KB Output is correct
46 Correct 373 ms 921680 KB Output is correct
47 Correct 392 ms 921720 KB Output is correct
48 Correct 429 ms 921684 KB Output is correct
49 Correct 507 ms 921660 KB Output is correct
50 Correct 358 ms 921728 KB Output is correct
51 Correct 348 ms 921732 KB Output is correct
52 Correct 358 ms 921684 KB Output is correct
53 Correct 552 ms 921776 KB Output is correct
54 Correct 1130 ms 921684 KB Output is correct
55 Correct 1512 ms 921680 KB Output is correct
56 Correct 884 ms 921684 KB Output is correct
57 Correct 997 ms 921680 KB Output is correct
58 Correct 1060 ms 921660 KB Output is correct
59 Correct 1045 ms 921684 KB Output is correct
60 Correct 1351 ms 921704 KB Output is correct
61 Correct 1418 ms 921676 KB Output is correct