제출 #618999

#제출 시각아이디문제언어결과실행 시간메모리
618999KLPP던전 (IOI21_dungeons)C++17
11 / 100
7081 ms19840 KiB
#include "dungeons.h" #include <vector> #include<bits/stdc++.h> using namespace std; typedef long long int lld; #define rep(i,a,b) for(int i=a;i<b;i++) #define trav(a,v) for(auto a:v) int S[1000000]; int P[1000000]; int W[1000000]; int L[1000000]; int N; void init(int n, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) { N=n; rep(i,0,n){ S[i]=s[i]; P[i]=p[i]; W[i]=w[i]; L[i]=l[i]; } } long long simulate(int x, int z) { if(x==N)return z; if(z<S[x])return simulate(L[x],z+P[x]); return simulate(W[x],z+S[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...