Submission #1252628

#TimeUsernameProblemLanguageResultExecution timeMemory
1252628comgaTramAnhFestival (IOI25_festival)C++20
27 / 100
70 ms5820 KiB
#include <bits/stdc++.h> #include "festival.h" using namespace std; std::vector <int> max_coupons(int A, std::vector <int> P, std::vector <int> T) { auto compare = [&](int i, int j) { std::pair <int, int> a = std::make_pair(P[i], T[i]); std::pair <int, int> b = std::make_pair(P[j], T[j]); return (1LL * a.first * a.second * b.second + 1LL * b.first * b.second < 1LL * b.first * a.second * b.second + 1LL * a.first * a.second); }; std::vector <int> save, ret; for (int i = 0; i < (int) T.size(); i++) { save.push_back(i); } std::sort(save.begin(), save.end(), compare); long long X = A; for (int i = 0; i < (int) T.size(); i++) { if (X >= P[save[i]]) { X = 1LL * (X - P[save[i]]) * T[save[i]]; ret.push_back(save[i]); } } return ret; }
#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...