Submission #667556

#	Time	Username	Problem	Language	Result	Execution time	Memory
667556		Hacv16	Table Tennis (info1cup20_tabletennis)	C++17	9 / 100	3075 ms	1048576 KiB

tabletennis

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const int MAX = 2e6 + 50;
const int INF = 0x3f3f3f3f;

int n, k, tot, ans;
vector<ll> v;

void bt(int i, int chosen, vector<ll> aux){
    if(chosen > n || i > tot) return;
    if(chosen + (tot - i) < n) return;

    if(i == tot){
        if(chosen == n){
            ll sum = aux[0] + aux[aux.size() - 1];
            bool isAns = true;

            for(int l = 1, r = aux.size() - 2; l < r; l++, r--)
                if(aux[l] + aux[r] != sum){ isAns = false; break; }

            if(isAns){
                for(auto x : aux)
                    cout << x << ' ';
                cout << '\n';

                exit(0);
            }
        }

        return;
    }

    vector<ll> sla = aux;
    sla.push_back(v[i]);

    bt(i + 1, chosen + 1, sla);
    bt(i + 1, chosen, aux);
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> k;

    tot = n + k;

    for(int i = 0; i < tot; i++){
        ll x; cin >> x;
        v.push_back(x);
    }

    vector<ll> trash;

    bt(0, 0, trash);

    return 0;
}

• Subtask 1: 0 / 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