Submission #791901

#	Time	Username	Problem	Language	Result	Execution time	Memory
791901		Cookie	Table Tennis (info1cup20_tabletennis)	C++14	49 / 100	3068 ms	10824 KiB

tabletennis

#include<bits/stdc++.h>
#include<fstream>
#pragma GCC optimize("Ofast,O3,unroll-loops")
#pragma GCC target("avx2")
using namespace std;
//ifstream fin("FEEDING.INP");
//ofstream fout("FEEDING.OUT");
#define sz(a) (int)a.size()
#define int long long
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const ll mxn = 150005, base = 972663749;
const ll mod = 911382323, mxv = 1e9 + 1;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rr(ll l, ll r){
    return(uniform_int_distribution<ll>(l, r)(rng));
}

int n, k;
ll a[mxn + 1];
vt<ll>seg;
int check(ll v, bool trace = 0){
    
    map<int, int>seen;
    int cnt = 0;
    for(int i = 1; i <= n + k; i++){
        if(seen.find(v - a[i]) != seen.end()){
            if(trace){
                seg.pb(a[i]); seg.pb(v - a[i]);
            }
            cnt++;
        }
        seen[a[i]] = 1;
    }
    return(cnt);
}
signed main()
{
     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> k;
    for(int i = 1; i <= n + k; i++)cin >> a[i];
    sort(a + 1, a + n + k + 1);
    while(1){
        int tol = rr(1, n + k - 1), tor = rr(tol + 1, n + k);
        if(check(a[tol] + a[tor]) >= n / 2){
            check(a[tol] + a[tor], 1);
            break;
        }
    }
    sort(seg.begin(), seg.end());
    for(auto i: seg){
        cout << i << " ";
    }
    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