QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#606846 | #6429. Let's Play Curling | karito# | WA | 95ms | 4516kb | C++17 | 901b | 2024-10-03 12:38:33 | 2024-10-03 12:38:34 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
void solve()
{
int n,m;
cin >> n >> m;
vector<int> a,b;
for(int i=1;i<=n;i++)
{
int x;
cin >> x;
a.push_back(x);
}
for(int i=1;i<=m;i++)
{
int x;
cin >> x;
b.push_back(x);
}
b.push_back(-1);
b.push_back(1e9+10);
sort(a.begin(),a.end());
sort(b.begin(),b.end());
int ans=0;
for(int i=1;i<=m;i++)
{
int l=b[i],r=b[i+1];
int p1=upper_bound(a.begin(),a.end(),l)-a.begin();
int p2=lower_bound(a.begin(),a.end(),r)-a.begin();
ans=max(ans,p2-p1);
}
if(ans==0) cout << "Impossible\n";
else cout << ans << "\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T;
cin >> T;
while(T--) solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3632kb
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: 95ms
memory: 4516kb
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 11 3 2 4 2 3 5 4 1 4 9 1 3 9 1 2 1 4 5 4 2 3 4 4 4 4 11 4 5 7 3 5 4 4 5 1 3 2 4 5 5 2 2 8 3 4 3 2 2 7 2 5 3 4 1 2 5 3 6 5 1 4 1 1 Impossible 3 4 5 9 1 2 1 16 5 Impossible 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 Impossible 3 2 4 3 2 Impossi...
result:
wrong answer 3rd lines differ - expected: '4', found: '1'