题目描述
在二维坐标系中,所有的值是double类型,那么一个矩形可以由四个点来代表,(x1, y1)为最左的点,(x2, y2)为最上的点,(x3, y3)为最下的点,(x4, y4)为最右的点。给定4个点代表的矩形,再给定一个点(x, y),判断(x, y)是否在矩形中
输入描述:
输入有五行,每行两个整数。
对于前四行,第i行的浮点数表示(xi,yi)
最后一行两个浮点数表示(x, y)
输出描述:
若(x, y)在矩形中,输出"Yes"
否则输出"No"
#include<bits/stdc++.h>
using namespace std;
bool isInside(const double& x1,const double& x4,const double& y1,const double& y4,
const double& x,const double& y){
if( x<=x1 || x>=x4 || y>=y1 || y<=y4 ){
return false;
}
return true;
}
int main(){
double x1,x2,x3,x4,y1,y2,y3,y4,x,y;
cin>>x1>>y1;
cin>>x2>>y2;
cin>>x3>>y3;
cin>>x4>>y4;
cin>>x>>y;
bool res=false;
if(y1==y2){
res=isInside(x1,x4,y1,y4,x,y);
}else{
double a=abs(x4-x3);
double b=abs(y4-y3);
double c=sqrt(a*a+b*b);
double cosAngle=a/c;
double sinAngle=b/c;
double x1Rotate=x1*cosAngle+y1*sinAngle;
double y1Rotate=y1*cosAngle-x1*sinAngle;
double x4Rotate=x4*cosAngle+y4*sinAngle;
double y4Rotate=y4*cosAngle-x4*sinAngle;
double xRotate=x*cosAngle+y*sinAngle;
double yRotate=y*cosAngle-x*sinAngle;
res=isInside(x1Rotate,x4Rotate,y1Rotate,y4Rotate,xRotate,yRotate);
}
if(res){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
return 0;
}