제출 #717884

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
717884		vjudge1	Table Tennis (info1cup20_tabletennis)	C++17	49 / 100	622 ms	56844 KiB

tabletennis

#include "bits/stdc++.h"
#define ll long long
using namespace std;
const ll mod = 1000000007;

int b[150001], cnt[150001];

signed main () {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    // freopen("cowland.in","r",stdin);
    // freopen("cowland.out","w",stdout);

    int n, k;
    cin >> n >> k;
    vector<int> v;
    set<int> ss;
    for(int i = 0; i < n + k; i++) {
        int x;
        cin >> x;
        ss.insert(x);
        v.push_back(x);
    }
    map<int, int> c;
    int o = 1;
    for(int i : ss)
        c[i] = o++;
    for(int i = 0; i < n + k; i++)
        cnt[c[v[i]]]++;
    sort(v.begin(), v.end());
    set<int> s;
    for(int i = 0; i <= k; i++) {
        int j = n + k - 1;
        while(i < j && i + ((n + k) - j - 1) <= k)
            s.insert(v[i] + v[j--]);
    }
    for(int x : s) {
        int y = 0;
        for(int i = 0; i < n + k; i++) {
            if(cnt[c[v[i]]] - b[c[v[i]]] && x - v[i] >= 0 && cnt[c[x - v[i]]] - b[c[x - v[i]]]) {
                b[c[v[i]]]++, b[c[x - v[i]]]++;
                y += 2;
                if(y == n)
                    break;
            }
        }
        if(y >= n) {
            set<int> ans;
            for(int i = 0; i < n + k; i++) {
                if(b[c[v[i]]]) {
                    b[c[v[i]]]--;
                    ans.insert(v[i]);
                }
            }
            for(int i : ans)
                cout << i << " ";
            return 0;
        }
        for(int i = 0; i < n + k; i++)
            b[c[v[i]]] = 0;
    }

    return 0;
}

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