Submission #1151387

#	Time	Username	Problem	Language	Result	Execution time	Memory
1151387		boropoto	Table Tennis (info1cup20_tabletennis)	C++20	66 / 100	76 ms	4280 KiB

tabletennis

#include<bits/stdc++.h>
using namespace std;
long long int n,k,a[200000];
void read()
{
    cin>>n>>k;
    for(long long int i=1; i<=n+k; i++)
    {
        cin>>a[i];
    }
}
long long int check(long long int l,long long int r)
{
    vector<long long int> v;
    long long int brg=n/2,brk=l+n+k-r-1,sumlr=a[l]+a[r];
    while(brg>=1&&l+1<=r)
    {
        if(a[l]+a[r]==sumlr)
        {
            brg--;
            v.push_back(a[l]);
            v.push_back(a[r]);
            l++;
            r--;
        }
        else
        {
            if(sumlr<a[l]+a[r])
            {
                r--;
                brk++;
            }
            else
            {
                if(sumlr>a[l]+a[r])
                {
                    l++;
                    brk++;
                }
            }
        }
        if(brk>k)
        {
            return 0;
        }
    }
    if(brg==0)
    {
        sort(v.begin(),v.end());
        for(long long int i=0; i<v.size(); i++)
        {
            cout<<v[i]<<' ';
        }
        exit(0);
    }
    return 0;
}
int main ()
{
    ios_base::sync_with_stdio();
    cin.tie(0);
    cout.tie(0);
    read();
    for(long long int i=1; i<=k; i++)
    {
        for(long long int j=n+k; j>=n+i-1; j--)
        {
            check(i,j);
        }
    }
    return 0;
}

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