QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#644411 | #6429. Let's Play Curling | rush-from-behind# | WA | 54ms | 4540kb | C++17 | 1021b | 2024-10-16 13:48:47 | 2024-10-16 13:48:48 |
Judging History
answer
// sis puella oier
#include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
ll read(){
ll xx = 0, f = 1; char ch = getchar();
for (;!isdigit(ch); ch = getchar())
f = (ch == '-' ? -1 : 1);
for (; isdigit(ch); ch = getchar())
xx = (xx << 3) + (xx << 1) + ch - '0';
return xx * f;
}
int n, m, a[100100], b[100100], ans;
void solve(){
n = read(), m = read();
for (int i = 1; i <= n; ++i)a[i] = read();
for (int i = 1; i <= m; ++i)b[i] = read();
sort(a + 1, a + n + 1), sort(b + 1, b + m + 1);
b[0] = 0, b[m + 1] = a[n + 1];
ans = 0;
for (int i = 0, l = 1, r = 1; i <= m; ++i){
while(r <= n && a[r] < b[i + 1])++r;
while(l <= n && a[l] <= b[i])++l;
// cout<<i<<" "<<l<<" "<<r<<endl;
ans = max(ans, r - l);
}
if (ans == 0){printf("Impossible\n");}
else printf("%d\n", ans);
}
signed main(){
int _ = read();
while(_--)solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3900kb
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: 54ms
memory: 4540kb
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 7 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 6 3 5 4 4 5 1 3 2 4 5 5 2 6 8 3 4 3 1 2 7 2 5 3 2 1 2 5 3 6 3 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 4 1 1 1 5 3 4 1 3 2 4 3 2 3 5 4 8 4 6 2 6 2 1 6 1 3 6 2 1 9 8 1 2 3 2 ...
result:
wrong answer 15th lines differ - expected: '11', found: '7'