Submission #1253093

#	Time	Username	Problem	Language	Result	Execution time	Memory
1253093		QwertyPi	Festival (IOI25_festival)	C++20	27 / 100	81 ms	17324 KiB

festival

#include "festival.h"
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
using namespace std;

const int MX = 2e14 + 11;

struct coupon {
    int p, t, id;
    bool operator< (const coupon& o) const {
        return p < o.p;
    }
    int apply(int x) {
        return max(-1LL, min(MX, (x - p) * t));
    }
};

vector<coupon> C[5];

#define forn(i, n) for (int i = 0; i < (int) (n); i++)

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

    vector<coupon> C2;
    for (int t = 1; t <= 4; t++) {
        for (auto c : C[t]) C2.push_back(c);
    }
    sort(all(C2), [] (auto& c1, auto& c2) {
        return (c1.t - 1) * c2.p * c2.t > (c2.t - 1) * c1.p * c1.t;
    });
    
    vector<int32_t> ans;
    for (auto c : C2) {
        ans.push_back(c.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