Submission #1179530

#TimeUsernameProblemLanguageResultExecution timeMemory
1179530Gr1sen던전 (IOI21_dungeons)C++20
11 / 100
7093 ms19784 KiB
#include "dungeons.h" #include <vector> #include<iomanip> #include<algorithm> using namespace std; #define ll long long #define vi vector<int> int n; vi S, P, W, L; void init(int N, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) { n = N; S = s; P = p; W = w; L = l; return; } long long simulate(int x, int z) { while (x != n) { if (S[x] <= z) { z += S[x]; x = W[x]; continue; } 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...