Submission #1336999

#	Time	Username	Problem	Language	Result	Execution time	Memory
1336999		aritro_	축제 (IOI25_festival)	C++20	5 / 100	199 ms	15884 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()

vector<int> max_coupons(int s,vector<int>p,vector<int>t){
    int n=p.size();
    vector<pair<pair<int,int>,int>>a(n);
    for(int i=0;i<n;i++) a[i]={{p[i],t[i]},i};
    sort(all(a));
    vector<int>ans;
    int money=s;
    map<int,int> bought;
    for(int i=0;i<n;i++){
        if(a[i].ff.ss==1) continue;
        if(money<(2*a[i].ff.ff)) continue;
        money=(money-a[i].ff.ff)*a[i].ff.ss;
        ans.pb(a[i].ss);
        bought[a[i].ss]=1;
    }
    for(int i=0;i<n;i++){
        if(bought[a[i].ss]) continue;
        if(a[i].ff.ff>money) continue;
        money=(money-a[i].ff.ff)*a[i].ff.ss;
        ans.pb(a[i].ss);
        bought[a[i].ss]=1;
    }
    return ans;
}

• 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