QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#602766 | #6429. Let's Play Curling | lonelywolf# | WA | 94ms | 6740kb | C++20 | 801b | 2024-10-01 12:43:13 | 2024-10-01 12:43:13 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve()
{
int n, m;
cin >> n >> m;
vector<pair<int, int>> a(n + m);
for(int i = 0; i < n; ++i) {
int x;
cin >> x;
a[i].first = x;
a[i].second = 1;
}
for(int i = n; i < n + m; ++i) {
int x;
cin >> x;
a[i].first = x;
a[i].second = 0;
}
sort(a.begin(), a.end());
int ans = 0, cur = 0, last = -1;
for(auto &[x, c] : a) {
if(c == 0) {
ans = max(ans, cur);
cur = 0;
last = x;
} else if(x != last) {
++cur;
}
}
if(ans != 0)
cout << ans << '\n';
else
cout << "Impossible\n";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T;
cin >> T;
while(T--) solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3824kb
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: 94ms
memory: 6740kb
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 4 3 2 4 2 3 5 4 1 4 9 1 3 9 2 2 1 1 5 12 2 Impossible 4 5 4 4 11 4 5 6 3 5 4 4 5 1 3 2 4 5 5 2 6 8 3 2 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 1 3 3 2 2 2 5 2 7 1 1 2 4 Impossible 2 3 7 4 1 1 1 5 3 4 1 3 2 4 3 Impossible 3 5 4 8 4 6 2 6 2...
result:
wrong answer 15th lines differ - expected: '11', found: '4'