QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#748671 | #6429. Let's Play Curling | zhaomumu1218 | AC ✓ | 254ms | 16440kb | C++14 | 857b | 2024-11-14 21:02:09 | 2024-11-14 21:02:09 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxn=100010,maxm=100010;
int n,m,a[maxn],b[maxm],ans,len;
map<int,int>mp;
struct node{
int z,y;
bool operator<(const node t)const{
return z<t.z;
}
}x[maxn+maxm];
void solve(){
mp.clear();
len=ans=0;
scanf("%lld%lld",&n,&m);
for(int i=1;i<=n;i++) scanf("%lld",a+i);
for(int i=1;i<=m;i++) scanf("%lld",b+i),mp[b[i]]=1,x[++len]=(node){b[i],2};
for(int i=1;i<=n;i++) if(mp[a[i]]==0) x[++len]=(node){a[i],1};
sort(x+1,x+1+len);
int u=0;
for(int i=1;i<=len;i++){
if(x[i].y==1) u++;
else u=0;
ans=max(ans,u);
}
if(ans==0){printf("Impossible\n");return;}
printf("%lld\n",ans);
}
signed main(){
int T;
scanf("%lld",&T);
while(T--) solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 5996kb
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: 0
Accepted
time: 254ms
memory: 16440kb
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 11 3 2 4 2 3 5 4 1 4 9 1 3 9 2 2 1 4 5 12 2 3 4 5 4 4 11 4 5 7 3 5 4 4 5 1 3 2 4 5 5 2 6 8 3 4 3 2 2 7 2 5 3 4 1 2 5 3 6 5 1 4 1 1 2 3 4 7 9 1 2 3 16 5 5 4 3 4 3 4 3 1 2 3 3 2 2 2 5 2 7 1 1 2 4 7 2 3 7 12 1 1 1 5 3 4 1 3 2 4 3 2 3 5 4 8 10 6 2 6 2 1 6 1 3 6 2 1 9 8 1 2 3...
result:
ok 5553 lines