This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "dungeons.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
vector<int>s,p,w,l;
void init(int N, vector<int> S,vector<int> P,vector<int> W,vector<int> L) {
n = N;
s=S;
p=P;
w=W;
l=L;
}
ll simulate(int i, int curr) {
while(i != n){
if(curr >= s[i]){
curr+=s[i];
i=w[i];
}
else{
curr+=p[i];
i=l[i];
}
}
return curr;
}
# | 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... |