Submission #840971

#	Time	Username	Problem	Language	Result	Execution time	Memory
840971		Desh03	A Plus B (IOI23_aplusb)	C++17	100 / 100	88 ms	13192 KiB

aplusb

#include <bits/stdc++.h>

using namespace std;

vector<int> smallest_sums(int n, vector<int> a, vector<int> b) {
    priority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, greater<tuple<int, int, int>>> q;
    q.push({a[0] + b[0], 0, 0});
    set<pair<int, int>> s;
    vector<int> v;
    while (n--) {
        auto [p, i, j] = q.top();
        q.pop();
        v.push_back(p);
        if (s.find({i + 1, j}) == s.end()) {
            q.push({a[i + 1] + b[j], i + 1, j});
            s.insert({i + 1, j});
        }
        if (s.find({i, j + 1}) == s.end()) {
            q.push({a[i] + b[j + 1], i, j + 1});
            s.insert({i, j + 1});
        }
    }
    return v;
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 30 / 30
• Subtask 4: 40 / 40