QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#691993 | #6429. Let's Play Curling | atzk# | AC ✓ | 98ms | 3964kb | C++20 | 1.1kb | 2024-10-31 13:35:12 | 2024-10-31 13:35:13 |
Judging History
answer
# include <bits/stdc++.h>
using namespace std;
# ifndef ONLINE_JUDGE
# include "debug.h"
# else
# define debug(...) 0721
# define ps 0721
# endif
using i32 = signed;
using i64 = long long;
void solve() {
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 = 0;
{
int it = lower_bound(a.begin(), a.end(), b[0]) - a.begin();
ans = max(ans, it);
it = a.end() - upper_bound(a.begin(), a.end(), b[m - 1]);
ans = max(ans, it);
}
for(int i = 0; i < m - 1; ++i) {
int it = lower_bound(a.begin(), a.end(), b[i + 1]) - upper_bound(a.begin(), a.end(), b[i]);
ans = max(ans, it);
}
if(ans == 0) cout << "Impossible\n";
else cout << ans << '\n';
}
i32 main() {
ios::sync_with_stdio(0);
cin.tie(0);
i32 t = 1;
cin >> t;
while (t --) {
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3616kb
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: 98ms
memory: 3964kb
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