QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#506595 | #6429. Let's Play Curling | zhangas | WA | 104ms | 5964kb | C++14 | 1.4kb | 2024-08-05 19:57:53 | 2024-08-05 19:57:53 |
Judging History
answer
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0),cout.tie(0)
#define endl '\n'
#define PII pair<int,int>
#define int long long
//#define int __int128
using namespace std;
const int N = 2e5 + 10, M = 1e2 + 10, mod = 998244353, inf = 0x3f3f3f3f, base = 131;
const double eps = 1e-12;
void solve(){
int n, m;
cin >> n >> m;
vector<int> a, b;
for(int i = 0; i < n; i++){
int x; cin >> x;
a.push_back(x);
}
for(int i = 0; i < m; i++){
int x; cin >> x;
b.push_back(x);
}
a.push_back(-inf);
a.push_back(inf);
b.push_back(-inf);
b.push_back(inf);
sort(a.begin(), a.end());
sort(b.begin(), b.end());
int ans = 0;
for(int i = 1; i < m; ++ i){
int pl = b[i], pr = b[i + 1];
int l = upper_bound(a.begin(), a.end(), pl) - a.begin();
int r = lower_bound(a.begin(), a.end(), pr - 1) - a.begin();
int f = 0;
if(a[l] == inf || a[r] == -inf){
continue;
}
if(a[l] == -inf){
l = 1;
}
if(a[r] == inf){
r = n;
}
ans = max(ans, r - l + 1);
}
if(ans) cout << ans << endl;
else cout << "Impossible" << endl;
}
signed main()
{
IOS;
int T = 1;
cin >> T;
while (T--)
solve();
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3564kb
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: 104ms
memory: 5964kb
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 2 1 5 9 12 4 2 4 6 2 3 1 5 3 3 4 3 4 6 4 1 5 10 2 4 10 Impossible 2 1 2 4 1 3 1 5 5 4 5 11 5 5 Impossible 4 6 5 5 6 1 4 3 5 5 6 3 2 9 4 3 4 2 3 8 1 5 3 3 2 3 6 3 6 3 2 5 1 1 1 1 3 1 9 2 3 Impossible 17 6 Impossible 4 2 5 3 5 3 2 1 3 4 3 2 3 6 3 7 2 1 2 5 Impossible 3 4 8 5 1 2 2 6 3 5 Impossible...
result:
wrong answer 1st lines differ - expected: '1', found: '2'