Submission #1278196

#	Time	Username	Problem	Language	Result	Execution time	Memory
1278196		SabaKharebava	Festival (IOI25_festival)	C++20	5 / 100	64 ms	23088 KiB

festival

#include<bits/stdc++.h>

using namespace std;

#define pb push_back

vector<int> ans;

void solve(int ind, int &a, vector<int> &order, vector<int> &p, vector<int> &t) {
	if (ind >= order.size())
		return;

	if (a >= p[order[ind]]) {
		a = (a-p[order[ind]]) * t[order[ind]];
		ans.pb(order[ind]);
		solve(ind+1, a, order, p, t);
	} else {
		solve(ind+1, a, order, p, t);

		if (a >= p[order[ind]]) {
			a = (a-p[order[ind]]) * t[order[ind]];
			ans.pb(order[ind]);
		}
	}
}

vector<int> max_coupons(int a, vector<int> p, vector<int> t) {
	int n = p.size();
	
	vector<int> order;
	for (int i = 0; i < n; i++)
		order.pb(i);

	sort(order.begin(), order.end(), [&](int i, int j) {
		long long A = -p[i]*t[i]*t[j] - p[j]*t[j];
		long long B = -p[j]*t[i]*t[j] - p[i]*t[i];

		if (A == B)
			return p[i] < p[j];
		return A > B;
	});

	solve(0, a, order, p, t);

	return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 27
• Subtask 6: 0 / 16
• Subtask 7: 0 / 18