제출 #481803

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

tabletennis

#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <utility>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 200007;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};

map <int,int> cnt;
int n, k, a[M], sum = -1;

int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> k;
    for(int i = 1; i <= n + k; ++i) cin >> a[i];
    sort(a + 1, a + n + 1);
    if(n <= 1000)
    {
        for(int i = 1; i <= n + k; ++i){
            vector <int> v;
            for(int j = 1; j <= n + k; ++j) if(j != i) v.pb(a[j]);
            int sum = v[0] + v.back(), wr = 0;
            for(int j = 0; j < n / 2; ++j) if(v[j] + v[n - j - 1] != sum) wr = 1;
            if(!wr){
                for(int j = 1; j <= n + k; ++j) if(j != i) cout << a[j] << " ";
                cout << endl;
                break;
            }
        }
    }
    for(int i = 2; i <= n + k; ++i) ++cnt[a[i] - a[i - 1]];
    for(auto i : cnt) if(i.S > cnt[sum]) sum = i.F;
    for(int i = 2; i < n + k; ++i){
        if(a[i] - a[i - 1] != sum && a[i + 1] - a[i] != sum){
            for(int j = 1; j <= n + k; ++j) if(j != i) cout << a[j] << " ";
            cout << endl;
            return 0;

        }
    }
    if(a[2] - a[1] != sum) for(int i = 2; i <= n + k; ++i) cout << a[i] << " ";
    else for(int i = 1; i < n + k; ++i) cout << a[i] << " ";
    cout << endl;
    return 0;
}
// Don't forget special cases. (n = 1?)
// Look for the constraints. (Runtime array? overflow?)

• 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