思路
简单计算几何
读题!
double a,b,k,k1;
Point p[100005];
bool check(int i){
if(p[i].y- (p[i].x-a)*k1-b > eps) return true;
return false;
}
void solve(){
cin >>a>>b>>n>>k;
forr(i,1,n){
cin>>p[i].x>>p[i].y;
}
k1 = b/a;
k1 = sin(atan(k1));
k1 /= k;
k1 = tan(asin(k1));
forr(i,1,n){
if(check(i)){
puts("NO");
return;
}
}
puts("YES");
}
signed main()
{
int t;cin>>t;
while(t--) solve();
return 0;
}