제출 #437157

#제출 시각아이디문제언어결과실행 시간메모리
437157MilosMilutinovic던전 (IOI21_dungeons)C++17
11 / 100
7089 ms19768 KiB
#include <bits/stdc++.h> using namespace std; const int maxn = 4e5 + 5; int n, s[maxn], p[maxn], w[maxn], l[maxn]; void init(int N, vector<int> S, vector<int> P, vector<int> W, 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) { 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...