Submission #1081769

#	Time	Username	Problem	Language	Result	Execution time	Memory
1081769		raphael_heuchl	Dungeons Game (IOI21_dungeons)	C++17	11 / 100	7068 ms	26664 KiB

dungeons

#include "dungeons.h"
#include <vector>

struct Room
{
	int s, p, w, l;
};

int N;
std::vector<Room> dungs;

void init(int n, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l)
{
	N = n;
	dungs.resize(n);
	for (int i = 0; i < n; ++i)
		dungs[i] = {s[i], p[i], w[i], l[i]};
}

long long simulate(int x, int z)
{
	if (x == N)
		return z;
	if (z >= dungs[x].s)
		return simulate(dungs[x].w, z + dungs[x].s);
	return simulate(dungs[x].l, z + dungs[x].p);
}

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