제출 #1307839

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1307839		exoworldgd	축제 (IOI25_festival)	C++20	20 / 100	1097 ms	27824 KiB

festival

#include "festival.h"
#include <bits/stdc++.h>
#define exoworldgd cin.tie(0)->sync_with_stdio(0),cout.tie(0)
using namespace std;
using ll=long long;
int n;
vector<int>cur,best;
void rec(int pos,ll s,int lim,vector<int>&a,vector<int>&p,vector<int>&t){
    if(pos==n){
        if(cur.size()>best.size())best=cur;
        return;
    }
    if(s>=p[a[pos]]&&lim>=t[a[pos]])cur.push_back(a[pos]),rec(pos+1,min((s-p[a[pos]])*t[a[pos]],(ll)1e18),lim,a,p,t),cur.pop_back();
    rec(pos+1,s,min(lim,t[a[pos]]-1),a,p,t);
}
vector<int>max_coupons(int s,vector<int>p,vector<int>t){
    vector<int>a;
    n=p.size();
    for(int i=0;i<n;i++)a.push_back(i);
    sort(a.begin(),a.end(),[&](int a,int b){
        if(t[a]==1&&t[b]==1)return p[a]<p[b];
        if(t[a]==1||t[b]==1)return t[b]==1;
        return 1ll*p[a]*t[a]*(t[b]-1)<1ll*p[b]*t[b]*(t[a]-1);
    });
    rec(0,s,4,a,p,t);
    return best;
}

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