Submission #1231721

#TimeUsernameProblemLanguageResultExecution timeMemory
1231721khomeTable Tennis (info1cup20_tabletennis)C++20
0 / 100
3089 ms1776 KiB
#include <bits/stdc++.h>

using namespace std;

const int inf = 1e9;

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

    auto check = [&](int x) -> void {
        vector<int> v;

        for (int i = 0; i <= (k + n); i++) {
            if (x & (1 << i)) v.push_back(a[i]);
        }
        if (v.size() != n) return;
        // for (int i : v) cout << i << ' ' ; cout << endl;
        for (int i = 0; i < n/2 - 1; i++) {
            if (v[i] + v[n - i - 1] != v[i + 1] + v[n - i - 2]) {
                for (int j : v) cout << j << ' '; cout << endl;
                exit(0);
            }
        }

        return;
    };

    for (int i = 0; i < (1 << (n + k)); i++) {
        // cout << i << endl;
        check(i);
    }

}

int main(){
    int t = 1;
    // cin >> t;
    while (t--)solve();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...