Submission #840966

#	Time	Username	Problem	Language	Result	Execution time	Memory
840966		Desh03	A Plus B (IOI23_aplusb)	C++17	10 / 100	1 ms	300 KiB

aplusb

#include <bits/stdc++.h>

using namespace std;

vector<int> smallest_sums(int n, vector<int> a, vector<int> b) {
    vector<int> v;
    int cnt = 0, cnt2 = 0;
    while (cnt < n && a[cnt] == a[0]) cnt++;
    while (cnt2 < n && b[cnt2] == b[0]) cnt2++;
    set<pair<int, int>> m;
    for (int i = 0; i < n; i++) {
        for (int k = 0; k < min(cnt, n >> i); k++) {
            m.insert({i, k});
            v.push_back(a[0] + b[i]);
        }
    }
    for (int i = 0; i < n; i++) {
        for (int k = 0; k < min(cnt2, n >> i); k++) {
            if (m.find({k, i}) != m.end()) continue;
            v.push_back(b[0] + a[i]);
        }
    }
    sort(v.begin(), v.end());
    return vector<int> (v.begin(), v.begin() + n);
}

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