Submission #1346691

#	Time	Username	Problem	Language	Result	Execution time	Memory
1346691		fatime_aslan_156	Table Tennis (info1cup20_tabletennis)	C++20	87 / 100	3094 ms	8780 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll n,k;
deque<ll>c(vector<ll>&v,ll x)
{
    deque<ll>f,q;
    ll l=0,r=v.size()-1;
    while(l<r && f.size()*2<n)
    {
        if(v[l]+v[r]==x)
        {
            f.push_back(v[l]);
            q.push_back(v[r]);
            l++;
            r--;
        }
        else if(v[l]+v[r]<x)
        {
            l++;
        }
        else
        {
            r--;
        }
    }
    if(f.size()*2<n)
    {
        deque<ll>y;
        return y;
    }
    while(f.size()*2>n)
    {
        f.pop_back();
        q.pop_back();
    }
    reverse(q.begin(),q.end());
    f.insert(f.end(),q.begin(),q.end());
    return f;
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>k;
    vector<ll>v(n+k);
    for(int i=0;i<n+k;i++)
    {
        cin>>v[i];
    }
    set<ll>s;
    for(int i=0;i<k+3;i++)
    {
        for(int j=n-3;j<n+k;j++)
        {
            if(i<j)
            s.insert(v[i]+v[j]);
        }
    }
    for(int i:s)
    {
        deque<ll>t=c(v,i);
        if(!t.empty())
        {
            for(int j:t)
            cout<<j<<' ';
            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: 0 / 13