Submission #1211719

#	Time	Username	Problem	Language	Result	Execution time	Memory
1211719		M_SH_O	Table Tennis (info1cup20_tabletennis)	C++20	49 / 100	3086 ms	4856 KiB

tabletennis

#include <bits/stdc++.h>
//#include "grader.h"
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/

#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
//#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
//#define sort(a) sort(a.begin(), a.end())
#define all(a) a.begin(), a.end()
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define INF 5000000000000000000
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>

using namespace std;
//using namespace __gnu_pbds;

mt19937 rng(1488);
ll randll(ll l, ll r){
    return uniform_int_distribution<ll>(l, r)(rng);
}

int main() {
    speed;
    srand(time(0));

    ll n, k;
    cin >> n >> k;

    vll a(n+k);

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

    sort(all(a));
    set<ll> s1;

    ll l = min(n+k, k*2);
    ll r = max((ll)0, n-k);

    random_shuffle(a.begin(), a.begin()+l);
    random_shuffle(a.begin()+r, a.begin()+n+k);


    for (int i = 0; i < l; i ++) {
        for (int j = n+k-1; j >= r; j --) {
            if (i == j) break;
            if (n >= 1e5) {
                vll b;
                for (int i1 = 0; i1 < n+k; i1 ++) {
                    b.pb(a[i1]);
                }
                if (b.size() == n) {
                    sort(all(b));
                    for (int i1 : b) {
                        cout << i1 << ' ';
                    }
                    cout << endl;
                    return 0;
                }
                continue;
            }
            if (s1.find(a[i]+a[j]) != s1.end()) continue;
            s1.insert(a[i]+a[j]);
            unordered_map<ll, ll> m;
            for (int i1 = 0; i1 < n+k; i1 ++) {
                m[a[i1]] ++;
            }
            vll b;

            ll s = a[i]+a[j];
            for (int i1 = 0; i1 < n+k; i1 ++) {
                if (m.find(a[i1]) == m.end()) continue;
                m[a[i1]] --;
                if (m[a[i1]] == 0) m.erase(a[i1]);
                if (m.find(s-a[i1]) != m.end()) {

                    ll c = s-a[i1];
                    b.pb(a[i1]);
                    b.pb(c);
                    m[s-a[i1]] --;
                    if (m[s-a[i1]] == 0) m.erase(s-a[i1]);
                    if (b.size() == n) break;
                }
            }
            if (b.size() == n) {
                sort(all(b));
                for (int i1 : b) {
                    cout << i1 << ' ';
                }
                cout << endl;
                return 0;
            }
        }
    }

}

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