제출 #610984

#제출 시각아이디문제언어결과실행 시간메모리
610984Ozy던전 (IOI21_dungeons)C++17
11 / 100
7053 ms20636 KiB
#include "dungeons.h" #include <bits/stdc++.h> using namespace std; #define lli long long int #define rep(i,a,b) for (int i = (a); i <= (b); i++) #define repa(i,a,b) for (int i = (a); i >= (b); i--) lli N; vector<int> S,P,W,L; void init(int n, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) { swap(S,s); swap(W,w); swap(L,l); swap(p,P); N = n; } long long simulate(int x, int z) { while (x != N) { if (z >= S[x]) { z += S[x]; x = W[x]; } else { z += P[x]; x = L[x]; } } return z; }
#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...