제출 #443425

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
443425		azberjibiou	던전 (IOI21_dungeons)	C++17	11 / 100	7047 ms	33060 KiB

dungeons

#include "dungeons.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fir first
#define sec second
#define pii pair<int, int>
#define pll pair<ll, ll>
const int mxN=50050;
const ll INF=1000000000;
ll N, K;
ll S[mxN], P[mxN], W[mxN], L[mxN];

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], P[i]=p[i], W[i]=w[i], L[i]=l[i];
}

long long simulate(int x, int z) {
    if(x==N)    return z;
    if(z>=S[x]) return simulate(W[x], z+S[x]);
    else    return simulate(L[x], z+P[x]);
}

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