Submission #1241096

#TimeUsernameProblemLanguageResultExecution timeMemory
1241096ZeroCoolDungeons Game (IOI21_dungeons)C++20
11 / 100
7094 ms19896 KiB
#include "dungeons.h"
#include <vector>

const int N = 4e5 + 20;

int n;
int A[N], B[N];
int W[N], L[N];


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++)A[i] = s[i], B[i] = p[i], W[i] = w[i], L[i] = l[i];
}

long long simulate(int x, int z) {
	if(x == n)return z;
	if(z >= A[x])return simulate(W[x], z + A[x]);
	else return simulate(L[x], z + B[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...