제출 #1268326

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

tabletennis

#include "bits/stdc++.h"

using namespace std;

#define int long long

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    unsigned seed = std::chrono::high_resolution_clock::now().time_since_epoch().count();
    std::mt19937 rng(seed);
    
    int n, k;
    cin >> n >> k;

    vector <int> a(n + k);
    for (int i = 0; i < n + k; i ++) cin >> a[i];

    auto check = [&] (int sum) -> int {
        map <int, int> mp;
        vector <int> v;
        for (int i = n + k - 1; i >= 0; i --) {
            if (mp[sum - a[i]]) {
                v.push_back(a[i]);
            }

            mp[a[i]] ++;
            if (v.size() == n / 2) break;
        }

        if (v.size() == n / 2) {
            for (int i = n / 2 - 1; i >= 0; i --) v.push_back(sum - v[i]);
            sort(v.begin(), v.end());
            for (int i : v) cout << i << ' ';
            cout << endl;
            return 1;
        } 
        return 0;
    };

    int i = rng() % (k + 1);
    int j = n + k - rng() % (k + 1) - 1;
    int sum = a[i] + a[j];
    map <int, int> mp;
    while (!check(sum)) {
        i = rng() % (k + 1);
        j = n + k - rng() % (k + 1) - 1;

        sum = a[i] + a[j];
        while (mp[sum]) {
            i = rng() % (k + 1);
            j = n + k - rng() % (k + 1) - 1;
        
            sum = a[i] + a[j];
        }

        mp[sum] = 1;
    }

    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: 0 / 15
• Subtask 8: 0 / 13