Submission #717409

#	Time	Username	Problem	Language	Result	Execution time	Memory
717409		vjudge1	Table Tennis (info1cup20_tabletennis)	C++17	9 / 100	145 ms	38928 KiB

tabletennis

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

#define int long long

const int mxN = 2e5 + 7;

int arr[mxN];

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    int n, k;
    cin >> n >> k;
    
    //bitset<2000000001> in;
    map<int,bool> in;
    for (int i = 0; i < n + k; ++i) {
        cin >> arr[i];
        in[arr[i]] = true;
    }
    
    map<int,int> freq;
    for (int i = 0; i < max(k, (int) sqrt(n));  ++i) {
        for (int j = n + k - 1; j >= n + k - max(k, (int) sqrt(n)) && j > i; --j) {
            int sum = arr[i] + arr[j];
            freq[sum]++;
        }
    }

    int mx = 0, sum = 0;
    for (auto p : freq) {
        if (p.second > mx) {
            mx = p.second;
            sum = p.first;
        }
    }

    vector<int> nums;
    for (int l = 0; l < n + k; ++l) {
        if (sum - arr[l] >= 0 && in[sum - arr[l]]) {
            nums.push_back(arr[l]);
        }
    }
    
    for (int l = 0; l < n; ++l) {
        cout << nums[l] << ' ';
    }
    cout << "\n";
}
// 1 2 1 2 3

• Subtask 1: 0 / 11
• Subtask 2: 9 / 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