Submission #1252966

#TimeUsernameProblemLanguageResultExecution timeMemory
1252966bzzzzzzzzzz축제 (IOI25_festival)C++20
0 / 100
56 ms6840 KiB
#include <bits/stdc++.h> #include "festival.h" using namespace std; using ll = long long; std::vector<int> max_coupons(int A, std::vector<int> P, std::vector<int> T) { vector<pair<int, int>> v1, v2; int n = (int)P.size(); for (int i = 0; i < n; i++) { if (T[i] == 1) { v1.push_back({P[i], i}); } else { v2.push_back({P[i], i}); } } vector<int> ans; sort(v1.begin(), v1.end()); sort(v2.begin(), v2.end()); for (auto [x, i] : v2) { if ((A - x) * 2 >= A) { A = (A - x) * 2; ans.push_back(i); } } int l1 = 0, l2 = 0; while (true) { int a = 1e9 + 1, b = 1e9 + 1; if (v1.size() > l1) { a = v1[l1].first; } if (v2.size() > l2) { b = A - (A - v2[l2].first) * 2; } if (min(a, b) > A) { break; } if (a < b) { ans.push_back(v1[l1].second); l1++; } else { ans.push_back(v2[l2].second); l2++; } } 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...