Submission #1195823

#TimeUsernameProblemLanguageResultExecution timeMemory
1195823Nonoze던전 (IOI21_dungeons)C++20
11 / 100
7094 ms29256 KiB
#include "dungeons.h" #include <bits/stdc++.h> using namespace std; #define int long long #define pb push_back vector<int> s, p, w, l; int n; void init(signed _n, vector<signed> _s, vector<signed> _p, vector<signed> _w, vector<signed> _l) { n=_n; for (auto &u: _s) s.pb(u); for (auto &u: _p) p.pb(u); for (auto &u: _w) w.pb(u); for (auto &u: _l) l.pb(u); return; } int simulate(signed x, signed z) { int 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...