Submission #1253067

#TimeUsernameProblemLanguageResultExecution timeMemory
1253067QwertyPiFestival (IOI25_festival)C++20
5 / 100
42 ms9780 KiB
#include "festival.h" #include <bits/stdc++.h> #define int long long using namespace std; const int MX = 2e14 + 11; struct coupon { int p, t, id; bool operator< (const coupon& o) const { return p < o.p; } }; vector<coupon> C[5]; 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<int32_t> ans; for (auto c : C[1]) { if (A >= c.p) { A -= c.p; ans.push_back(c.id); } } 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...