제출 #950267

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
950267		12345678	던전 (IOI21_dungeons)	C++17	0 / 100	39 ms	17472 KiB

dungeons

#include "dungeons.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=5e4+5, kx=16;

ll N, S, loc[nx][kx], c[nx][kx], dp[nx];

void init(int n, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) {
    N=n;
    S=s[0];
    for (int i=0; i<n; i++) c[i][0]=p[i], loc[i][0]=l[i];
    loc[n][0]=n;
    for (int i=1; i<kx; i++) for (int j=0; j<=n; j++) loc[j][i]=loc[loc[j][i-1]][i-1], c[j][i]=c[j][i-1]+c[loc[j][i-1]][i-1];
    //for (int i=0; i<kx; i++) for (int j=0; j<=n; j++) cout<<i<<' '<<j<<' '<<loc[j][i]<<' '<<c[j][i]<<'\n';
    for (int i=n-1; i>=0; i--) dp[i]=dp[w[i]]+s[i];
}

long long simulate(int x, int z) {
    if (z>=S) return z+dp[x];

    for (int i=kx-1; i>=0; i--) if (c[x][i]+z<S) z+=c[x][i], x=loc[x][i];
    z+=c[x][0];
    x=loc[x][0];
    return z+dp[x];
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 26
• Subtask 3: 0 / 13
• Subtask 4: 0 / 12
• Subtask 5: 0 / 27
• Subtask 6: 0 / 11