제출 #1342424

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1342424		aritro_	축제 (IOI25_festival)	C++20	27 / 100	65 ms	6964 KiB

festival

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

typedef long long ll;
#define endl '\n'
#define pb push_back
#define ff first
#define ss second
#define all(a) a.begin(),a.end()

int money;
vector<int> price;
vector<int> mul;

bool cmp(int i,int j){
    int op1=((money-price[i])*mul[i]-price[j])*mul[j];
    int op2=((money-price[j])*mul[j]-price[i])*mul[i];
    return op1>op2;
}

vector<int> max_coupons(int s, vector<int> P,vector<int> T){
    int n=P.size();
    money=s,price=P,mul=T;
    vector<int> v(n);
    for(int i=0;i<n;i++) v[i]=i;
    sort(v.begin(), v.end(),cmp);
    vector<int>ans;
    for(auto u:v){
        if(money<P[u]) break;
        ans.pb(u);
        money-=P[u];
        money*=T[u];
    }
    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