QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#507068#6429. Let's Play Curling18953267621RE 0ms5648kbC++141.1kb2024-08-06 09:55:342024-08-06 09:55:35

Judging History

你现在查看的是最新测评结果

  • [2024-08-06 09:55:35]
  • 评测
  • 测评结果:RE
  • 用时:0ms
  • 内存:5648kb
  • [2024-08-06 09:55:34]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e6 + 5;
 int n, m;
int c[N];
int coun[N];
double l[N], r[N];
void solve()
{
	vector<int> a;
	vector<int> b;
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
	{
		int j;
		cin >> j;
		a.push_back(j);
	}
	for (int i = 1; i <= m; i++)
	{
		int j;
		cin >> j;
		b.push_back(j);

	}
	sort(b.begin(), b .end());
	for (int u = 0; u <n; u++)
	{

		for (int i = 0; i < m; i++)
		{
			//	cout << b[i] << endl;
			if (a[u] <= b[i])
			{
				if (a[u] == b[i])
				{
					l[u] = 0;
					r[u] = -1;
					break;
				}
				else
				{
					l[u] = (a[u] + b[i - 1])/2;
					r[u] = (a[u] + b[i])/2;
					break;
				}

			}

		}





	}
	int ans = 0;
	for (int i = 0; i < n; i++)
	{
		for (int u = l[i]*2; u <= r[i]*2; u++)
		{
			coun[u]++;
			ans = max(ans, coun[u]);
		}
	}
	if (ans == 0) cout << "Impossible" << endl;
	else cout << ans << endl;








}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin >> t;
	while (t--)
	{
		solve();
	}

}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 5648kb

input:

3
2 2
2 3
1 4
6 5
2 5 3 7 1 7
3 4 3 1 10
1 1
7
7

output:

2
3
Impossible

result:

ok 3 lines

Test #2:

score: -100
Runtime Error

input:

5553
12 19
8 8 11 18 12 9 15 38 6 32 30 30
17 28 33 2 37 20 11 38 36 18 18 30 20 33 13 31 33 37 8
12 6
7 12 14 2 19 2 17 7 4 20 1 13
7 18 23 22 1 16
8 7
5 2 4 2 4 5 8 12
13 16 6 6 5 16 11
5 7
5 13 3 8 3
11 6 9 11 13 8 11
17 19
944782509 244117333 140979583 661724696 617847780 321687699 418677763 725...

output:

1
4
5
Impossible

result: