Submission #1265001

#	Time	Username	Problem	Language	Result	Execution time	Memory
1265001		imarn	축제 (IOI25_festival)	C++20	32 / 100	110 ms	15016 KiB

festival

//#include "festival.h"
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#define ll long long
#define ld long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vvi vector<vi>
#define ub(x,i) upper_bound(all(x),i)-x.begin()
#define lb(x,i) lower_bound(all(x),i)-x.begin()
#define sz(x) (ll)x.size()
#define cd complex<double>
#define t3 tuple<ll,ll,ll>
using namespace std;
const int mxn=2e5+5;
int n;
std::vector<int> max_coupons(int A, std::vector<int> P, std::vector<int> T) {
    priority_queue<pair<ld,pll>,vector<pair<ld,pll>>,greater<pair<ld,pll>>>qr;
    n=P.size();priority_queue<pll,vector<pll>,greater<pll>>ql;
    for(int i=0;i<n;i++)ql.push({P[i],i});
    while(!ql.empty()&&ql.top().f<=A){
        auto [p,t]=ql.top();ql.pop();
        if(T[t]==1)qr.push({1e18,{p,t}});
        else qr.push({(ld)p*T[t]/(T[t]-1),{p,t}});
    }ld cur=A;
    vector<int>ans;
    while(!qr.empty()){
        auto [p,t]=qr.top().s;qr.pop();
        //cout<<cur<<' '<<p<<'\n';
        if(cur<p)continue;
        ans.pb(t);cur=(cur-p)*T[t];
        while(!ql.empty()&&ql.top().f<=cur){
            auto [pp,tt]=ql.top();ql.pop();
            if(T[tt]==1)qr.push({1e18,{pp,tt}});
            else qr.push({(ld)pp*T[tt]/(T[tt]-1),{pp,tt}});
        }
    }
    return ans;
}
/*int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n,A;cin>>n>>A;
    vector<int>P(n),T(n);
    for(int i=0;i<n;i++)cin>>P[i]>>T[i];
    vector<int> x=max_coupons(A,P,T);
    for(auto it : x)cout<<it<<" ";
}*/

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