Submission #856448

#TimeUsernameProblemLanguageResultExecution timeMemory
856448andrei_boacaDungeons Game (IOI21_dungeons)C++17
11 / 100
7090 ms26188 KiB
#include "dungeons.h" #include <vector> #include <bits/stdc++.h> //#include "grader.cpp" using namespace std; typedef long long ll; ll n,s[400005],p[400005],w[400005],l[400005]; 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) { ll rez=z; while(x!=n) { if(rez>=s[x]) { rez+=s[x]; x=w[x]; } else { rez+=p[x]; x=l[x]; } } return rez; }
#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...