Submission #692276

#	Time	Username	Problem	Language	Result	Execution time	Memory
692276		NeroZein	Table Tennis (info1cup20_tabletennis)	C++14	87 / 100	3069 ms	13756 KiB

tabletennis

/*
 *    author: NeroZein
 *    created: 01.02.2023 12:23:57
*/
#include <bits/stdc++.h>
#define int long long
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, k;
	cin >> n >> k;
	vector<int> a(n + k);
	map<int, bool> mp; 
	for (int i = 0; i < n + k; ++i) {
		cin >> a[i]; 
		mp[a[i]] = 1; 
	}
	sort(a.begin(), a.end()); 
	for (int i = 0; i <= k; ++i) {
		for (int j = n + k - 1; j > i; --j) {
			int cnt = i + (n + k - j - 1); 
			if (cnt > k) {
				break; 
			}
			int tar = a[i] + a[j];
			for (int x = i + 1; x < j; ++x) {
				if (!mp.count(tar - a[x])) {
					cnt++;
				}
			}
			if (cnt == k) {
				//deb(
				vector<int> ans; 
				for (int x = i; x <= j; ++x) {
					if (mp.count(tar - a[x])) {
						ans.push_back(a[x]);
					}
				}
				for (int x : ans) {
					cout << x << ' ';
				}
				return 0; 
			}
		}
	}
	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