Submission #524699

#	Time	Username	Problem	Language	Result	Execution time	Memory
524699		LucaDantas	Dungeons Game (IOI21_dungeons)	C++17	11 / 100	7087 ms	26648 KiB

dungeons

// brutao subtask 1
#include "dungeons.h"
#include <vector>

constexpr int maxn = 4e5+10;

int s[maxn], p[maxn], w[maxn], l[maxn], 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++)
		s[i] = S[i];
	for(int i = 0; i < n; i++)
		p[i] = P[i];
	for(int i = 0; i < n; i++)
		w[i] = W[i];
	for(int i = 0; i < n; i++)
		l[i] = L[i];
	return;
}

long long ans = 0;

void dfs(int u, long long val) {
	if(u == n) return (void)(ans = val);
	if(val >= s[u]) dfs(w[u], val + s[u]);
	else dfs(l[u], val + p[u]);
}

long long simulate(int x, int z) {
	dfs(x, z);
	return ans;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 26
• Subtask 3: 0 / 13
• Subtask 4: 0 / 12
• Subtask 5: 0 / 27
• Subtask 6: 0 / 11