Submission #1263624

#	Time	Username	Problem	Language	Result	Execution time	Memory
1263624		gelastropod	축제 (IOI25_festival)	C++20	5 / 100	1095 ms	7608 KiB

festival

#include "festival.h"

#include <bits/stdc++.h>
using namespace std;

#define int long long

bool comp(pair<int, pair<int, int>> a, pair<int, pair<int, int>> b) {
	return (long long)a.second.first * a.second.second * b.second.second + (long long)b.second.first * b.second.second <
		(long long)b.second.first * a.second.second * b.second.second + (long long)a.second.first * a.second.second;
}

std::vector<signed> max_coupons(signed A, std::vector<signed> P, std::vector<signed> T) {
	vector<vector<pair<int, int>>> vals(4, vector<pair<int, int>>());
	for (int i = 0; i < P.size(); i++) {
		vals[T[i] - 1].push_back({ P[i], i });
	}
	vals[0].push_back({ 0, -1 });
	for (int i = 0; i < 4; i++) sort(vals[i].begin(), vals[i].end());
	for (int i = 1; i < vals[0].size(); i++) vals[0][i].first += vals[0][i - 1].first;
	vector<signed> vans;
	int ans = 0;
	for (int i = 0; i <= vals[1].size(); i++) {
		for (int j = 0; j <= vals[2].size(); j++) {
			for (int k = 0; k <= vals[3].size(); k++) {
				vector<pair<int, pair<int, int>>> valss;
				for (int l = 0; l < i; l++) valss.push_back({ vals[1][l].second, {vals[1][l].first, 2} });
				for (int l = 0; l < j; l++) valss.push_back({ vals[2][l].second, {vals[2][l].first, 3} });
				for (int l = 0; l < k; l++) valss.push_back({ vals[3][l].second, {vals[3][l].first, 4} });
				sort(valss.begin(), valss.end(), comp);
				int _A = A;
				int nans = 0, bestI = 0;
				for (int i = 0; i <= valss.size(); i++) {
					auto iter = upper_bound(vals[0].begin(), vals[0].end(), make_pair(_A, (int)INT_MAX));
					iter--;
					if (nans < i + (iter - vals[0].begin())) {
						nans = i + (iter - vals[0].begin());
						bestI = i;
					}
					if (i != valss.size()) _A = valss[i].second.second * (_A - valss[i].second.first);
					if (_A > 1000000000000000 && i + j + k + vals[0].size() > ans) {
						vans.clear();
						ans = i + j + k + vals[0].size();
						for (int i = 0; i < valss.size(); i++) vans.push_back(valss[i].first);
						for (int i = 1; i < vals[0].size(); i++) vans.push_back(vals[0][i].second);
						break;
					}
					if (_A < 0) break;
				}
				if (ans < nans) {
					vans.clear();
					ans = nans;
					for (int i = 0; i < bestI; i++) vans.push_back(valss[i].first);
					for (int i = bestI; i < ans; i++) vans.push_back(vals[0][i + 1 - bestI].second);
				}
			}
		}
	}
	return vans;
}

• 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