Submission #1319637

#	Time	Username	Problem	Language	Result	Execution time	Memory
1319637		bearrbearr	Table Tennis (info1cup20_tabletennis)	C++20	49 / 100	3094 ms	3360 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#define int long long
#define ii pair<int,int>
#define fir first
#define sec second
#define pb push_back
const int maxn=2e5;

ii a[maxn+1];
int n,k;
vector<int>ans;

bool bisa(int sum){
    ans.clear();
    int r=n+k;
    for(int l=1;l<=n+k && l<=r;l++){
        while(a[l].fir+a[r].fir>sum && r>0)r--;
        if(l>=r)break;

        if(a[l].fir+a[r].fir==sum){
            ans.push_back(a[l].fir); ans.push_back(a[r].fir);
            r--;
        }
    }

    if(ans.size()>=n)return true;
    return false;
}

mt19937 rnd(232323);

signed main(){
    cin>>n>>k;
    for(int q=1;q<=n+k;q++){
        cin>>a[q].fir;
        a[q].sec=q;
    }
    sort(a+1,a+n+k+1);

    uniform_int_distribution<int>uid(1,n+k-1);
    while(true){
        int satu=uid(rnd);
        uniform_int_distribution<int>uid2(satu+1,n+k);
        int dua=uid2(rnd);
       
        if(bisa(a[satu].fir+a[dua].fir)){
            break;
        }
    }
    sort(ans.begin(),ans.end());
    for(auto x : ans){
        cout<<x<<' ';
    }
    cout<<endl;
}

• 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