Submission #1252807

#	Time	Username	Problem	Language	Result	Execution time	Memory
1252807		TIN	Souvenirs (IOI25_souvenirs)	C++20	7 / 100	11 ms	400 KiB

souvenirs

#include "souvenirs.h"
#include <utility>
#include <vector>

void buy_souvenirs(int N, long long P0) {
	// std::pair<std::vector<int>, long long> res = transaction(3);
	if (N == 2) {
		std::pair<std::vector<int>, long long> res = transaction(P0 - 1);
		return;
	}
	std::vector<int> p(N, 0);
	std::vector<int> cnt(N, 0);
	p[0] = P0;
	for (int i = 1; i < N; i++) {
		if (cnt[i] == i) continue;
		if (i + 1 == N) {
			while (cnt[i] < i) {
				std::pair<std::vector<int>, long long> res = transaction(p[i - 1] - 1);
				++cnt[i];
			}
			return;
		}
		std::pair<std::vector<int>, long long> res = transaction(p[i - 1] - 1);
		cnt[i]++;
		p[i] = p[i - 1] - 1;
		if ((int) res.first.size() > 1 || res.second > 0) p[i]--;
		if ((int) res.first.size() > 1) cnt[N - 1]++;
		while (cnt[i] < i) {
			std::pair<std::vector<int>, long long> res = transaction(p[i]);
			++cnt[i];
		}
	}
	return;
}

• Subtask 0: 0 / 0
• Subtask 1: 4 / 4
• Subtask 2: 3 / 3
• Subtask 3: 0 / 14
• Subtask 4: 0 / 18
• Subtask 5: 0 / 28
• Subtask 6: 0 / 33