제출 #1217966

#제출 시각아이디문제언어결과실행 시간메모리
1217966hengliaoDungeons Game (IOI21_dungeons)C++20
11 / 100
7089 ms26252 KiB
#include "dungeons.h"
#include<bits/stdc++.h>
using namespace std;

#define F first
#define S second
#define pb push_back
#define vll vector<ll>
#define pll pair<ll, ll>

typedef long long ll;

namespace{
    const ll mxN=4e5+5;

    ll n;
    ll s[mxN], p[mxN], w[mxN], l[mxN];
}

void init(int N, vector<int> S, vector<int> P, vector<int> W, vector<int> L) {
	n=N;
    for(ll 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) {
	ll ans=z;
    while(x!=n){
        if(ans>=s[x]){
            ans+=s[x];
            x=w[x];
        }
        else{
            ans+=p[x];
            x=l[x];
        }
    }
    return ans;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...