Submission #388787

#	Time	Username	Problem	Language	Result	Execution time	Memory
388787		warner1129	Table Tennis (info1cup20_tabletennis)	C++17	100 / 100	381 ms	4596 KiB

tabletennis

#include <bits/stdc++.h>

using namespace std;

const int maxn = 3e5 + 5;

int arr[maxn];
int n, m;
vector<int> ans;

int Find(int x, bool key) {
	int ret = 0;
	for (int i = 1, j = n; i < j; i++) {
		while (i < j && arr[i] + arr[j] > x) j--;
		if (i < j && arr[i] + arr[j] == x) {
			ret += 2;
			if (key) {
				ans.emplace_back(arr[i]);
				ans.emplace_back(arr[j]);
			}
			if (ret == n - m) return ret;
		}
		if (j - i - 1 + ret < n - m - m) return 0;
	}
	return ret;
}

void solve() {
	cin >> n >> m;
	n += m;
	for (int i = 1; i <= n; i++) cin >> arr[i];
	int lim = min(n, m+2);
	for (int i = 1; i <= lim; i++)
		for (int j = n; j >= n - lim; j--)
			if (i < j && Find(arr[i] + arr[j], false) >= n-m) {	
				Find(arr[i] + arr[j], true);
				sort(ans.begin(), ans.end());
				for (int v : ans) cout << v << ' ';
				cout << '\n';
				return;
			}
	return;
}

signed main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	solve();
	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: 13 / 13