Submission #1232009

#	Time	Username	Problem	Language	Result	Execution time	Memory
1232009		Aisha	Table Tennis (info1cup20_tabletennis)	C++20	0 / 100	3096 ms	19008 KiB

tabletennis

#include "bits/stdc++.h"

using namespace std;

#define int long long

signed main() {
    int n, k;
    cin >> n >> k;

    vector <int> a(n + k);
    for (int i = 0; i < n + k; i ++) cin >> a[i];
    // a is sorted

    vector <int> v(n + k, 0);

    bool ok = false;

    auto rec = [&](auto&& rec, int i, int cnt0, int cnt1, int cnt2, int sum1, int sum2) -> void {
        if (ok) return;
        if (cnt0 > k) return;
        if (cnt1 > n / 2) return;
        if (cnt2 > n / 2) return;

        if (i == n + k) {
            if (sum1 != sum2 || cnt1 != cnt2 || cnt0 != k) return;
            ok = true;
            return;
        }


        if (!ok) v[i] = 0; rec(rec, i + 1, cnt0 + 1, cnt1, cnt2, sum1, sum2); 
        if (!ok) v[i] = 1; rec(rec, i + 1, cnt0, cnt1 + 1, cnt2, sum1 + a[i], sum2);  
        if (!ok) v[i] = 2; rec(rec, i + 1, cnt0, cnt1, cnt2 + 1, sum1, sum2 + a[i]); 
        if (!ok) v[i] = 0; 
    };

    rec(rec, 0, 0, 0, 0, 0, 0);
  
    for (int j = 0; j < n + k; j ++) {
        if (v[j] == 1 || v[j] == 2) cout << a[j] << ' ';
    }

    cout << endl;


    return 0;
}

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