Submission #1048392

#TimeUsernameProblemLanguageResultExecution timeMemory
1048392DorostWef던전 (IOI21_dungeons)C++17
11 / 100
7092 ms27956 KiB
#include "dungeons.h" #include <bits/stdc++.h> using namespace std; const int N = 500023; int s[N], p[N], w[N], l[N], n; void init(int nn, std::vector<int> ss, std::vector<int> pp, std::vector<int> ww, std::vector<int> ll) { n = nn; for (int i = 0; i < n; i++) { s[i] = ss[i]; p[i] = pp[i]; w[i] = ww[i]; l[i] = ll[i]; } return; } 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...