제출 #1255562

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1255562		onbert	축제 (IOI25_festival)	C++20	27 / 100	72 ms	9656 KiB

festival

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

struct thing {
    int p, t, id;
    bool operator < (const thing &b) const {
        if (t == b.t) return p < b.p;
        return (b.t - 1) * t * p < (t - 1) * b.t * b.p;
    }
};
const int maxn = 2e5 + 5;
int n;
vector<thing> a;

vector<int32_t> max_coupons(int32_t A, vector<int32_t> P, vector<int32_t> T) {
    n = P.size();
    for (int i=0;i<n;i++) a.push_back({P[i], T[i], i});
    sort(a.begin(), a.end());

    vector<int32_t> ans(n);
    for (int i=0;i<n;i++) ans[i] = a[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