Submission #1283018

#	Time	Username	Problem	Language	Result	Execution time	Memory
1283018		takoshanava	Festival (IOI25_festival)	C++20	100 / 100	206 ms	244900 KiB

festival

#include <bits/stdc++.h>
#include "festival.h"
using namespace std;
#define ll long long
#define pb push_back
const long long INF = 1e18, MX = 2e14, L = 71;;


vector<int> max_coupons(int AA, vector <int> P, vector <int> T){
    ll A = AA;
    vector<array<ll, 3>> a;
    ll n = P.size();
    vector <array<ll, 2>> b;
    for (ll i = 0; i < n; i++){
        if (T[i] != 1){
            a.pb({P[i], T[i], i});
        } else {
            b.pb({P[i], i});
        }
    }
    
    sort(a.begin(), a.end(), [&](array <ll, 3> b, array <ll, 3> c){
        ll v1 = -b[0] * b[1] * c[1] - c[0] * c[1];
        ll v2 = -c[0] * c[1] * b[1] - b[0] * b[1];
        return v1 > v2;
    });
    
    sort(b.begin(), b.end());
    
    ll m = a.size();
    ll k = b.size();
    
    const ll MX = 2e14;
    const ll L = 71;
    
    vector<vector<ll>> dp(n + 1, vector<ll>(L, -INF));
    vector<vector<ll>> par(n + 1, vector<ll>(L, -1));
    
    ll ptr = 0;
    bool bad = false;
    for (auto [p, t, _] : a){
        if ((A - p) * t >= A){
            assert(!bad);
            A = (A - p) * t;
            A = min((ll)A, MX);
            ptr++;
        } else bad = true;
    }
    
    for (ll i = 0; i <= n; i++){
        dp[i][0] = A;
    }
    
    for (ll i = ptr + 1; i <= m; i++){
        auto [p, t, _] = a[i - 1]; 
        for (ll j = 0; j < L; j++){
            if (dp[i - 1][j] >= 0){
                dp[i][j] = dp[i - 1][j];
                par[i][j] = 0;
            }
        }
        for (ll j = 0; j + 1 < L; j++){
            if (dp[i - 1][j] >= p){
                ll val = (dp[i - 1][j] - p) * t;
                val = min(val, MX);
                if (val > dp[i][j + 1]){
                    dp[i][j + 1] = val;
                    par[i][j + 1] = 1;
                }
            }
        }
    }
    
    vector <ll> pref(k + 1, 0);
    for (ll i = 1; i <= k; i++){
        pref[i] = pref[i - 1] + b[i - 1][0];
    }
    
    ll ans = -1, id = -1, ok = -1;
    for (ll i = 0; i < L; i++){
        if (dp[m][i] >= 0){
            ll val = i;
            ll l = 0, r = k;
            while (l != r){
                ll mid = (l + r + 1) / 2;
                if (pref[mid] <= dp[m][i]) l = mid;
                else r = mid - 1;
            }
            val += l;
            if (val > ans) ans = val, id = i, ok = l;
        }
    }
    vector <int> vec;
    for (ll i = 0; i < ok; i++) vec.pb(b[i][1]);
    for (ll i = m; i > ptr; i--){
        if (par[i][id] == 1){
            id--;
            vec.pb(a[i - 1][2]);
        }
    }
    for (ll i = ptr - 1; i >= 0; i--) vec.pb(a[i][2]);
    reverse(vec.begin(), vec.end());
    return vec;
}

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 27 / 27
• Subtask 6: 16 / 16
• Subtask 7: 18 / 18