Submission #525272

#	Time	Username	Problem	Language	Result	Execution time	Memory
525272		ksu2009en	Table Tennis (info1cup20_tabletennis)	C++14	29 / 100	119 ms	2880 KiB

tabletennis

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;


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

    vector<ll>a(n + k);

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

    ll sum = 0;
    for(auto i: a)
        sum += i;

    sort(a.begin(), a.end());

    if(n + k <= 18){
        for(int mask = 0; mask < (1 << (n + k)); mask++){
            ll cnt = 0, mn = 1e9, mx = -1, sum2 = sum;

            map<ll, ll>mp;

            for(int j = 0; j < n + k; j++){
                if((mask >> j) % 2 != 0){
                    //cout << a[j] << ' ';
                    cnt++;
                    sum2 -= a[j];
                }
                else{
                    mn = min(mn, a[j]);
                    mx = max(mx, a[j]);

                    mp[a[j]]++;
                }
            }
           // cout << endl;

            if(cnt != k)
                continue;

            if(sum2 % (n / 2) != 0)
                continue;


            ll bl = sum2 / (n / 2);
            //cout << "Look: " << sum2 << ' ' << bl << endl;

            bool ok = false;

            for(int j = 0; j < n + k; j++){
                if((mask >> j )% 2 != 0)
                    bl = bl;
                else{
                    if(mp[bl - a[j]] <= 0)
                        ok = true;
                    mp[bl - a[j]]--;
                }
            }

            if(ok)
                continue;

            for(int j = 0; j < n + k; j++){
                if((mask >> j) % 2 != 0)
                    bl = bl;
                else
                    cout << a[j] << ' ';
            }
            cout << endl;
            return 0;
        }
    }

    for(int i = 0; i < n + 1; i++){
        ll sum2 = sum - a[i];

        ll mn = a[0];
        if(i == 0)
            mn = a[1];

        ll mx = a[n + k - 1];
        if(i == n + k - 1)
            mx = a[n + k - 2];

        ll bl = sum2 / (n / 2);
        if(sum2 % (n / 2) != 0)
            continue;

        if(mn + mx < bl || mx >= bl)
            continue;

        for(int j = 0; j < n + k; j++){
            if(j == i)
                continue;
            cout << a[j] << ' ';
        }
        cout << endl;
        return 0;
    }


    return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 9 / 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