Submission #1312505

#	Time	Username	Problem	Language	Result	Execution time	Memory
1312505		MunkhturErdenebat	Festival (IOI25_festival)	C++20	0 / 100	39 ms	7128 KiB

festival

#include "festival.h"
#include<bits/stdc++.h>
#include<string.h>
#include <algorithm>
#include <iterator>
#include <set>
#include <stdlib.h>
 #define ll int
 #define fr first
 #define sc second
 #define pb push_back
 #define YES cout<<"YES"<<endl
 #define NO cout<<"NO"<<endl
using namespace std;
    ll a,b,c,d,e,f,m,i,j,n,h,g,r,ka,q[351105],maa[200005];
    map<ll,ll> mee,see;
    map<ll,ll> mii;
    vector<ll> vas,vis,vii;
    string x,y,z,te,to;
    vector<pair<ll,ll>> ves[50];
    
    pair<ll,ll> wefe;
    priority_queue<ll> pq1,pq2;
    stack<ll> munkh;
    ll l[5];
void check(ll b){
    ll c=0;
    for(j=4 ; j>=0 ; j--){
        if(c>0){
            check(b);
            break;
        }
        for(ll i=l[j] ; i<ves[j].size() ; i++){
            if((b-ves[j][i].fr)*j>=b){
                c++;
                vas.pb(ves[j][i].sc);
                l[j]++;
            }
            else{
                break;
            }
        }
    }
    if(c==0){
        return ;
    }
}
vector<ll> max_coupons(ll b, vector<ll> k, vector<ll> t) {
    a=k.size();
	for(i=0 ; i<a ; i++){
	    ves[t[i]].pb({k[i],i+1});
	}
	for(i=0 ; i<=4 ; i++){
	    sort(ves[i].begin(),ves[i].end());
	}
	l[1]=0;
	l[2]=0;
	l[3]=0;
	l[4]=0;
	l[0]=0;
	check(b);
  return vas;
}

• 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