제출 #1319471

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

tabletennis

#include <bits/stdc++.h>
#define GOOD_LUCK ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
#define ff first
#define ss second
#define pb push_back
#define all(v) v.begin(), v.end()
using namespace std;

constexpr int MAX = 3e+8 + 1, INF = 2e+16, MOD = 1e+9 + 7, K = 31;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int get(int l, int r) {
    int sz = r - l + 1;
    return l + rng() % sz;
}

bool solve(int n, int k, vector <int> &v, int e) {
    for (int z1 = max(0LL, e - k); z1 <= min(n-1, e + k); z1++) {
        int z = n - z1;
        if (e == z) continue;
        int s = v[e] + v[z];
        map <int, int> m;
        for (int &i : v) m[i]++;
        int res=0;
        for (int &i : v) {
            if (m[s-i] && i != s - i) res++;
        }
        if (res >= n-k) {
            int x = n - k;
            for (int &i : v) {
                if (!x) break;
                if (m[s-i] && i != s - i) {
                    cout << i << ' ';
                    x--;
                }
            }
            return 1;
        }
    }
    return 0;
}

void _() {
    int n, k;
    cin >> n >> k;
    n += k;
    vector <int> v(n);
    for (int &i : v) cin >> i;
    sort(all(v));
    vector <int> id;
    for (int i = 0; i < n; i++) id.pb(i);
    shuffle(all(id), rng);
    for (int &i : id) {
        if (solve(n, k, v, i)) break;
    }
}

signed main() {

    GOOD_LUCK

    int tests=1;
    // cin >> tests;
    for (int i=1; i <= tests; i++) {
        _();
        cout << endl;
    }

    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