Submission #1282041

#	Time	Username	Problem	Language	Result	Execution time	Memory
1282041		nikakh	축제 (IOI25_festival)	C++20	27 / 100	65 ms	10052 KiB

festival

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

vector<int> max_coupons(int A, vector<int> P, vector<int> T){
	vector<array<ll, 3>> v;
	int n = P.size();
	for(int i = 0; i < n; i++){
		v.push_back({P[i], T[i], i});
	}
	sort(v.begin(), v.end(), [A](array<ll, 3> &F, array<ll, 3> &S){
		ll a = F[0], at = F[1], b = S[0], bt = S[1];
		return (((A - a) * at) - b) * bt > (((A - b) * bt) - a) * at;
	});
	vector<int> R;
	for(int i = 0; i < n; i++){
		if(A < v[i][0]) break;
		A = (A - v[i][0]) * v[i][1];
		R.push_back(v[i][2]);
	}
	return R;
}

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