oj.uz

답안 #524880

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
524880 2022-02-10T07:46:18 Z boykut Table Tennis (info1cup20_tabletennis) C++14
100 / 100
 124 ms 3012 KB 
#include <bits/stdc++.h>

using namespace std;

int a[300000], ans[300000], anssize;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	int n, k;
	cin >> n >> k;
	for (int i = 0; i < n + k; i++) {
		cin >> a[i];
	}
	sort(a, a + n + k);

	function<void(int)> check = [&](int sum) {
		anssize = 0;
		int p = 0, l = 0, r = n + k - 1;
		while (l < r) {
			if (a[l] + a[r] > sum) p++, r--;
			else if (a[l] + a[r] < sum) p++, l++;
			else {
				if (anssize < n)
					ans[anssize++] = a[l], ans[anssize++] = a[r];
				l++, r--;
			}
			if (p > k) return;
		}
		sort(ans, ans + anssize);
		l = 0, r = anssize - 1;
		while (l <= r) {
			cout << ans[l++] << ' ';
		}
		exit(0);
	};

	for (int i = 0; i <= k; i++) {
		for (int j = max(i + 1, n - 1); j < n + k; j++) {
			check(a[i] + a[j]);
		}
	}

	return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 588 KB Output is correct
2 Correct 32 ms 2888 KB Output is correct
3 Correct 31 ms 2940 KB Output is correct
4 Correct 32 ms 2888 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 2952 KB Output is correct
2 Correct 36 ms 3012 KB Output is correct
3 Correct 32 ms 2884 KB Output is correct
4 Correct 31 ms 2896 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 232 KB Output is correct
5 Correct 0 ms 204 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 32 ms 2904 KB Output is correct
3 Correct 31 ms 2904 KB Output is correct
4 Correct 32 ms 2908 KB Output is correct
5 Correct 34 ms 3012 KB Output is correct
6 Correct 31 ms 2912 KB Output is correct
7 Correct 31 ms 2900 KB Output is correct
8 Correct 30 ms 2892 KB Output is correct

Subtask #8
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 105 ms 2944 KB Output is correct
3 Correct 31 ms 2948 KB Output is correct
4 Correct 67 ms 2952 KB Output is correct
5 Correct 42 ms 2884 KB Output is correct
6 Correct 32 ms 2884 KB Output is correct
7 Correct 124 ms 2940 KB Output is correct
8 Correct 38 ms 2924 KB Output is correct