QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #697775 | #6429. Let's Play Curling | 552Hz# | WA | 191ms | 7700kb | C++14 | 3.3kb | 2024-11-01 15:43:38 | 2024-11-01 15:43:38 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
const int N=200010;
const ll mod=998244353;
int n,m;
ll a[N],b[N];
void solve(){
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>a[i];a[i]*=2;
}
std::vector<ll> q;
for(int i=1;i<=m;i++){
cin>>b[i];b[i]*=2;
q.push_back(b[i]);
}
ll ans=0;
sort(q.begin(),q.end());
q.push_back(1e17);
sort(a+1,a+1+n);
sort(b+1,b+1+m);
for(int i=1;i<=n;i++){
ll pos=a[i];
ll w=lower_bound(q.begin(),q.end(),pos)-q.begin();
ll dis=1e18;
dis=min(dis,q[w]-pos);
if(w!=0){
w--;
}
dis=min(dis,pos-q[w]);
//cout<<dis<<" ";
int r=0,l=0;
if(dis==0){
continue;
}
for(int j=20;j>=0;j--){
if((r+(1<<j))+i>n){
continue;
}
if(a[(r+(1<<j))+i]-a[i]<dis){
r+=(1<<j);
}
}
for(int j=20;j>=0;j--){
if(i-(l+(1<<j))<1){
continue;
}
if(a[i]-a[i-(l+(1<<j))]<dis){
l+=(1<<j);
}
}
r=r+i;
l=i-l;
ans=max(ans,1ll*(r-l+1));
}
for(int i=1;i<n;i++){
ll pos=(a[i]+a[i+1])/2;
ll w=lower_bound(q.begin(),q.end(),pos)-q.begin();
ll dis=1e18;
dis=min(dis,q[w]-pos);
if(w!=0){
w--;
}
dis=min(dis,pos-q[w]);
//cout<<dis<<" ";
int r=0,l=0;
if(dis==0){
continue;
}
for(int j=20;j>=0;j--){
if((r+(1<<j))+i>n){
continue;
}
if(a[(r+(1<<j))+i]-pos<dis){
r+=(1<<j);
}
}
for(int j=20;j>=0;j--){
if(i-(l+(1<<j))<1){
continue;
}
if(a[i]-a[i-(l+(1<<j))]<dis){
l+=(1<<j);
}
}
r=r+i;
l=i-l;
ans=max(ans,1ll*(r-l+1));
}
for(int i=1;i<m;i++){
ll pos=(b[i]+b[i+1])/2;
ll w=lower_bound(q.begin(),q.end(),pos)-q.begin();
ll dis=1e18;
dis=min(dis,q[w]-pos);
if(w!=0){
w--;
}
dis=min(dis,pos-q[w]);
//cout<<dis<<" ";
int r=0,l=(1<<21)-1;
if(dis==0){
continue;
}
for(int j=20;j>=0;j--){
if((r+(1<<j))>n){
continue;
}
if(a[r+(1<<j)]-pos<dis){
r=(r+(1<<j));
}
}
for(int j=20;j>=0;j--){
if((l)>n){
l-=(1<<j);
continue;
}
if(pos-a[l]<dis){
l=(l-(1<<j));
}
}
ans=max(ans,1ll*(r-l));
}
ll pos=(-1e9)/2;
ll w=lower_bound(q.begin(),q.end(),pos)-q.begin();
ll dis=1e18;
dis=min(dis,q[w]-pos);
if(w!=0){
w--;
}
dis=min(dis,pos-q[w]);
//cout<<dis<<" ";
int r=0,l=(1<<21)-1;
for(int j=20;j>=0;j--){
if((r+(1<<j))>n){
continue;
}
if(a[r+(1<<j)]-pos<dis){
r=(r+(1<<j));
}
}
for(int j=20;j>=0;j--){
if((l)>n){
l-=(1<<j);
continue;
}
if(pos-a[l]<dis){
l=(l-(1<<j));
}
}
ans=max(ans,1ll*(r-l));
pos=(1ll*10000000000)/2;
w=lower_bound(q.begin(),q.end(),pos)-q.begin();
dis=1e18;
dis=min(dis,q[w]-pos);
if(w!=0){
w--;
}
dis=min(dis,pos-q[w]);
//cout<<dis<<" ";
r=0,l=(1<<21)-1;
for(int j=20;j>=0;j--){
if((r+(1<<j))>n){
continue;
}
if(a[r+(1<<j)]-pos<dis){
r=(r+(1<<j));
}
}
for(int j=20;j>=0;j--){
if((l)>n){
l-=(1<<j);
continue;
}
if(pos-a[l]<dis){
l=(l-(1<<j));
}
}
ans=max(ans,1ll*(r-l));
if(ans==0){
cout<<"Impossible"<<endl;
}else{
cout<<ans<<endl;
}
//cout<<ans<<endl;
}
int main(){
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int _=1;
cin>>_;
while(_--){
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 5628kb
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: 191ms
memory: 7700kb
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:
5 6 4 2 8 8 12 9 2 6 6 3 8 2 12 4 4 6 3 6 5 4 3 7 10 1 4 9 2 2 1 5 5 10 4 4 9 8 7 9 12 10 7 10 4 11 5 4 7 2 4 6 8 12 8 4 4 8 8 5 5 3 3 9 2 6 6 7 2 3 8 3 7 6 1 6 2 2 2 3 6 5 13 1 2 3 16 8 2 4 8 7 5 7 4 2 4 4 8 7 2 3 9 3 12 1 1 2 8 7 5 8 11 13 1 1 2 6 5 5 1 3 7 8 9 2 1 8 8 10 12 9 4 8 4 2 7 2 3 7 4 1 ...
result:
wrong answer 1st lines differ - expected: '1', found: '5'