# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
914481 | Wansur | Dungeons Game (IOI21_dungeons) | C++17 | 0 ms | 0 KiB |
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<bits/stdc++.h>
#define ent '\n'
typedef long long ll;
using namespace std;
const int mx=4e5+12;
int s[mx];
int p[mx];
int w[mx];
int l[mx];
int N,m,k;
void init(int M, vector<int> S, vector<int> P, vector<int> W, vector<int> L){
N=M;
int n=N;
for(int i=0;i<n;i++){
s[i]=S[i];
w[i]=W[i];
l[i]=L[i];
p[i]=P[i];
}
}
long long simulate(int pos, ll x){
int n=N;
while(pos<n){
if(x>=s[pos]){
x+=s[pos];
pos=w[pos];
}
else{
x+=p[pos];
pos=l[pos];
}
}
return x;
}