Submission #1258806

#	Time	Username	Problem	Language	Result	Execution time	Memory
1258806		am_aadvik	Festival (IOI25_festival)	C++20	24 / 100	57 ms	9396 KiB

festival

#include <iostream>
#include<vector>
#include<algorithm>
#define int long long
using namespace std;

vector<int32_t> max_coupons(int32_t a, vector<int32_t> p, vector<int32_t> t) {
	int n = p.size(), k = a;
	vector<pair<int, int32_t>> f, s;
	for (int i = 0; i < n; ++i)
		if (t[i] == 1) f.push_back({ p[i], i });
		else s.push_back({ p[i], i });
	sort(f.begin(), f.end());
	sort(s.begin(), s.end());
	for (int i = 1; i < f.size(); ++i)
		f[i].first += f[i - 1].first;
	int mx = 0, m1 = 0, m2 = 0;
	for (int i = 0; i <= s.size(); ++i) {
		if (k < 0) break;
		int l = 0, r = f.size() - 1, j = -1;
		while (l <= r) {
			int m = (l + r) / 2;
			if (f[m].first <= k) j = m, l = m + 1;
			else r = m - 1;
		}
		if ((i + j + 1) > mx)
			mx = i + j + 1, m1 = j + 1, m2 = i;
		if(i < s.size()) k = (k - s[i].first) * 2;
		if (k >= 1e17) { m1 = f.size(), m2 = s.size(); break; }
	}
	vector<int32_t> ans;
	for (int i = 0; i < m2; ++i) ans.push_back(s[i].second);
	for (int i = 0; i < m1; ++i) ans.push_back(f[i].second);
	return ans;
}/*
int32_t main() {
	vector<int32_t> res = max_coupons(13, { 4, 500, 8, 14 }, { 1, 1, 1, 1 });
	for (auto x : res) cout << x << " ";
}*/

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