QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#418751#6429. Let's Play Curlingwiseman123#WA 190ms15480kbC++20882b2024-05-23 15:32:002024-05-23 15:32:01

Judging History

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

  • [2024-05-23 15:32:01]
  • 评测
  • 测评结果:WA
  • 用时:190ms
  • 内存:15480kb
  • [2024-05-23 15:32:00]
  • 提交

answer

#include <bits/stdc++.h>
#define int long long
const int maxn=2e5+10;
using namespace std;
int a[maxn],b[maxn],c[maxn];
map<int,int> mp;
void solve()
{
	mp.clear();
	int n,m;
	cin>>n>>m;
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=1;i<=m;i++)
	{
		cin>>b[i];
		mp[b[i]]=1;
	}
	sort(a+1,a+1+n);
	sort(b+1,b+1+m);
	int s=1,t=1,num=0;
	while(s<=n||t<=m)
	{
		if(t>m||(s<=n&&a[s]<=b[t]))
		{
			// cout<<a[s]<<endl;
			c[++num]=a[s++];
		}
		else
		{
			// cout<<b[t]<<endl;
			c[++num]=b[t++];
		}
	}
	int ans=0,tmp=0;
	for(int i=1;i<=num;i++)
	{
		if(!mp[c[i]])
		{
			tmp++;
		}
		else
		{
			ans=max(ans,tmp);
			tmp=0;
		}
	}
	if(ans==0)
	cout<<"Impossible"<<endl;
	else
	cout<<ans<<endl;
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);

	int t;
	cin>>t;
	while(t--)
	{
		solve();
	}
	return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 5608kb

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
Wrong Answer
time: 190ms
memory: 15480kb

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
3
4
3
4
8
11
4
2
4
5
2
4
1
4
3
2
4
2
3
5
4
1
4
9
1
3
9
2
2
1
1
5
12
2
Impossible
4
5
4
4
11
4
5
6
3
5
4
4
5
1
3
2
4
5
5
2
6
8
3
2
3
1
2
7
2
5
3
2
1
2
5
3
6
3
1
4
1
1
2
3
4
7
9
1
2
3
16
5
5
4
3
4
3
4
3
1
1
3
3
2
2
2
5
2
7
1
1
2
4
Impossible
2
3
7
4
1
1
1
5
3
4
1
3
2
4
3
Impossible
3
5
4
8
4
6
2
6
2...

result:

wrong answer 15th lines differ - expected: '11', found: '4'