QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#506570 | #6429. Let's Play Curling | zzz111 | WA | 91ms | 4812kb | C++20 | 1.4kb | 2024-08-05 19:32:50 | 2024-08-05 19:32:51 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define pii pair<int, int>
#define fr(i, a, b) for (int(i) = (a); (i) <= (b); (i)++)
#define br(i, a, b) for (int(i) = (a); (i) >= (b); (i)--)
#define PI acos(-1)
using namespace std;
int n, m;
const int maxn = 1e5 + 3;
int ans = 0;
void solve()
{
cin >> n >> m;
vector<int> a(n);
vector<int> b(m);
fr(i, 0, n - 1)
{
cin >> a[i];
}
fr(i, 0, m - 1)
{
cin >> b[i];
}
sort(a.begin(), a.end());
sort(b.begin(), b.end());
int ans = 0;
int j = 0;
fr(i, 0, n-1)
{
if(a[i] >= b[0])
{
j = i;
break;
}
ans++;
}
fr(i, 0, m-2)
{
auto t = upper_bound(a.begin(), a.end(), b[i]) - a.begin();
int cnt = 0;
for(j = t; j < n; j++)
{
if(a[j] >= b[i+1])
{
break;
}
cnt++;
}
ans = max(ans, cnt);
}
int cnt = 0;
for(; j < n; j++)
{
if(a[j] > b[m-1])
cnt++;
}
if(ans == 0)
cout<<"Impossible"<<endl;
else
cout << max(ans, cnt) << endl;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int T;
//T = 1;
cin >> T;
while (T--)
{
solve();
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3592kb
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: 91ms
memory: 4812kb
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 Impossible 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 Impossible 2 3 7 12 1 1 1 5 3 4 1 3 2 4 3 Impossible 3 5 4 8 10 6 2 ...
result:
wrong answer 36th lines differ - expected: '3', found: 'Impossible'