제출 #385723

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
385723		Osama_Alkhodairy	Table Tennis (info1cup20_tabletennis)	C++17	66 / 100	139 ms	3836 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long

int n, k;
vector <int> a;

bool check(int s){
    int l = 0, r = n - 1;
    int cnt = (n - k) / 2;
    while(l < r){
        if((r - l + 1) / 2 < cnt) return 0;
        if(a[l] + a[r] > s) r--;
        else if(a[l] + a[r] < s) l++;
        else{
            cnt--;
            l++; r--;
        }
        if(cnt == 0) return 1;
    }
    return 0;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> k;
    n += k;
    a.resize(n);
    for(auto &i : a) cin >> i;
    vector <int> all;
    for(int i = 0 ; i < k ; i++){
        for(int j = n - k - 1 ; j < n ; j++){
            all.push_back(a[i] + a[j]);
        }
    }
    sort(all.begin(), all.end());
    all.resize(unique(all.begin(), all.end()) - all.begin());
    int s = -1;
    for(auto &i : all){
        if(check(i)){
            s = i;
            break;
        }
    }
    assert(s > 0);
    vector <int> ans;
    int l = 0, r = n - 1;
    while(l <= r){
        if(a[l] + a[r] > s) r--;
        else if(a[l] + a[r] < s) l++;
        else{
            ans.push_back(a[l]);
            ans.push_back(a[r]);
            l++; r--;
        }
    }
    sort(ans.begin(), ans.end());
    for(auto &i : ans) cout << i << " ";
    cout << endl;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 9
• Subtask 3: 0 / 14
• Subtask 4: 15 / 15
• Subtask 5: 9 / 9
• Subtask 6: 14 / 14
• Subtask 7: 15 / 15
• Subtask 8: 13 / 13