QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#506613 | #6429. Let's Play Curling | Umok | WA | 97ms | 4928kb | C++20 | 1.1kb | 2024-08-05 20:08:31 | 2024-08-05 20:08:32 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define int long long
#define lb(x) (x & (-x))
#define endl '\n'
#define INF LONG_LONG_MAX
#define eps 1e-7
typedef pair<int, int> PII;
const int N = 2e2 + 5;
void solve()
{
int n, m;
cin >> n >> m;
vector<int> ar(n + 2), br(m + 2);
for (int i = 1; i <= n; i++)
cin >> ar[i];
for (int i = 1; i <= m; i++)
cin >> br[i];
ar[0] = br[0] = 0;
ar[n + 1] = br[m + 1] = INF;
sort(ar.begin(), ar.end());
sort(br.begin(), br.end());
int ans = -1;
for (int i = 1; i <= m + 1; i++)
{
int l = upper_bound(ar.begin(), ar.end(), br[i - 1]) - ar.begin();
int r = lower_bound(ar.begin(), ar.end(), br[i]) - ar.begin();
r--;
if (l >= n || l > r || r == 0)
continue;
ans = max(ans, r - l + 1);
}
if (ans == -1)
cout << "Impossible" << endl;
else
cout << ans << endl;
}
signed main()
{
IOS;
int tcase;
cin >> tcase;
while (tcase--)
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3808kb
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: 97ms
memory: 4928kb
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 Impossible 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 Impossible 2 4 7 2 3 7 12 Impossible 1 1 5 3 4 Impossible 3 2 4 3 2 3 5 4 ...
result:
wrong answer 31st lines differ - expected: '1', found: 'Impossible'