제출 #1251596

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1251596		Zicrus	Festival (IOI25_festival)	C++20	0 / 100	22 ms	3524 KiB

festival

#include <bits/stdc++.h>
#include "festival.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define all(v) v.begin(), v.end()
constexpr ll inf = 1ll << 62ll;
mt19937 mt(34056237);
ll _ = 0;

vector<int> max_coupons(int A, vector<int> price, vector<int> type) {
	ll n = price.size();
	ll mx_type = *max_element(all(type));
	vector<vector<pll>> coups(mx_type);
	for (ll i = 0; i < n; i++) {
		coups[type[i]].emplace_back(price[i], i);
	}
	for (ll i = 0; i < mx_type; i++) sort(all(coups[i]));

	vector<int> res;
	for (ll i = 0; i < coups[0].size(); i++) {
		A -= coups[0][i].first;
		if (A < 0) break;
		res.push_back(coups[0][i].second);
	}
	return res;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 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