提出 #76240932

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define int long long
#define ll long long
#define ull unsigned long long
#define inf 1e18
#define eps 1e-9
#define endl "\n"
#define il inline
#define ls 2*k
#define rs 2*k+1
using namespace std;
const int N=2e5+5,M=2e6+5;
const int mod=998244353;
inline int read(){
    int x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9'){
        if(ch=='-') f=-1;
        ch=getchar();
    }
    while(ch>='0' && ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
long double a,b,c,d,r1,r2;
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int tc;cin>>tc; 
	while(tc--){
		cin>>a>>b>>r1>>c>>d>>r2;
		long double dis=sqrt((a-c)*(a-c)+(b-d)*(b-d));
//		cout<<(a-c)*(a-c)<<' '<<(b-d)*(b-d)<<' '<<(a-c)*(a-c)+(b-d)*(b-d)<<'\n'; 
		if(dis>r1 && dis>r2){
			if((r1+r2)>=dis) cout<<"Yes\n";
			else cout<<"No\n";
		}
		else{
			if(r1<r2) swap(r1,r2);
			if((dis+r2)>=r1) cout<<"Yes\n";
			else cout<<"No\n";
		}
//		cout<<dis<<' '<<r1<<'\n'; 
	}
	return 0;
}
/*

*/

提出情報

ジャッジ結果