QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#571901 | #6429. Let's Play Curling | xly_tyty# | WA | 101ms | 7692kb | C++17 | 764b | 2024-09-18 10:07:05 | 2024-09-18 10:07:07 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const long long N=1e6+10,mod=998244353,INF=1e15;
ll n,m,k,a[N],b[N];
bool st[N];
void solve()
{
cin>>n>>m;
for(int i=1;i<=n;i++)cin>>a[i];
for(int i=1;i<=m;i++)cin>>b[i];
sort(a+1,a+1+n);
sort(b+1,b+1+m);
int ans=0;
for(int i=1;i<=m-1;i++)
{
if(b[i]>=a[n])continue;
int id=upper_bound(a+1,a+1+n,b[i])-a;
int idx;
if(b[i+1]>a[n])idx=n;
else idx=lower_bound(a+1,a+1+n,b[i+1])-a-1;
ans=max(ans,idx-id+1);
}
if(ans)cout<<ans<<endl;
else cout<<"Impossible"<<endl;
}
signed main()
{
cin.tie(0), cout.tie(0), ios::sync_with_stdio(false);
int T;cin>>T;
while(T--)solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 7680kb
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: 101ms
memory: 7692kb
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 1 Impossible 4 8 11 4 2 4 5 2 4 1 4 3 2 4 2 3 5 4 1 4 9 1 3 9 Impossible 2 1 1 5 1 2 Impossible 4 4 4 4 11 4 5 Impossible 3 5 4 4 5 Impossible 3 2 4 5 5 2 2 8 3 2 3 1 2 7 2 5 3 2 1 2 5 3 6 3 1 4 Impossible 1 Impossible 3 4 Impossible 9 1 2 Impossible 16 5 Impossible 4 3 4 3 4 3 1 1 3 3 2 2 2 5 2...
result:
wrong answer 3rd lines differ - expected: '4', found: '1'