Submission #791942

#	Time	Username	Problem	Language	Result	Execution time	Memory
791942		Cookie	Table Tennis (info1cup20_tabletennis)	C++14	100 / 100	264 ms	33828 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 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 = 2e5 + 5, 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;
int a[mxn + 1];
vt<int>seg;
int check(int v, bool trace = 0){
    int l = 1, r = n + k, cnt = 0;
    while(l < r){
        if(a[l] + a[r] == v){
            if(trace && sz(seg) != n){
                seg.pb(a[l]); seg.pb(a[r]);
            }
            cnt++;
            l++; r--;
        }else if(a[l] + a[r] > v){
            r--;
        }else{
            l++;
        }
    }
    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);
    if(k * 4 > n){
    for(int tol = 1; tol <= k + 1; tol++){
        for(int tor = max(n, tol + 1); tor <= n + k; tor++){
        if(check(a[tol] + a[tor]) >= n / 2){
            check(a[tol] + a[tor], 1);
            break;
        }
        }
    }
    }else{
        map<int, int>sm;
        for(int i = 1; i <= k + k; i++){
            for(int j = n + k; j > n - k; j--){
                sm[a[i] + a[j]]++;
            }
        }
        vt<ll>cand;
        for(auto i: sm){
            if(i.se >= k){
                cand.pb(i.fi);
            }
        }
        for(auto i: cand){
            if(check(i) >= n / 2){
                check(i, 1);
                break;
            }
        }
    }
    
    sort(seg.begin(), seg.end());
    for(auto i: seg){
        cout << i << " ";
    }
    return(0);
}

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