제출 #751562

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
751562		aykhn	Table Tennis (info1cup20_tabletennis)	C++14	0 / 100	27 ms	2892 KiB

tabletennis

#include <bits/stdc++.h>

// author: aykhn

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;


#define OPT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define all(v) v.begin(), v.end()
#define mpr make_pair
#define eb emplace_back
#define pb push_back
#define ts to_string
#define fi first
#define se second
#define ins insert
#define int ll
#define inf 0x3F3F3F3F
#define infll 0x3F3F3F3F3F3F3F3FLL
#define bpc __builtin_popcount

int n, k;
vector<int> v;

bool solve(int del)
{
    int i = 0;
    int j = 1;
    if (i == del)
    {
        i++;
    }
    if (j == del)
    {
        j++;
    }
    int x = v[j] - v[i];


    for (; j < n + k; j++, i++)
    {
        if (i == del)
        {
            i++;
            continue;
        }
        if (j == del)
        {
            j++;
            continue;
        }
        if (v[j] - v[i] != x)
        {
            return false;
        }

        x = v[j] - v[i];
    }

    return true;
}

void _()
{
    cin >> n >> k;

    v.assign(n + k, 0);

    for (int i = 0; i < n + k; i++)
    {
        cin >> v[i];
    }

    sort(all(v));

    for (int i = 0; i < n + k; i++)
    {
        if (solve(i))
        {
            for (int j = 0; j < n + k; j++)
            {
                if (j == i) continue;

                cout << v[j] << " ";
            }
            cout << endl;
            return;
        }
    }
}
int32_t main()
{
    OPT;
    _();
}

• 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