Submission #1260518

#	Time	Username	Problem	Language	Result	Execution time	Memory
1260518		yhx3	Festival (IOI25_festival)	C++20	5 / 100	1093 ms	8504 KiB

festival

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ord_set tree < int ,  null_type ,  less ,  rb_tree_tag ,  tree_order_statistics_node_update>
#define ll long long
#define rep(i,a,b) for (int i = a; i < b; i++)
#define rrep(i,a,b) for (int i = a; i >= b; i--)
void N() {cout<<"NO\n";}
void Y() {cout<<"YES\n";}
void isTrue(bool ope) {
    if (ope) Y();else N();
}
int MD = 1e9+7;
ll MX_VL = 1e18;
int MX_ll = 2e9;

ll a;
vector<pair<int,int>> pV;
vector<pair<int,int>> tV;

bool comp(int &x,int& y) {
    return (a-pV[x].first) > (a-pV[y].first);
}

vector<int> max_coupons(int A,vector<int> P, vector<int> T) {
    a = A;
    rep(i,0,P.size()) {
        pV.push_back(make_pair(P[i],i));
        tV.push_back(make_pair(T[i],i));
    }
    vector<int> lst;
    rep(i,0,P.size()) lst.push_back(i);
    vector<int> ans;
    sort(lst.begin(),lst.end(),comp);
    while (!lst.empty()) {
        int i = lst[0];
        if (a < P[i]) break;
        a = (a-P[i])*T[i];
        ans.push_back(i);
        lst.erase(lst.begin());
    }
    return ans;
    while (!lst.empty()) {
        if (a > 7*1e10) {
            for (auto v:lst) ans.push_back(v);
            break;
        }
        lst.erase(lst.begin());
    }
    return ans;
}

• 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