Submission #1049559

#TimeUsernameProblemLanguageResultExecution timeMemory
1049559vjudge1Dungeons Game (IOI21_dungeons)C++17
11 / 100
7064 ms35868 KiB
#include "dungeons.h"
#include <vector>
int L[50100],W[50100],N,S[50100],P[50100];
void init(int n, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) {
	N=n;
	for(int i=0;i<n;i++)
		L[i]=l[i],W[i]=w[i],S[i]=s[i],P[i]=p[i];
}

long long simulate(int x, int z) {
	while(x<N)
		if(z<S[x])
			z+=P[x],x=L[x];
		else z+=S[x],x=W[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...