제출 #444067

#제출 시각아이디문제언어결과실행 시간메모리
444067leinad2던전 (IOI21_dungeons)C++17
11 / 100
7084 ms26652 KiB
#include "dungeons.h" #include<bits/stdc++.h> using namespace std; int N; vector<int>S, P, W, L; void init(int n, vector<int>s, vector<int>p, vector<int>w, vector<int>l) { N=n;S=s;P=p;W=w;L=l; } 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...