제출 #1009467

#제출 시각아이디문제언어결과실행 시간메모리
1009467induwara16던전 (IOI21_dungeons)C++17
0 / 100
4444 ms3552 KiB
#include "dungeons.h" #include <bits/stdc++.h> using namespace std; typedef string str; typedef vector<int> vi; int n; vi s, p, w, l; void init(int n1, std::vector<int> s1, std::vector<int> p1, std::vector<int> w1, std::vector<int> l1) { n = n1; s = s1; p = p1; w = w1; l = l1; } long long simulate(int x, int z) { if (z >= s[0]) { queue<int> q; q.push(x); while (!q.empty()) { int a = q.front(); q.pop(); if (a != n) { z += s[0]; q.push(w[a]); } } return z; } if (x == n) return z; // if (z >= s[x]) // return simulate(w[x], z + s[x]); // else return simulate(l[x], z + p[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...