제출 #1232133

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1232133		durdona	Table Tennis (info1cup20_tabletennis)	C++20	0 / 100	3094 ms	832 KiB

tabletennis

#include <iostream>
#include <vector>
#include <algorithm>
#include <random>

int main() {
    int n, k;
    std::cin >> n >> k;
    std::vector<int> arr(n + k);
    for (int i = 0; i < n; ++i) {
        std::cin >> arr[i];
    }

    std::random_device rd;
    std::mt19937 gen(rd());

    while (true) {
        std::uniform_int_distribution<> dis1(0, std::min(n + k - 1, k + 15));
        std::uniform_int_distribution<> dis2(0, n + k - 1);
        
        int i = dis1(gen);
        int j = dis2(gen);
        if (i + j >= n + k) continue;

        int s = arr[i] + arr[i + j];
        int l = 0, r = n + k - 1;
        int f = 0;

        while (l < r && f < n) {
            if (arr[l] + arr[r] < s) {
                l++;
            } else if (arr[l] + arr[r] > s) {
                r--;
            } else {
                f += 2;
                l++;
                r--;
            }
        }

        if (f == n) {
            int oks = s;
            std::vector<int> ja;
            l = 0; r = n + k - 1;

            while (l < r && ja.size() < n) {
                if (arr[l] + arr[r] < oks) {
                    l++;
                } else if (arr[l] + arr[r] > oks) {
                    r--;
                } else {
                    ja.push_back(arr[l]);
                    ja.push_back(arr[r]);
                    l++;
                    r--;
                }
            }

            std::sort(ja.begin(), ja.end());
            for (const auto& val : ja) {
                std::cout << val << ' ';
            }
            break;
        }
    }

    return 0;
}

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