제출 #1161327

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

tabletennis

#include <bits/stdc++.h>

using namespace std;

const int nx=2e5+5, kx=405;

int n, k, sz, dp[nx];
vector<int> v ,res;
set<int> s;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>k;
    sz=n+k;
    v.resize(sz);
    for (auto &x:v) cin>>x;
    for (int l=0; l<=k; l++) for (int r=0; r+l<=k; r++) s.insert(v[l]+v[sz-1-r]);
    for (auto sm:s)
    {
        int idx=sz-1, cnt=0;
        for (int i=0; i<sz; i++)
        {
            dp[i]=-1;
            while (idx>i&&v[i]+v[idx]>sm) idx--;
            if (idx<=i) break;
            if (v[i]+v[idx]==sm) dp[i]=idx, cnt+=2;

        }
        //cout<<"sm "<<sm<<' '<<cnt<<'\n';
        if (cnt>=n)
        {
            cnt=n;
            for (int i=0; i<sz; i++)
            {
                if (!cnt) continue;
                if (dp[i]!=-1)
                {
                    res.push_back(v[i]);
                    res.push_back(v[dp[i]]);
                    cnt-=2;
                }
            }
            sort(res.begin(), res.end());
            for (auto x:res) cout<<x<<' ';
            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