제출 #1252630

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1252630		al95ireyiz	Table Tennis (info1cup20_tabletennis)	C++20	100 / 100	133 ms	4300 KiB

tabletennis

//*** Bismillah ***//
#pragma GCC optimize("O3", "fast-math", "unroll-loops", "no-stack-protector")
#include <bits/stdc++.h>
using namespace std;
#if !defined(ONLINE_JUDGE) and !defined(EVAL)
#include "template/debug.h"
#else
#define d(x...)
#endif
#define fr first
#define er erase
#define sc second
#define in insert
#define ll long long
#define pb push_back
#define vll vector<ll>
#define pll pair<ll,ll>
#define ull unsigned ll
#define vpll vector<pll>
#define len(x) (ll) x.size()
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll INFL = 1e18;
const ll MOD = 1e9+7;
// const ll MOD = 998244353;
const ll maxn = 2e5+5;
ll n,m,k=0;
ll a[maxn];
void _(ll &tt){
    cin >> n >> m;
    for(ll i = 1; i <= n + m; i ++){
        cin >> a[i];
    }
    sort(a + 1, a + n + m + 1);
    auto ch = [&](ll cm){
        ll l = 1, r = n + m, say = m;
        vll cv;
        while(l < r){
            if(cm != a[l] + a[r]){
                say --;
                if(say < 0) return 0;
                if(cm > a[l] + a[r]) l ++;
                else r --;
                continue;
            }
            cv.pb(a[l]), cv.pb(a[r]);
            if(len(cv) == n) break;
            l ++, r --;
        }
        if(len(cv) != n) return 0;
        sort(all(cv));
        for(auto x : cv) cout << x << ' ';
        return 1;
    };
    for(ll i = 1; i <= n + m; i ++){
        for(ll j = n + m; j >= i + 1; j --){
            if(i - 1 + n - j > m) break;
            if(ch(a[i] + a[j])) return;
        }
    }
}
signed main() {
    ll tm = clock();
    cin.tie(0)->sync_with_stdio(0);
    ll t = 1;
    // cin >> t;
    for(ll tt = 1; tt <= t; tt ++) {
        _(tt);
    }
    cerr << "\n\033[1;31mTime: \033[1;30m" \
         << (double)(clock()-tm)/1000000 << "\033[1;32m seconds\n";
}

• 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