Submission #1258279

#	Time	Username	Problem	Language	Result	Execution time	Memory
1258279		medmdg	Festival (IOI25_festival)	C++20	5 / 100	80 ms	19880 KiB

festival

#include "festival.h"
#include<bits/stdc++.h>
#define mk(a,b) make_pair(a,b)
using namespace std;
typedef long long ll;
ll n;
vector<pair<ll,int>> t[4];
set<pair<ll,ll>> s;
int a;
vector<int> p;
int getP1(ll a){
  if(a<0)return 0;
  set<pair<ll,ll>>::iterator t=s.lower_bound(mk(a+1,-1));
  if(t==s.begin())return 0;
  t--;
  ll ans= (*t).second;
  return ans;
}
vector<int> sub3(){
  ll ma=getP1(a);
  ll nb=0;
  
  for(int i=0;i<t[1].size();i++){
    a-=t[1][i].first;
    a*=2;
    if(a<0)break;
    ll nma=getP1(a)+i+1;
    if(nma>ma){
      ma=nma;
      nb=i+1;
    }
  }
  vector<int> ans;
  for(int i=0;i<nb;i++){
    ans.push_back(t[1][i].second);
  }
  for(int i=nb;i<ma;i++){
    ans.push_back(t[0][i-nb].second);
  }
  return ans;
}
vector<int> max_coupons(int A, vector<int> P, vector<int> T) {
  for(int i=0;i<4;i++)t[i].clear();
  for(int i=0;i<T.size();i++){
    t[T[i]-1].push_back(mk(P[i],i));
  }
  for(int i=0;i<4;i++)  sort(t[i].begin(),t[i].end());
  s.clear();
  s.insert(mk(0,0));
  ll ps=0;
  for(int i=0;i<t[0].size();i++){ ps+=t[0][i].first;s.insert(mk(ps,i+1));}
  n=P.size();
  a=A;
  p=P;
  return sub3();
}

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