oj.uz

Submission #525449

# Submission time Handle Problem Language Result Execution time Memory
525449 2022-02-11T16:21:12 Z scwadr Table Tennis (info1cup20_tabletennis) C++17
100 / 100
 124 ms 4452 KB 
#include <iostream>
#include <algorithm>

using namespace std;

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

bool 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+1] = a[r];
			anssize+=2;
			l++, r--;
		}
		if (p > k) return false;
	}
	sort(ans, ans + anssize);
	l = 0, r = anssize - 1;
	while (l <= r)
	{
		cout << ans[l++] << ' ';
	}
	return true;
}

int main() 
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> k;
	for (int i = 0; i < n + k; i++)
	{
		cin >> a[i];
	}
	sort(a, a + n + k);
	bool ok = false;
	for (int i = 0; i <= k && !ok; i++)
	{
		for (int j = max(i + 1, n - 1); j < n + k && !ok; j++)
		{
			if (check(a[i] + a[j]))	ok = true;
		}
	}

	return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 656 KB Output is correct
2 Correct 33 ms 2936 KB Output is correct
3 Correct 32 ms 2884 KB Output is correct
4 Correct 32 ms 2896 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 2912 KB Output is correct
2 Correct 32 ms 2912 KB Output is correct
3 Correct 32 ms 2888 KB Output is correct
4 Correct 32 ms 2860 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 2 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 324 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 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 2 ms 512 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 34 ms 2908 KB Output is correct
3 Correct 36 ms 4360 KB Output is correct
4 Correct 37 ms 4328 KB Output is correct
5 Correct 36 ms 4360 KB Output is correct
6 Correct 35 ms 4452 KB Output is correct
7 Correct 34 ms 4412 KB Output is correct
8 Correct 34 ms 4284 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 95 ms 2956 KB Output is correct
3 Correct 33 ms 4328 KB Output is correct
4 Correct 65 ms 4344 KB Output is correct
5 Correct 41 ms 4316 KB Output is correct
6 Correct 37 ms 4352 KB Output is correct
7 Correct 124 ms 4392 KB Output is correct
8 Correct 34 ms 4292 KB Output is correct