제출 #1284726

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1284726		AndriaBeridze	Table Tennis (info1cup20_tabletennis)	C++20	72 / 100	3096 ms	45400 KiB

tabletennis

#include <bits/stdc++.h>
    
using namespace std;
int TC = 0;
    
#define int long long
const int INF = (int) 1e18;
const int MOD1 = 1000000007;
const int MOD2 = 998244353;

#define IOS ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define size(v) (int) v.size()
#define YN(x) cout << (x ? "YES\n" : "NO\n");
#define yn(x) cout << (x ? "yes\n" : "no\n");
#define left node * 2, l, (l + r) / 2
#define right node * 2 + 1, (l + r) / 2 + 1, r
#define mark() cout << "[✓] reached line " << __LINE__ << "\n"
#define debug(x) cout << #x << " = " << x << "\n";
     
set<int> st;

bool check(int val, int n) {
    int cnt = 0;
    // cout << val << endl;
    for (auto x : st) {
        if (st.find(val - x) != st.end()) {
            // cout << x << ' ';
            cnt++;
        }
    }
    // cout << endl;

    return cnt >= n;
}

void print(int val, int n) {
    vector<int> ans;
    for (int x : st) {
        if (st.find(val - x) != st.end()) ans.push_back(x);
    }

    for (int i = 0; i < size(ans); i++) {
        if (i < n / 2 || i > size(ans) - n / 2 - 1) {
            cout << ans[i] << ' ';
        }
    }
    cout << endl;
}

void solve() {
    int n, k;
    cin >> n >> k;
    int x[n + k];
    for (int i = 0; i < n + k; i++) {
        cin >> x[i];
        st.insert(x[i]);
    }

    map<int, int> mp;
    int cnt = -1, mx = 0;
    sort(x, x + n);
    for (int i = 0; i <= min(n + k - 1, 2 * k); i++) {
        for (int j = max(0LL, n - k - 2); j < n + k; j++) {
            mp[x[i] + x[j]] ++;
            if (cnt == -1 || cnt < mp[x[i] + x[j]]) {
                mx = x[i] + x[j];
                cnt = mp[x[i] + x[j]];
            }
        }
    }

    for (auto it : mp) {
        if (check(it.first, n)) {
            print(it.first, n);
            return;
        }
    }
}
    
signed main(){
    IOS;
    int q = 1;
    // cin >> q;
    while(++TC <= q) {
        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: 0 / 15
• Subtask 8: 0 / 13