#include<bits/stdc++.h>
#include "dungeons.h"
#include <vector>
using namespace std;
typedef long long ll;
vector<ll>P,S,W,L;
int N;
void init(int n, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) {
N=n;
P.resize(n);
S.resize(n);
W.resize(n);
L.resize(n);
for(int i=0;i<N;i++){
P[i]=p[i];
S[i]=s[i];
W[i]=w[i];
L[i]=l[i];
}
return;
}
long long simulate(int x, int z) {
while(x!=N){
if(z>=S[x]){
z+=S[x];
x=W[x];
}
else{
z+=P[x];
x=L[x];
}
}
return z;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |