제출 #1281982

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1281982		nikakh	축제 (IOI25_festival)	C++20	0 / 100	46 ms	8124 KiB

festival

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

typedef long long ll;

bool cmp(array<ll, 3> &F, array<ll, 3> &S){
    ll a = F[0], at = F[1];
    ll b = S[0], bt = S[1];
    ll x = bt * (-a * at - b);
    ll y = at * (-b * bt - a);
    if(x != y) return x < y;
    return F[2] < S[2];
}

vector<int> max_coupons(int A, vector<int> P, vector<int> T){
    int n = (int)P.size();
    vector<array<ll, 3>> a(n);
    for(int i = 0; i < n; i++){
        a[i] = {P[i], T[i], i};
    }
    sort(a.begin(), a.end(), cmp);
    vector<int> R;
    ll val = A;
    for(int i = 0; i < n; i++){
        if(val < a[i][0]) break;
        val = (val - a[i][0]) * a[i][1];
        R.push_back(a[i][2]);
    }
    return R;
}

• 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