제출 #1255034

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1255034		tosivanmak	축제 (IOI25_festival)	C++20	27 / 100	63 ms	9900 KiB

festival

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

struct Coupon{
    ll tp,a,id;
    bool operator<(const Coupon& c)const{
        ll P=1000;
        ll val1=((P-a)*tp-c.a)*c.tp;
        ll val2=((P-c.a)*c.tp-a)*tp;
        if(val1!=val2){
            return (val1>val2);
        }
        if(tp!=c.tp)return tp<c.tp;
        return id<c.id;
    }
};
vector<int> max_coupons(int A, vector<int> P, vector<int> T){
    ll n;
    n=P.size();
    vector<Coupon>v;
    for(int i=0;i<n;i++){
        v.push_back({T[i],P[i],i});
    }
    sort(v.begin(),v.end());
    vector<int>ans;
    for(int i=0;i<n;i++)ans.push_back(v[i].id);
    return ans;
}

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