Submission #388787

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
388787	2021-04-13T03:04:31 Z	warner1129	Table Tennis (info1cup20_tabletennis)	C++17	100 / 100	381 ms	4596 KB

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.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct

Subtask #2
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	716 KB	Output is correct
2	Correct	39 ms	3048 KB	Output is correct
3	Correct	39 ms	2984 KB	Output is correct
4	Correct	39 ms	3008 KB	Output is correct

Subtask #3
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	38 ms	3072 KB	Output is correct
2	Correct	39 ms	3044 KB	Output is correct
3	Correct	39 ms	3008 KB	Output is correct
4	Correct	39 ms	3088 KB	Output is correct

Subtask #4
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	4 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	3 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct

Subtask #5
9.0 / 9.0

#	Verdict	Memory	Grader output
1	Correct	204 KB	Output is correct
2	Correct	204 KB	Output is correct
3	Correct	204 KB	Output is correct

Subtask #6
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct

Subtask #7
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	42 ms	3024 KB	Output is correct
3	Correct	39 ms	3004 KB	Output is correct
4	Correct	38 ms	3000 KB	Output is correct
5	Correct	39 ms	3088 KB	Output is correct
6	Correct	47 ms	3076 KB	Output is correct
7	Correct	39 ms	3016 KB	Output is correct
8	Correct	39 ms	3016 KB	Output is correct

Subtask #8
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	381 ms	3136 KB	Output is correct
3	Correct	40 ms	4544 KB	Output is correct
4	Correct	158 ms	4580 KB	Output is correct
5	Correct	45 ms	4416 KB	Output is correct
6	Correct	196 ms	4596 KB	Output is correct
7	Correct	191 ms	4544 KB	Output is correct
8	Correct	40 ms	4516 KB	Output is correct

Submission #388787

Compilation message