Submission #1252343

#TimeUsernameProblemLanguageResultExecution timeMemory
1252343NekoRollyFestival (IOI25_festival)C++20
27 / 100
116 ms9408 KiB
#include "festival.h"
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

struct coupon{
    ll p,t,id;
};

bool comp(coupon A,coupon B){ // *{P[i], T[i]}
    auto [p, a, ida] = A;
    auto [q, b, idb] = B;
    if (a == b) return p <= q;
    return a*b*p + b*q <= a*b*q + a*p;
}

vector<int> max_coupons(int A,vector<int> P,vector<int> T){
    int n = P.size();
    coupon a[n];

    for (int i=0; i<n; i++)
        a[i] = {P[i], T[i], i};

    sort(a, a+n, comp);

    vector<int> vans;
    for (int i=0; i<n; i++)
        vans.push_back(a[i].id);

    return vans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...