QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#505936 | #6429. Let's Play Curling | Ink_bai | TL | 0ms | 3752kb | C++20 | 1.3kb | 2024-08-05 13:52:14 | 2024-08-05 13:52:16 |
Judging History
answer
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T;
cin >> T;
while(T--)
{
int n, m;
int aa = 0, bb = 0;
cin >> n >> m;
vector<pair<int, int>> v;
for(int i = 0; i < n; i++)
{
int x;
cin >> x;
v.push_back({x, 0});
aa ++;
}
for(int i = 0; i < m; i++)
{
int x;
cin >> x;
v.push_back({x, 1});
bb ++;
}
sort(v.begin(), v.end());
for(int i = 1; i < v.size(); i++)
{
if(v[i-1].first == v[i].first&&v[i-1].second==0&&v[i].second==1)
{
v.erase(v.begin()+i-1);
aa--;
}
}
if(aa <= 0)
{
cout << "Impossible" << endl;
continue;
}
int l = 0, r = 0;
int maxn = 0;
for(int i = 0; i < v.size(); i++)
{
if(v[i].second == 1||i==v.size()-1)
{
r = i;
maxn = max(maxn, r - l);
l = i;
}
}
cout << maxn - 1 << endl;
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3752kb
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
Time Limit Exceeded
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:
2 4 4 2 4 8 11 4 2 4 5 2 4 1 10 3 2 4 2 3 5 4 1 4 9 1 3 9 1 2 1 3 5 11 2 2 4 4 4 4 11 4 5 6 3 5 4 4 5 1 3 2 4 5 5 2 5 8 3 3 3 1 2 7 2 5 3 3 1 2 5 3 7 4 1 4 1 1 1 3 4 6 9 1 2 3 16 5 4 4 3 4 3 4 3 1 2 3 3 2 2 2 5 2 7 1 1 2 4 6 2 3 7 11 1 1 1 5 3 4 0 3 3 4 3 1 2 5 4 8 9 5 3 6 2 1 6 1 2 6 2 1 9 8 1 1 2 ...