Submission #1337296

#	Time	Username	Problem	Language	Result	Execution time	Memory
1337296		vladilius	축제 (IOI25_festival)	C++20	27 / 100	61 ms	5748 KiB

festival

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define pb push_back
#define ff first
#define ss second

vector<int> max_coupons(int AA, vector<int> p, vector<int> t){
    ll A = AA;
    int n = (int) p.size();
    
    auto cmp = [&](int i, int j){
        return (1LL * p[i] * t[i] * t[j] + 1LL * p[j] * t[j]) < (1LL * p[j] * t[i] * t[j] + 1LL * p[i] * t[i]);
    };
    
    vector<int> f;
    for (int i = 0; i < n; i++) f.pb(i);
    
    sort(f.begin(), f.end(), cmp);
    
    vector<int> out;
    
    for (int i: f){
        ll f = (A - p[i]) * t[i];
        if (A >= p[i]){
            A = f;
            out.pb(i);
        }
    }
    
    return out;
}

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