제출 #1253424

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1253424		nickolasarapidis	축제 (IOI25_festival)	C++20	5 / 100	63 ms	6848 KiB

festival

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

#define F first
#define S second

bool comp(tuple<int, int, int> A, tuple<int, int, int> B){
    if(get<1>(A) == get<1>(B)) return get<0>(A) < get<0>(B);
    return get<1>(A) > get<1>(B);
}

vector<int> max_coupons(int A, vector<int> P, vector<int> T){
    vector<int> R;
    int N = P.size();
    vector<tuple<int, int, int>> pr(N);
    for(int i = 0; i < N; i++){
        pr[i] = make_tuple(P[i], T[i], i);
    }
    sort(pr.begin(), pr.end(), comp);
    for(int i = 0; i < N; i++){
        if(A - get<0>(pr[i]) > 0){
            A = (A - get<0>(pr[i]))*get<1>(pr[i]);
            R.push_back(get<2>(pr[i]));
        }
        else break;
    }
    return R;
}

• 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