Submission #1255970

#	Time	Username	Problem	Language	Result	Execution time	Memory
1255970		farhan11679	축제 (IOI25_festival)	C++20	0 / 100	100 ms	15788 KiB

festival

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

vector<int> max_coupons(int A, vector<int> P, vector<int> T) {
    int N = P.size();
    vector<int> res;
    vector<bool> used(N, false);

    using PLLI = pair<long long,int>;
    priority_queue<PLLI, vector<PLLI>, greater<>> locked; // price ascending
    priority_queue<tuple<int,long long,int>> avail;       // (multiplier, -price, index)

    for (int i = 0; i < N; i++) locked.push({P[i], i});
    long long tokens = A;

    while (true) {
        // unlock newly affordable
        while (!locked.empty() && locked.top().first <= tokens) {
            int idx = locked.top().second;
            locked.pop();
            avail.push({T[idx], -P[idx], idx});
        }
        if (avail.empty()) break;

        // pick best
        auto [t, negp, idx] = avail.top();
        avail.pop();
        if (used[idx]) continue;
        used[idx] = true;

        tokens = (tokens - P[idx]) * T[idx];
        res.push_back(idx);
    }
    return res;
}

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