Submission #49555236

---

Source Code Expand

#include<bits/stdc++.h>
#define int long long
#define lowbit(x) (x&-x) 
using namespace std;
inline int read(){
	int x=0,y=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-') y=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		x=x*10+(ch^48);
		ch=getchar();
	}
	return x*y;
} 
const int INF=1e10;
int T,n,a[200010],b[200010];
void solve(){
	n=read();
	a[0]=-INF,a[n+1]=INF;
	for(int i=1;i<=n;i++){
		a[i]=read();
	}
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++){
		b[i]=read();
	}
	sort(b+1,b+n+1);
	int mx=0;
	for(int i=1;i<=n;i++){
		if(min(a[i]-a[i-1],a[i+1]-a[i])>=b[1]) continue;
		if(a[i]+a[(i==n)?n-1:n]<=b[n]) continue;
		mx=max(mx,i);
	}
	if(mx==0){
		puts("Bob");
		return;
	}
	for(int i=1,j=(a[mx+1]-a[mx]>a[mx]-a[mx-1])?mx-1:mx+1;i<=n;i++){
		while(a[mx]+a[j]<=b[i]||j==mx) j++;
		if(abs(a[mx]-a[j])>=b[i]){
			puts("Bob");
			return;
		}
	}
	puts("Alice");
	return;
}
signed main(){
	T=read();
	while(T--){
		solve();
	}
	return 0;
}

Submission Info

Judge Result