Submission #441115

#	Time	Username	Problem	Language	Result	Execution time	Memory
441115		Quang	Dungeons Game (IOI21_dungeons)	C++17	0 / 100	2 ms	332 KiB

dungeons

#include "dungeons.h"
#include <vector>
#include <bits/stdc++.h>

using namespace std;

set<int> values;
bool all_equal = true;
int n;
vector<int> s, p, w, l;

void init(int n, std::vector<int> S, std::vector<int> P, std::vector<int> W, std::vector<int> L) {
	s = S;
	p = P;
	w = W;
	l = L;
	n = s.size();

	set<int> values;
	for (auto u : s) {
		values.insert(u);
	}
	for (int i = 0; i < n; i++) {
		all_equal &= (s[i] == p[i]);
	}

	if (values.size() <= 5) {

	}
}

long long SolveAllEqual(int x, int z) {
	long long res = z;
	while (x != n) {
		if (res >= s[x]) {
			res += s[x];
			x = w[x];
		} else {
			res += p[x];
			x = l[x];
		}
	}
	return res;
}

long long SolveNaive() {
	return 0;
}

long long simulate(int x, int z) {
	if (all_equal) return SolveAllEqual(x, z);

	return SolveNaive();
}

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