제출 #667559

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
667559		mmk	Table Tennis (info1cup20_tabletennis)	C++17	20 / 100	85 ms	3788 KiB

tabletennis

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 16e4+10;
int v[MAXN];
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n,k;
    cin >> n >> k;
    for(int i = 0; i < n+k; i++)
        cin >> v[i];
    sort(v,v+(n+k));
    int curini, curfim;
    int base;

    for(int j = 0; j < n+k; j++)
    {
        int aux = v[j];
        v[j] = -1;
        int marc = 0;
        int marc2 = 0;
        for(int i = 0; i < (n+k)/2; i++)
        {
            curini = v[i+marc];
            curfim = v[n+k-i-1+marc2];
            if(curini == -1)
            {
                marc++;
                curini = v[i+marc];
            }
            if(curfim == -1)
            {
                marc2--;
                curfim = v[n+k-i-1+marc2];
            }
            if(i == 0) base = curfim+curini;
            else if(curini+curfim != base)
            {
                //cerr << "--------------------------------------------------------\n";
                //cerr << curini << " " << curfim;
                //cerr << "\n";
                //cerr << i+marc << " " << (n+k-i-1+marc2);
                //cerr << "\n";
                //cerr << j << " " << aux << "\n";
                //cerr << base << "\n";
                //cerr << "--------------------------------------------------------\n";
                break;
            }
            if(i == ((n+k)/2)-1)
            {
                for(int i = 0; i < n+k; i++)
                {
                    if(v[i] != -1)
                    {
                        cout << v[i];
                        if(i != n+k-1) cout << " ";
                    }
                }
                return 0;
            }
        }
        v[j] = aux;
    }
    //for(int i = 0; i < n; i++)
    //    cout << v[i] << " ";
}

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