Submission #1232130

#	Time	Username	Problem	Language	Result	Execution time	Memory
1232130		khome	Table Tennis (info1cup20_tabletennis)	C++20	20 / 100	3095 ms	8680 KiB

tabletennis

#include <bits/stdc++.h>

using namespace std;
#define int unsigned long long

const int inf = 1e9;

void solve(){
    int n, k; cin >> n >> k;
    vector<int> a(n + k);
    set<int> st;
    for (int i = 0; i < n + k; i++ ) {cin >> a[i]; st.insert(a[i]);}

    // sort(a.begin(), a.end());
    auto check = [&](int x, int L, int R) -> void {
        vector<int> v;
        int l = L, r = R;
        for (int i = L; i <= R; i++) {
            if (v.size() >= n) break;
            int rr = r;
            while (rr >= 0 && a[i] + a[rr] > x || i == rr || a[i] >= a[rr]) {
                rr--;
            }
            if (a[i] + a[rr] == x) {
                v.push_back(a[i]);
                v.push_back(a[rr]);
                r = rr;
            }
        }
        if (v.size() == n){
            sort(v.begin(), v.end());
            for (int i : v) cout << i << ' '; cout << endl;
            exit(0);
        }
        return;
    };

    for (int i = 0; i < k + 1; i++ ) {
        for (int j = i + n - 1; j < n + k; j++) {
            check(a[i] + a[j], i, j);
        }
    }

}

signed main(){
    cin.tie(0) -> sync_with_stdio(0);
    int t = 1;
    // cin >> t;
    while (t--)solve();
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 9 / 9
• Subtask 6: 0 / 14
• Subtask 7: 0 / 15
• Subtask 8: 0 / 13