제출 #1302002

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1302002		yus1f_m	Table Tennis (info1cup20_tabletennis)	C++20	87 / 100	3092 ms	6616 KiB

tabletennis

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pb push_back
#define pf push_front
#define in insert
#define all(v) v.begin(),v.end()
#define fastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
const int sz=1000000,INF=1000000000;
using namespace std;
vector<ll>nums;
pair<vector<ll>,bool>f(ll num1,ll num2)
{
    ll left=0,right=nums.size()-1,cnt=num2;
    vector<ll>res;
    while(left<right)
    {
        if(nums[left]+nums[right]!=num1)
        {
            cnt--;
            if(cnt<0)
            {
                return {{},false};
            }
            else
            {
                if(nums[left]+nums[right]<num1)
                {
                    left++;
                }
                else
                {
                    right--;
                }
            }
        }
        else
        {
            res.pb(nums[left]),res.pb(nums[right]),left++,right--;
            if(res.size()==nums.size()-num2)
            {
                break;
            }
        }
    }
    if(res.size()==nums.size()-num2)
    {
        sort(all(res));
        return {res,true};
    }
    else
    {
        return {{},false};
    }
}
void solve()
{
    ll n,m,num;
    cin>>n>>m;
    vector<ll>res,ans;
    for(int i=0;i<n+m;i++)
    {
        cin>>num;
        nums.pb(num);
    }
    sort(all(nums));
    for(int i=0;i<nums.size();i++)
    {
        for(int j=i+1;j<nums.size();j++)
        {
            if(f(nums[i]+nums[j],m).second)
            {
                ans=f(nums[i]+nums[j],m).first;
                break;
            }
        }
        if(ans.size()!=0)
        {
            break;
        }
    }
    for(int i=0;i<ans.size();i++)
    {
        cout<<ans[i]<<" ";
    }
}
int main()
{
    fastIO;
    ll t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
}

• 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