oj.uz

답안 #856268

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
856268 2023-10-03T03:02:44 Z onepunchac168 던전 (IOI21_dungeons) C++17
100 / 100
 2395 ms 1401516 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;

typedef long long ll;
typedef pair <ll,ll> ii;
typedef pair <ll,ii> iii;
typedef pair <ii,ii> iiii;

// 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=7;
const int L2=25;
const int N=4e5+5;
ll dp[L1][L2][N];
ll take[L1][L2][N];
int nxt[L1][L2][N];
ll BS[L1];
ll MAX=1e18+5;
ll 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;
    solve++;
    BS[0]=1;
    S=s;
    P=p;
    W=w;
    L=l;
    for (int i=1;i<L1;i++)
    {
        BS[i]=BS[i-1]*16;
    }
    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;
                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];
                dp[i][j][h]=min(dp[i][j-1][h],dp[i][j-1][gg]-take[i][j-1][h]);
            }
        }
    }
    return;
}

long long simulate(int x, int z)
{
    x++;
    ll orz=z;
    ll 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||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 28 ms 273500 KB Output is correct
2 Correct 89 ms 991312 KB Output is correct
3 Correct 91 ms 997632 KB Output is correct
4 Correct 136 ms 1133396 KB Output is correct
5 Correct 95 ms 997712 KB Output is correct
6 Correct 146 ms 1133392 KB Output is correct

Subtask #2
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 993620 KB Output is correct
2 Correct 432 ms 1389888 KB Output is correct
3 Correct 414 ms 1389652 KB Output is correct
4 Correct 428 ms 1389908 KB Output is correct
5 Correct 471 ms 1389652 KB Output is correct
6 Correct 454 ms 1389648 KB Output is correct
7 Correct 471 ms 1389740 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 993648 KB Output is correct
2 Correct 189 ms 1134152 KB Output is correct
3 Correct 199 ms 1134396 KB Output is correct
4 Correct 157 ms 1135440 KB Output is correct
5 Correct 163 ms 1135428 KB Output is correct
6 Correct 189 ms 1135668 KB Output is correct
7 Correct 195 ms 1135576 KB Output is correct
8 Correct 173 ms 1135304 KB Output is correct
9 Correct 178 ms 1135384 KB Output is correct
10 Correct 181 ms 1135188 KB Output is correct
11 Correct 181 ms 1135784 KB Output is correct
12 Correct 585 ms 1135712 KB Output is correct
13 Correct 550 ms 1135580 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 993648 KB Output is correct
2 Correct 189 ms 1134152 KB Output is correct
3 Correct 199 ms 1134396 KB Output is correct
4 Correct 157 ms 1135440 KB Output is correct
5 Correct 163 ms 1135428 KB Output is correct
6 Correct 189 ms 1135668 KB Output is correct
7 Correct 195 ms 1135576 KB Output is correct
8 Correct 173 ms 1135304 KB Output is correct
9 Correct 178 ms 1135384 KB Output is correct
10 Correct 181 ms 1135188 KB Output is correct
11 Correct 181 ms 1135784 KB Output is correct
12 Correct 585 ms 1135712 KB Output is correct
13 Correct 550 ms 1135580 KB Output is correct
14 Correct 93 ms 993620 KB Output is correct
15 Correct 225 ms 1135800 KB Output is correct
16 Correct 188 ms 1136036 KB Output is correct
17 Correct 162 ms 1135424 KB Output is correct
18 Correct 167 ms 1135588 KB Output is correct
19 Correct 190 ms 1135564 KB Output is correct
20 Correct 180 ms 1135184 KB Output is correct
21 Correct 198 ms 1135640 KB Output is correct
22 Correct 215 ms 1135296 KB Output is correct
23 Correct 200 ms 1135420 KB Output is correct
24 Correct 267 ms 1135688 KB Output is correct

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 993648 KB Output is correct
2 Correct 189 ms 1134152 KB Output is correct
3 Correct 199 ms 1134396 KB Output is correct
4 Correct 157 ms 1135440 KB Output is correct
5 Correct 163 ms 1135428 KB Output is correct
6 Correct 189 ms 1135668 KB Output is correct
7 Correct 195 ms 1135576 KB Output is correct
8 Correct 173 ms 1135304 KB Output is correct
9 Correct 178 ms 1135384 KB Output is correct
10 Correct 181 ms 1135188 KB Output is correct
11 Correct 181 ms 1135784 KB Output is correct
12 Correct 585 ms 1135712 KB Output is correct
13 Correct 550 ms 1135580 KB Output is correct
14 Correct 93 ms 993620 KB Output is correct
15 Correct 225 ms 1135800 KB Output is correct
16 Correct 188 ms 1136036 KB Output is correct
17 Correct 162 ms 1135424 KB Output is correct
18 Correct 167 ms 1135588 KB Output is correct
19 Correct 190 ms 1135564 KB Output is correct
20 Correct 180 ms 1135184 KB Output is correct
21 Correct 198 ms 1135640 KB Output is correct
22 Correct 215 ms 1135296 KB Output is correct
23 Correct 200 ms 1135420 KB Output is correct
24 Correct 267 ms 1135688 KB Output is correct
25 Correct 140 ms 1134860 KB Output is correct
26 Correct 193 ms 1135940 KB Output is correct
27 Correct 173 ms 1135336 KB Output is correct
28 Correct 304 ms 1135348 KB Output is correct
29 Correct 206 ms 1136192 KB Output is correct
30 Correct 207 ms 1135440 KB Output is correct
31 Correct 194 ms 1135188 KB Output is correct
32 Correct 215 ms 1135612 KB Output is correct
33 Correct 417 ms 1135520 KB Output is correct
34 Correct 1078 ms 1135640 KB Output is correct
35 Correct 484 ms 1135408 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 993620 KB Output is correct
2 Correct 432 ms 1389888 KB Output is correct
3 Correct 414 ms 1389652 KB Output is correct
4 Correct 428 ms 1389908 KB Output is correct
5 Correct 471 ms 1389652 KB Output is correct
6 Correct 454 ms 1389648 KB Output is correct
7 Correct 471 ms 1389740 KB Output is correct
8 Correct 93 ms 993648 KB Output is correct
9 Correct 189 ms 1134152 KB Output is correct
10 Correct 199 ms 1134396 KB Output is correct
11 Correct 157 ms 1135440 KB Output is correct
12 Correct 163 ms 1135428 KB Output is correct
13 Correct 189 ms 1135668 KB Output is correct
14 Correct 195 ms 1135576 KB Output is correct
15 Correct 173 ms 1135304 KB Output is correct
16 Correct 178 ms 1135384 KB Output is correct
17 Correct 181 ms 1135188 KB Output is correct
18 Correct 181 ms 1135784 KB Output is correct
19 Correct 585 ms 1135712 KB Output is correct
20 Correct 550 ms 1135580 KB Output is correct
21 Correct 93 ms 993620 KB Output is correct
22 Correct 225 ms 1135800 KB Output is correct
23 Correct 188 ms 1136036 KB Output is correct
24 Correct 162 ms 1135424 KB Output is correct
25 Correct 167 ms 1135588 KB Output is correct
26 Correct 190 ms 1135564 KB Output is correct
27 Correct 180 ms 1135184 KB Output is correct
28 Correct 198 ms 1135640 KB Output is correct
29 Correct 215 ms 1135296 KB Output is correct
30 Correct 200 ms 1135420 KB Output is correct
31 Correct 267 ms 1135688 KB Output is correct
32 Correct 140 ms 1134860 KB Output is correct
33 Correct 193 ms 1135940 KB Output is correct
34 Correct 173 ms 1135336 KB Output is correct
35 Correct 304 ms 1135348 KB Output is correct
36 Correct 206 ms 1136192 KB Output is correct
37 Correct 207 ms 1135440 KB Output is correct
38 Correct 194 ms 1135188 KB Output is correct
39 Correct 215 ms 1135612 KB Output is correct
40 Correct 417 ms 1135520 KB Output is correct
41 Correct 1078 ms 1135640 KB Output is correct
42 Correct 484 ms 1135408 KB Output is correct
43 Correct 92 ms 991312 KB Output is correct
44 Correct 101 ms 993620 KB Output is correct
45 Correct 590 ms 1401516 KB Output is correct
46 Correct 434 ms 1396820 KB Output is correct
47 Correct 439 ms 1397428 KB Output is correct
48 Correct 544 ms 1399380 KB Output is correct
49 Correct 577 ms 1401464 KB Output is correct
50 Correct 494 ms 1399088 KB Output is correct
51 Correct 425 ms 1399344 KB Output is correct
52 Correct 443 ms 1397076 KB Output is correct
53 Correct 753 ms 1397920 KB Output is correct
54 Correct 1287 ms 1398992 KB Output is correct
55 Correct 1603 ms 1397932 KB Output is correct
56 Correct 1656 ms 1398816 KB Output is correct
57 Correct 1036 ms 1398520 KB Output is correct
58 Correct 1314 ms 1397160 KB Output is correct
59 Correct 1163 ms 1394940 KB Output is correct
60 Correct 2395 ms 1390372 KB Output is correct
61 Correct 2246 ms 1389648 KB Output is correct