| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1334909 | activedeltorre | Dungeons Game (IOI21_dungeons) | C++20 | 7093 ms | 14628 KiB |
#include "dungeons.h"
#include <vector>
#include <cassert>
#include <cstdio>
int addw[50005];
int addl[50005];
int muchw[50005];
int muchl[50005];
int nmax;
void init(int n, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) {
nmax=n;
for(int i=1;i<=n;i++)
{
addw[i]=s[i-1];
addl[i]=p[i-1];
muchw[i]=w[i-1]+1;
muchl[i]=l[i-1]+1;
}
return;
}
long long simulate(int x, int z) {
long long z2=z;
x++;
while(x!=(nmax+1))
{
if(z2>=addw[x])
{
z2=z2+addw[x];
x=muchw[x];
}
else
{
z2=z2+addl[x];
x=muchl[x];
}
}
return z2;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
