제출 #445269

#제출 시각아이디문제언어결과실행 시간메모리
445269BaraaArmoush던전 (IOI21_dungeons)C++17
11 / 100
7035 ms34656 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 50500; int n; int s[N]; int p[N]; int w[N]; int l[N]; void init(int n, vector<int> S, vector<int> P, vector<int> W, vector<int> L) { ::n = n; copy(S.begin(), S.end(), s); copy(P.begin(), P.end(), p); copy(W.begin(), W.end(), w); copy(L.begin(), L.end(), l); } ll simulate(int i, int z) { ll x = z; while (i < n) { if (x >= s[i]) { x += s[i]; i = w[i]; } else { x += p[i]; i = l[i]; } } return x; }
#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...