# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
991942 | jakobrs | A Plus B (IOI23_aplusb) | C++17 | 80 ms | 9792 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "aplusb.h"
#include <queue>
#include <set>
#include <vector>
std::vector<int> smallest_sums(int N, std::vector<int> A, std::vector<int> B) {
auto cmp = [&](std::pair<int, int> a, std::pair<int, int> b) {
auto [a1, a2] = a;
auto [b1, b2] = b;
return A[a1] + B[a2] > A[b1] + B[b2];
};
auto pq =
std::priority_queue<std::pair<int, int>, std::vector<std::pair<int, int>>,
decltype(cmp)>(cmp);
pq.push({0, 0});
auto seen = std::set<std::pair<int, int>>{};
std::vector<int> results;
for (int i = 0; i < N; i++) {
pick:
auto [a, b] = pq.top();
pq.pop();
if (seen.find({a, b}) != seen.end())
goto pick;
seen.insert({a, b});
results.push_back(A[a] + B[b]);
if (a + 1 < A.size())
pq.push({a + 1, b});
if (b + 1 < B.size())
pq.push({a, b + 1});
}
return results;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |