제출 #686607

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
686607		alexdumitru	Table Tennis (info1cup20_tabletennis)	C++14	87 / 100	3084 ms	2964 KiB

tabletennis

#include <iostream>
 
using namespace std;
const int nmax = 150000;
const int kmax = 400;
 
int a[nmax + kmax];
int n, k;
 
pair < int, int > ans[nmax / 2];
 
int check ( int sum ) {
    int st = 0, dr = n + k - 1, cnt = 0;
    while ( st < dr && cnt < n / 2 && st < dr ) {
        if ( a[st] + a[dr] == sum )
            ans[cnt++] = { st++, dr-- };
        else if ( a[st] + a[dr] < sum )
            st++;
        else dr--;
    }
    return cnt >= n / 2;
}
 
 
int main() {
    cin >> n >> k;
 
    for ( int i = 0; i < n + k; i++ )
        cin >> a[i];
 
    bool ok = false;
    for ( int i = 0; i <= k && !ok; i++ )
        for ( int j = n - 1; j < n + k && !ok; j++ )
            if ( i < j && check ( a[i] + a[j] ) )
                ok = true;
 
    for ( int i = 0; i < n / 2; i++ )
        cout << a[ans[i].first] << ' ';
    for ( int i = n / 2 - 1; i >= 0; i-- )
        cout << a[ans[i].second] << ' ';
 
 
    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: 15 / 15
• Subtask 8: 0 / 13