oj.uz

답안 #935022

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
935022 2024-02-28T12:01:40 Z vjudge1 던전 (IOI21_dungeons) C++17
100 / 100
 2241 ms 933292 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 30 ms 121940 KB Output is correct
2 Correct 14 ms 121948 KB Output is correct
3 Correct 17 ms 123900 KB Output is correct
4 Correct 81 ms 219912 KB Output is correct
5 Correct 17 ms 123740 KB Output is correct
6 Correct 84 ms 219764 KB Output is correct

Subtask #2
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 121948 KB Output is correct
2 Correct 833 ms 925660 KB Output is correct
3 Correct 600 ms 928832 KB Output is correct
4 Correct 559 ms 929616 KB Output is correct
5 Correct 606 ms 930040 KB Output is correct
6 Correct 644 ms 928888 KB Output is correct
7 Correct 622 ms 926804 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 209740 KB Output is correct
2 Correct 160 ms 295236 KB Output is correct
3 Correct 164 ms 293640 KB Output is correct
4 Correct 123 ms 294524 KB Output is correct
5 Correct 109 ms 294484 KB Output is correct
6 Correct 203 ms 293020 KB Output is correct
7 Correct 194 ms 296660 KB Output is correct
8 Correct 115 ms 294344 KB Output is correct
9 Correct 130 ms 294480 KB Output is correct
10 Correct 138 ms 297936 KB Output is correct
11 Correct 125 ms 298380 KB Output is correct
12 Correct 246 ms 298428 KB Output is correct
13 Correct 155 ms 301904 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 209740 KB Output is correct
2 Correct 160 ms 295236 KB Output is correct
3 Correct 164 ms 293640 KB Output is correct
4 Correct 123 ms 294524 KB Output is correct
5 Correct 109 ms 294484 KB Output is correct
6 Correct 203 ms 293020 KB Output is correct
7 Correct 194 ms 296660 KB Output is correct
8 Correct 115 ms 294344 KB Output is correct
9 Correct 130 ms 294480 KB Output is correct
10 Correct 138 ms 297936 KB Output is correct
11 Correct 125 ms 298380 KB Output is correct
12 Correct 246 ms 298428 KB Output is correct
13 Correct 155 ms 301904 KB Output is correct
14 Correct 26 ms 215644 KB Output is correct
15 Correct 114 ms 302120 KB Output is correct
16 Correct 181 ms 300624 KB Output is correct
17 Correct 106 ms 300168 KB Output is correct
18 Correct 107 ms 298320 KB Output is correct
19 Correct 213 ms 298564 KB Output is correct
20 Correct 125 ms 298068 KB Output is correct
21 Correct 131 ms 296564 KB Output is correct
22 Correct 159 ms 298196 KB Output is correct
23 Correct 118 ms 296720 KB Output is correct
24 Correct 184 ms 294816 KB Output is correct

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 209740 KB Output is correct
2 Correct 160 ms 295236 KB Output is correct
3 Correct 164 ms 293640 KB Output is correct
4 Correct 123 ms 294524 KB Output is correct
5 Correct 109 ms 294484 KB Output is correct
6 Correct 203 ms 293020 KB Output is correct
7 Correct 194 ms 296660 KB Output is correct
8 Correct 115 ms 294344 KB Output is correct
9 Correct 130 ms 294480 KB Output is correct
10 Correct 138 ms 297936 KB Output is correct
11 Correct 125 ms 298380 KB Output is correct
12 Correct 246 ms 298428 KB Output is correct
13 Correct 155 ms 301904 KB Output is correct
14 Correct 26 ms 215644 KB Output is correct
15 Correct 114 ms 302120 KB Output is correct
16 Correct 181 ms 300624 KB Output is correct
17 Correct 106 ms 300168 KB Output is correct
18 Correct 107 ms 298320 KB Output is correct
19 Correct 213 ms 298564 KB Output is correct
20 Correct 125 ms 298068 KB Output is correct
21 Correct 131 ms 296564 KB Output is correct
22 Correct 159 ms 298196 KB Output is correct
23 Correct 118 ms 296720 KB Output is correct
24 Correct 184 ms 294816 KB Output is correct
25 Correct 90 ms 293996 KB Output is correct
26 Correct 166 ms 295076 KB Output is correct
27 Correct 124 ms 294484 KB Output is correct
28 Correct 115 ms 294552 KB Output is correct
29 Correct 177 ms 295252 KB Output is correct
30 Correct 141 ms 294736 KB Output is correct
31 Correct 145 ms 294668 KB Output is correct
32 Correct 218 ms 294528 KB Output is correct
33 Correct 597 ms 294788 KB Output is correct
34 Correct 1206 ms 294980 KB Output is correct
35 Correct 754 ms 294604 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 121948 KB Output is correct
2 Correct 833 ms 925660 KB Output is correct
3 Correct 600 ms 928832 KB Output is correct
4 Correct 559 ms 929616 KB Output is correct
5 Correct 606 ms 930040 KB Output is correct
6 Correct 644 ms 928888 KB Output is correct
7 Correct 622 ms 926804 KB Output is correct
8 Correct 29 ms 209740 KB Output is correct
9 Correct 160 ms 295236 KB Output is correct
10 Correct 164 ms 293640 KB Output is correct
11 Correct 123 ms 294524 KB Output is correct
12 Correct 109 ms 294484 KB Output is correct
13 Correct 203 ms 293020 KB Output is correct
14 Correct 194 ms 296660 KB Output is correct
15 Correct 115 ms 294344 KB Output is correct
16 Correct 130 ms 294480 KB Output is correct
17 Correct 138 ms 297936 KB Output is correct
18 Correct 125 ms 298380 KB Output is correct
19 Correct 246 ms 298428 KB Output is correct
20 Correct 155 ms 301904 KB Output is correct
21 Correct 26 ms 215644 KB Output is correct
22 Correct 114 ms 302120 KB Output is correct
23 Correct 181 ms 300624 KB Output is correct
24 Correct 106 ms 300168 KB Output is correct
25 Correct 107 ms 298320 KB Output is correct
26 Correct 213 ms 298564 KB Output is correct
27 Correct 125 ms 298068 KB Output is correct
28 Correct 131 ms 296564 KB Output is correct
29 Correct 159 ms 298196 KB Output is correct
30 Correct 118 ms 296720 KB Output is correct
31 Correct 184 ms 294816 KB Output is correct
32 Correct 90 ms 293996 KB Output is correct
33 Correct 166 ms 295076 KB Output is correct
34 Correct 124 ms 294484 KB Output is correct
35 Correct 115 ms 294552 KB Output is correct
36 Correct 177 ms 295252 KB Output is correct
37 Correct 141 ms 294736 KB Output is correct
38 Correct 145 ms 294668 KB Output is correct
39 Correct 218 ms 294528 KB Output is correct
40 Correct 597 ms 294788 KB Output is correct
41 Correct 1206 ms 294980 KB Output is correct
42 Correct 754 ms 294604 KB Output is correct
43 Correct 24 ms 205652 KB Output is correct
44 Correct 25 ms 207444 KB Output is correct
45 Correct 789 ms 932712 KB Output is correct
46 Correct 575 ms 928848 KB Output is correct
47 Correct 631 ms 929340 KB Output is correct
48 Correct 801 ms 931352 KB Output is correct
49 Correct 781 ms 933292 KB Output is correct
50 Correct 558 ms 931024 KB Output is correct
51 Correct 529 ms 931256 KB Output is correct
52 Correct 615 ms 928820 KB Output is correct
53 Correct 959 ms 929776 KB Output is correct
54 Correct 1592 ms 931108 KB Output is correct
55 Correct 2138 ms 929764 KB Output is correct
56 Correct 1802 ms 930428 KB Output is correct
57 Correct 2019 ms 930372 KB Output is correct
58 Correct 2168 ms 930640 KB Output is correct
59 Correct 2132 ms 930900 KB Output is correct
60 Correct 2141 ms 930176 KB Output is correct
61 Correct 2241 ms 930036 KB Output is correct