제출 #1068032

#제출 시각아이디문제언어결과실행 시간메모리
1068032RaresFelix던전 (IOI21_dungeons)C++17
11 / 100
7095 ms26776 KiB
#include "dungeons.h" #include <bits/stdc++.h> using namespace std; using vi = vector<int>; using ll = long long; int n; vi s, p, w, l; void init(int n, vi s, vi p, vi w, vi l) { ::n = n; ::s = s; ::p = p; ::w = w; ::l = l; } long long simulate(int x, int z) { while(x < n) { if(s[x] <= z) { 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...