제출 #1325966

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1325966		somefolk	축제 (IOI25_festival)	C++20	0 / 100	35 ms	5668 KiB

festival

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

struct El {
    int 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 curr = a, pos1 = 0, pos2 = 0;
    for(int i = 0; i < (int)twos.size(); i++){
        curr = 2*(curr - twos[i].p);
        if(curr < 0) break;
        int curr2 = curr;
        for(int j = 0; j < (int)ones.size(); j++){
            if(curr2 - ones[j].p < 0) break;
            curr2 -= ones[j].p;
            if(i + j > pos1 + pos2){
                pos2 = i;
                pos1 = j;
            }
        }
    }

    vector<int> sol;
    for(int i = 0; i <= pos2; i++) sol.push_back(twos[i].idx);
    for(int i = 0; i <= pos1; i++) sol.push_back(ones[i].idx);

    return sol;
}

• 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