# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1009472 | induwara16 | Dungeons Game (IOI21_dungeons) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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, long long 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]);
}