Submission #1267498

#TimeUsernameProblemLanguageResultExecution timeMemory
1267498nerrrminFestival (IOI25_festival)C++20
27 / 100
82 ms10024 KiB
#include "festival.h" #include<bits/stdc++.h> #define pb push_back using namespace std; const long long maxn = 2e5 + 10; long long n, a; struct coupon { long long cost, type, index; coupon() {}; coupon(long long _cost, long long _type, long long _index) { cost = _cost; type = _type; index = _index; } }; bool cmp(coupon c1, coupon c2) { if(c1.type == c2.type)return (c1.cost < c2.cost); return (c2.cost * c1.type * c2.type + c1.cost * c1.type > c1.type * c1.cost * c2.type + c2.cost * c2.type); } vector < coupon > g; std::vector<int> max_coupons(int A, std::vector<int> P, std::vector<int> T) { a = A; n = P.size(); for (long long i = 0; i < n; ++ i) { g.pb(coupon(P[i], T[i], i)); } sort(g.begin(), g.end(), cmp); vector < int > res; for (auto &[c, t, i]: g) res.pb(i); return res; }
#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...