Submission #1278202

#TimeUsernameProblemLanguageResultExecution timeMemory
1278202SabaKharebava축제 (IOI25_festival)C++20
5 / 100
70 ms9576 KiB
#include<bits/stdc++.h> using namespace std; #define pb push_back vector<int> max_coupons(int a, vector<int> p, vector<int> t) { int n = p.size(); vector<int> order; for (int i = 0; i < n; i++) order.pb(i); sort(order.begin(), order.end(), [&](int i, int j) { long long A = -p[i]*t[i]*t[j] - p[j]*t[j]; long long B = -p[j]*t[i]*t[j] - p[i]*t[i]; if (A == B) return p[i] < p[j]; return A > B; }); vector<int> ans, q; int ind = 0; for (int e : order) { while (ind != q.size() and a > p[q[ind]]) { a = (a-p[q[ind]]) * t[q[ind]]; ans.pb(q[ind]); ind++; } if (a >= p[e]) { ans.pb(e); a = (a-p[e]) * t[e]; } else { q.pb(e); } } return ans; }
#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...