Submission #481899

#	Time	Username	Problem	Language	Result	Execution time	Memory
481899		Yazan_Alattar	Table Tennis (info1cup20_tabletennis)	C++14	9 / 100	3085 ms	17828 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};

vector <int> v;
int n, k, a[M];
map <int,int> cnt;

int solve(int sum)
{
    int ret = 0;
    for(int i = 1; i <= n + k; ++i) ++cnt[a[i]];
    for(int i = 1; i <= n; ++i){
        if(ret < n && cnt[sum - a[i]]){
            --cnt[sum - a[i]];
            --cnt[a[i]];
            ret += 2;
        }
    }
    return ret >= n;
}

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 + k + 1);
    bool res = 0;
    for(int i = 1; i <= k + 1; ++i){
        for(int j = n; j >= max(i, n - k - 1); --j){
            cnt.clear();
            res = solve(a[i] + a[j]);
            if(res) break;
        }
        if(res) break;
    }
    for(int i = 1; i <= n + k; ++i){
        if(cnt[a[i]]) --cnt[a[i]];
        else 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: 9 / 9
• Subtask 6: 0 / 14
• Subtask 7: 0 / 15
• Subtask 8: 0 / 13