Submission #1254702

#	Time	Username	Problem	Language	Result	Execution time	Memory
1254702		fasterthanyou	축제 (IOI25_festival)	C++20	5 / 100	60 ms	5312 KiB

festival

#include <vector>
#include <algorithm>
using namespace std;

vector<int> max_coupons(int A, vector<int> P, vector<int> T) {
    int N = P.size();
    vector<int> indices(N);
    for (int i = 0; i < N; ++i) {
        indices[i] = i;
    }
    
    // Sort indices based on P[i]/T[i] ascending
    sort(indices.begin(), indices.end(), [&P, &T](int a, int b) {
        return (long long)P[a] * T[b] < (long long)P[b] * T[a];
    });
    
    vector<int> result;
    long long current = A;
    for (int idx : indices) {
        if (current >= P[idx]) {
            current = (current - P[idx]) * T[idx];
            result.push_back(idx);
        }
    }
    
    return result;
}

• 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