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 <vector>
using namespace std;
int N;
vector<int> S, P, W, L;
void init(int n, vector<int> s, vector<int> p, vector<int> w, vector<int> l)
{
N = n; //number of opponents
S = s; //strength of opponent i == strength increase upon winning
P = p; //strength increase upon losing
W = w; //winning move
L = l; //losing move
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 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... |