제출 #1258616

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1258616		allin27x	축제 (IOI25_festival)	C++20	27 / 100	62 ms	9032 KiB

festival

#include "festival.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long

const int INF = 3e15;

int tk;

struct coupon{
	int p, t, idx;
	void apply(){
		tk -= p; tk *= t;
		if (tk > INF) tk = INF;
		if (tk < 0) tk = -1;
	}
};

bool comp(coupon &a, coupon &b){
	if (a.t == 1 && b.t == 1) return a.p < b.p;
	return a.p * a.t * (b.t - 1) < b.p * b.t * (a.t - 1);
}
vector<signed> max_coupons(signed A, vector<signed> P, vector<signed> T) {
	int n = P.size(); 
	vector<coupon> cp(n);
	for (int i=0; i<n; i++) cp[i] = {P[i], T[i], i};
	sort(cp.begin(), cp.end(), comp);
	vector<signed> ans(n); for (int i=0; i<n; i++) ans[i] = cp[i].idx;
	return ans;
}

• 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