제출 #486851

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
486851		couplefire	Table Tennis (info1cup20_tabletennis)	C++17	11 / 100	276 ms	29884 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;

int n, k, m, arr[200405];

void check(int sum){
    if(sum%2==1) return;
    sum /= 2;
    vector<int> res;
    for(int l = 0, r = m-1; l<r;){
        if(arr[l]+arr[r]==2*sum) res.push_back(arr[l]), res.push_back(arr[r]), ++l, --r;
        else if(sum-arr[l]>arr[r]-sum) ++l;
        else --r;
    }
    while((int)res.size()>n) res.pop_back(), res.pop_back();
    if((int)res.size()<n) return;
    sort(res.begin(), res.end());
    for(auto x : res)
        cout << x << ' ';
    cout << '\n'; exit(0);
}

int main(){
    // freopen("a.in", "r", stdin);
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> k; m = n+k;
    for(int i = 0; i<m; ++i)
        cin >> arr[i];
    sort(arr, arr+m);
    vector<int> todo;
    if(m<4*k){
        for(int i = 0; i<m; ++i)
            for(int j = i+1; j<m; ++j)
                todo.push_back(arr[i]+arr[j]);
        sort(todo.begin(), todo.end());
        todo.erase(unique(todo.begin(), todo.end()), todo.end());
    } else{
        map<int, int> cnt;
        for(int i = 0; i<2*k; ++i)
            for(int j = 0; j<2*k; ++j)
                cnt[arr[i]+arr[m-1-j]]++;
        for(auto [x, y] : cnt)
            if(y>=k) todo.push_back(x);
    }
    for(auto x : todo)
        check(x);
}

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