QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#505937 | #6429. Let's Play Curling | Abcl | WA | 262ms | 5100kb | C++14 | 1.2kb | 2024-08-05 13:52:35 | 2024-08-05 13:52:36 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=200005;
int n,m;
int a[100005],b[100005];
void solve(){
cin>>n>>m;
for(int i=1;i<=n;i++)cin>>a[i];
for(int i=1;i<=m;i++)cin>>b[i];
sort(a+1,a+1+n);sort(b+1,b+1+m);
/* for(int i=1;i<=n;i++)cout<<a[i]<<" ";
cout<<endl;
for(int i=1;i<=m;i++)cout<<b[i]<<" ";
cout<<endl;*/
int ans=0;
for(int i=1;i<=n;i++){
int pos2=upper_bound(b+1,b+1+m,a[i])-b;//找到 b中第一个大于a【i】的
if(pos2==m+1)pos2--;
if(b[pos2]==a[i])continue;
int pos1=pos2;
while(b[pos1]>a[i]&&pos1>=2)pos1--;
if(b[pos1]==a[i])continue;
// cout<<"i :"<<i<<" ";
// cout<<"pos1 "<<pos1<<" pos2 "<<pos2<<endl;
int k1=upper_bound(a+1,a+1+n,b[pos1])-a;
int k2=i;
while(a[k2]<b[pos2]&&k2<=n)k2++;
k2--;
// cout<<pos2<<" "<<pos1<<" "<<k2<<" "<<k1<<endl;
ans=max(ans,abs(k2-k1)+1);
// cout<<ans<<endl;
}
if(ans==0)cout<<"Impossible"<<endl;
else cout<<ans<<endl;
return;
}
signed main() {
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int t=1;
cin>>t;
while(t--){
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3604kb
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: 262ms
memory: 5100kb
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 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 2 2 1 3 5 3 2 2 4 4 4 4 11 4 5 6 3 5 4 4 5 4 3 2 4 5 5 2 2 8 3 3 3 2 2 7 2 5 3 3 1 2 5 3 6 4 1 4 2 1 2 3 4 4 9 1 2 4 16 5 2 4 3 4 3 4 3 2 2 3 3 2 2 2 5 2 7 1 1 2 4 6 2 3 7 11 1 1 2 5 3 4 2 3 5 4 3 2 2 5 4 8 9 4 2 6 2 2 6 1 2 6 2 1 9 8 1 2 2 3...
result:
wrong answer 4th lines differ - expected: '3', found: '2'