제출 #1325980

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1325980		somefolk	Festival (IOI25_festival)	C++20	24 / 100	50 ms	9756 KiB

festival

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

#define ll long long
const ll INF = (ll)4e18;

struct El {
    ll p, idx;
};

vector<int> max_coupons(int a, vector<int> p, vector<int> t){
    int n = (int)p.size();
    vector<El> ones, twos;
    for(int i = 0; i < n; i++){
        if(t[i] == 1) ones.push_back({p[i], i});
        else twos.push_back({p[i], i});
    }

    sort(ones.begin(), ones.end(), [&](auto l, auto r){ return l.p < r.p; });
    sort(twos.begin(), twos.end(), [&](auto l, auto r){ return l.p < r.p; });

    int osz = (int)ones.size();
    vector<ll> pref1(osz);
    for(int i = 0; i < osz; i++){
        if(i == 0) pref1[i] = ones[i].p;
        else pref1[i] = pref1[i-1] + ones[i].p;
    }

    auto get = [&](ll cnt){
        return (upper_bound(pref1.begin(), pref1.end(), cnt) - pref1.begin());
    };

    ll curr = a;
    ll amount1 = get(curr), amount2 = 0;
    for(int i = 0; i < (int)twos.size(); i++){
        if(curr < twos[i].p) break;
        curr = curr - twos[i].p;
        if(curr > INF/2) curr = INF;
        else curr = curr * 2;
        if(curr > INF) curr = INF;
        ll temp = get(curr);
        if(temp + (i+1) > amount1 + amount2){
            amount1 = temp;
            amount2 = i+1;
        }
    }

    vector<int> sol;
    for(int i = 0; i < amount2; i++) sol.push_back(twos[i].idx);
    for(int i = 0; i < amount1; i++) sol.push_back(ones[i].idx);
    return sol;
}

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