QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#612547 | #6429. Let's Play Curling | pugong# | WA | 234ms | 5952kb | C++20 | 868b | 2024-10-05 11:52:18 | 2024-10-05 11:52:19 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 10;
int a[N], b[N];
int n, m;
int find(int x, int y) {
int l = lower_bound(a+1, a + 1 +n+1, x) - a;
int r = lower_bound(a+1, a + 1 +n+1, y) - a-1;
// cout<<l<<' '<<r<<endl;
return r - l + 1;
}
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];
int ans = -1;
a[n + 1] = 1e9 + 10;
b[0] = -1e9 - 10;
sort(a + 1, a + 1 + n);
sort(b + 1, b + 1 + m);
for (int i = 1; i <= m; i++) {
int res = find(b[i - 1], b[i]);
ans = max(ans, res);
}
if (ans<=0)
cout << "Impossible" << endl;
else
cout << ans << endl;
}
int main() {
int T=1;
cin >> T;
while (T--) {
solve();
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 5736kb
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: 234ms
memory: 5952kb
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:
3 5 4 3 4 8 11 5 2 4 5 2 4 1 4 4 2 5 2 3 5 4 2 6 9 1 3 9 2 2 1 1 5 12 2 1 4 5 4 6 12 4 5 6 3 5 4 4 5 2 3 2 4 5 6 2 6 8 3 3 3 1 2 7 2 5 3 2 1 2 5 3 6 3 1 5 2 1 2 3 4 7 9 1 2 3 16 5 5 4 4 4 3 4 3 1 2 3 3 3 2 2 5 2 7 1 1 2 4 Impossible 2 3 7 4 1 1 1 5 3 4 1 3 5 4 3 Impossible 3 5 4 8 4 6 4 6 2 1 6 2 3 ...
result:
wrong answer 1st lines differ - expected: '1', found: '3'