oj.uz

Submission #388781

# Submission time Handle Problem Language Result Execution time Memory
388781 2021-04-13T02:34:31 Z warner1129 Table Tennis (info1cup20_tabletennis) C++17
34 / 100
 105 ms 3120 KB 
#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) break;
			}
		}
	}
	return ret;
}

void solve() {
	cin >> n >> m;
	n += m;
	for (int i = 1; i <= n; i++) cin >> arr[i];
	int lim = min(n>>1, m*3);
	for (int i = 1; i <= lim && ans.empty(); i++)
		for (int j = n; j >= n - lim; j--)
			if (Find(arr[i] + arr[j], false) >= n-m) {	
				Find(arr[i] + arr[j], true);
				break;
			}
	sort(ans.begin(), ans.end());
	for (int i = 0, len = ans.size(); i < len; i++)
		cout << ans[i] << " \n"[i == len-1];
}

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 42 ms 3108 KB Output is correct
3 Correct 39 ms 3040 KB Output is correct
4 Correct 39 ms 3112 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 3008 KB Output is correct
2 Correct 39 ms 3120 KB Output is correct
3 Correct 43 ms 3104 KB Output is correct
4 Correct 39 ms 3064 KB Output is correct

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 204 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 0 ms 204 KB Unexpected end of file - int32 expected

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 105 ms 204 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -