QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#707293 | #6429. Let's Play Curling | dqw | WA | 227ms | 4852kb | C++23 | 789b | 2024-11-03 15:24:10 | 2024-11-03 15:24:17 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
template<typename T>void chmin(T &x,T y)
{
x=min(x,y);
}
template<typename T>void chmax(T &x,T y)
{
x=max(x,y);
}
void ymgg()
{
int n,m;cin>>n>>m;
vector<int>a(n),b(m);
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<m;i++) cin>>b[i];
sort(a.begin(),a.end());
sort(b.begin(),b.end());
int ans=-1;
for(int i=0;i<m-1;i++){
int l=upper_bound(a.begin(),a.end(),b[i])-a.begin();
int r=lower_bound(a.begin(),a.end(),b[i+1])-a.begin();
if(l>=r-1) continue;
ans=max(ans,r-l);
}
if(ans==-1) cout<<"Impossible"<<'\n';
else cout<<ans<<'\n';
}
int32_t main()
{
int t;cin>>t;
while(t--)ymgg();
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3828kb
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: 227ms
memory: 4852kb
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:
Impossible 3 Impossible Impossible 4 8 11 4 2 4 5 2 4 Impossible 4 3 2 4 2 3 5 4 Impossible 4 9 Impossible 3 9 Impossible 2 Impossible Impossible 5 Impossible 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 Impossible 2 7 2 5 3 2 Impossible 2 5 3 6 3 Impossible 4 Im...
result:
wrong answer 1st lines differ - expected: '1', found: 'Impossible'