제출 #488149

#제출 시각아이디문제언어결과실행 시간메모리
4881498e7던전 (IOI21_dungeons)C++17
11 / 100
7038 ms19780 KiB
//Challenge: Accepted #include "dungeons.h" #include <iostream> #include <algorithm> #include <vector> #include <utility> using namespace std; void debug(){cout << endl;} template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);} template<class T> void pary(T l, T r) { while (l != r) cout << *l << " ", l++; cout << endl; } #define ll long long #define maxn 100005 #define pii pair<int, int> #define ff first #define ss second #define io ios_base::sync_with_stdio(0);cin.tie(0); int n; vector<int> s, p, w, l; void init(int nv, vector<int> sv, vector<int> pv, vector<int> wv, vector<int> lv) { n = nv; s = sv, p = pv, w = wv, l = lv; } long long simulate(int x, int z) { ll ans = z; while (x != n) { if (ans >= s[x]) ans += s[x], x = w[x]; else ans += p[x], x = l[x]; } return ans; } /* 3 2 2 6 9 3 1 2 2 2 3 1 0 1 0 1 2 3 */
#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...