Submission #1253136

#	Time	Username	Problem	Language	Result	Execution time	Memory
1253136		anfi	Festival (IOI25_festival)	C++20	0 / 100	75 ms	10420 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<bool> used(N, false); 
    vector<int> result;

    priority_queue<tuple<int, int, int>> pq;

    for (int i = 0; i < N; ++i) {
        pq.emplace(-T[i], P[i], i);
    }

    int token = A;

    while (true) {
        bool bought = false;
        priority_queue<tuple<int, int, int>> temp;

        while (!pq.empty()) {
            auto [negT, price, idx] = pq.top(); pq.pop();

            if (used[idx]) continue; 

            if (price <= token) {
                token = (token - price) * T[idx];
                result.push_back(idx);
                used[idx] = true;
                bought = true;
                break;
            } else {
                temp.emplace(negT, price, idx);
            }
        }

        while (!temp.empty()) {
            pq.push(temp.top());
            temp.pop();
        }

        if (!bought) break; 
    }

    return result;
}

• 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