제출 #1195778

#제출 시각아이디문제언어결과실행 시간메모리
1195778belgianbot던전 (IOI21_dungeons)C++20
11 / 100
7093 ms19784 KiB
#include "dungeons.h" #include <bits/stdc++.h> using namespace std; const int MAX_N = 50000, MAX_P = 10000; vector<int> s,p,w,l; int n; void init(int nn, vector<int> ss, vector<int> pp, vector<int> ww, vector<int> ll) { s = ss; p = pp; w = ww; l = ll; n = nn; return; } long long simulate(int x, int z) { int pos = x; while( pos != n) { if (z >= s[pos]) { z += s[pos]; pos = w[pos]; } else { z += p[pos]; pos = l[pos]; } } 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...