题意:给定两个正方形,第一个是平行于坐标轴的,第二个是与坐标轴夹角45°的,两个正方形有公共点就输出YES,否则输出NO
思路:因为数据量小,暴力每个点考虑也能解决,但是这种问题,还是用计算几何的方法计算为好,直接搬的大佬的代码了!
代码:
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const double eps = 1e-6;
int sgn(double x)
{
if(fabs(x) < eps)return 0;
if(x < 0)return -1;
else return 1;
}
struct Point
{
double x,y;
Point(){}
Point(double _x,double _y)
{
x = _x;y = _y;
}
Point operator -(const Point &b)const
{
return Point(x - b.x,y - b.y);
}
//叉积
double operator ^(const Point &b)const
{
return x*b.y - y*b.x;
}
//点积
double operator *(const Point &b)const
{
return x*b.x + y*b.y;
}
//绕原点旋转角度B(弧度值),后x,y的变化
void transXY(double B)
{
double tx = x,ty = y;
x = tx*cos(B) - ty*sin(B);
y = tx*sin(B) + ty*cos(B);
}
};
struct Line
{
Point s,e;
Line(){}
Line(Point _s,Point _e)
{
s = _s;e = _e;
}
//两直线相交求交点
//第一个值为0表示直线重合,为1表示平行,为0表示相交,为2是相交
//只有第一个值为2时,交点才有意义
pair<int,Point> operator &(const Line &b)const
{
Point res = s;
if(sgn((s-e)^(b.s-b.e)) == 0)
{
if(sgn((s-b.e)^(b.s-b.e)) == 0)
return make_pair(0,res);//重合
else return make_pair(1,res);//平行
}
double t = ((s-b.s)^(b.s-b.e))/((s-e)^(b.s-b.e));
res.x += (e.x-s.x)*t;
res.y += (e.y-s.y)*t;
return make_pair(2,res);
}
};
//判断线段相交
bool inter(Line l1,Line l2)
{
return
max(l1.s.x,l1.e.x) >= min(l2.s.x,l2.e.x) &&
max(l2.s.x,l2.e.x) >= min(l1.s.x,l1.e.x) &&
max(l1.s.y,l1.e.y) >= min(l2.s.y,l2.e.y) &&
max(l2.s.y,l2.e.y) >= min(l1.s.y,l1.e.y) &&
sgn((l2.s-l1.e)^(l1.s-l1.e))*sgn((l2.e-l1.e)^(l1.s-l1.e)) <= 0 &&
sgn((l1.s-l2.e)^(l2.s-l2.e))*sgn((l1.e-l2.e)^(l2.s-l2.e)) <= 0;
}
//判断点在线段上
//判断点在线段上
bool OnSeg(Point P,Line L)
{
return
sgn((L.s-P)^(L.e-P)) == 0 &&
sgn((P.x - L.s.x) * (P.x - L.e.x)) <= 0 &&
sgn((P.y - L.s.y) * (P.y - L.e.y)) <= 0;
}
//判断点在凸多边形内
//点形成一个凸包,而且按逆时针排序(如果是顺时针把里面的<0改为>0)
//点的编号:0~n-1
//返回值:
//-1:点在凸多边形外
//0:点在凸多边形边界上
//1:点在凸多边形内
int inConvexPoly(Point a,Point p[],int n)
{
for(int i = 0;i < n;i++)
{
if(sgn((p[i]-a)^(p[(i+1)%n]-a)) < 0)return -1;
else if(OnSeg(a,Line(p[i],p[(i+1)%n])))return 0;
}
return 1;
}
//判断点在任意多边形内
//射线法,poly[]的顶点数要大于等于3,点的编号0~n-1
//返回值
//-1:点在凸多边形外
//0:点在凸多边形边界上
//1:点在凸多边形内
int inPoly(Point p,Point poly[],int n)
{
int cnt;
Line ray,side;
cnt = 0;
ray.s = p;
ray.e.y = p.y;
ray.e.x = -100000000000.0;//-INF,注意取值防止越界
for(int i = 0;i < n;i++)
{
side.s = poly[i];
side.e = poly[(i+1)%n];
if(OnSeg(p,side))return 0;
//如果平行轴则不考虑
if(sgn(side.s.y - side.e.y) == 0)
continue;
if(OnSeg(side.s,ray))
{
if(sgn(side.s.y - side.e.y) > 0)cnt++;
}
else if(OnSeg(side.e,ray))
{
if(sgn(side.e.y - side.s.y) > 0)cnt++;
}
else if(inter(ray,side))
cnt++;
}
if(cnt % 2 == 1)return 1;
else return -1;
}
int main()
{
int t;
//cin >> t;
int x1, x2, x3, x4, x5, x6, x7,x8, y1,y2,y3,y4,y5,y6,y7,y8;
//while(t--)
{
int flag = 0;
scanf("%d%d%d%d%d%d%d%d", &x1, &y1, &x2, &y2, &x3,&y3,&x4,&y4);
scanf("%d%d%d%d%d%d%d%d", &x5, &y5, &x6, &y6,&x7,&y7,&x8,&y8);
int xx[10],yy[10];
xx[1]=x1;xx[2]=x2;xx[3]=x3;xx[4]=x4;xx[5]=x5;xx[6]=x6;xx[7]=x7;xx[8]=x8;
yy[1]=y1;yy[2]=y2;yy[3]=y3;yy[4]=y4;yy[5]=y5;yy[6]=y6;yy[7]=y7;yy[8]=y8;
for(int i=1;i<=8;i++)
for(int j=1;j<=8;j++)
if(i!=j){
if(xx[i]==xx[j]&&yy[i]==yy[j]) flag=1;
}
Point p1[10], p2[10];
p1[0] = Point(x1, y1);
p1[1] = Point(x2, y2);
p1[2] = Point(x3, y3);
p1[3] = Point(x4, y4);
p2[0] = Point(x5, y5);
p2[1] = Point(x6, y6);
p2[2] = Point(x7, y7);
p2[3] = Point(x8, y8);
if(inPoly(p1[0], p2, 4) == 1 && inPoly(p1[1], p2, 4) == 1 && inPoly(p1[2], p2, 4) == 1&& inPoly(p1[3], p2, 4) == 1)
flag = 1;
if(inPoly(p2[0], p1, 4) == 1 && inPoly(p2[1], p1, 4) == 1 && inPoly(p2[2], p1, 4) == 1&& inPoly(p2[3], p1, 4) == 1)
flag = 1; // limian
for(int i = 0; i < 4; i++)
{
for(int j = i; j < 4; j++)
{
Line l1 = Line(p1[i], p1[j]);
for(int x = 0; x < 4; x++)
{
for(int y = x; y < 4; y++)
{
Line l2 = Line(p2[x], p2[y]);
if(inter(l1, l2))
flag = 2;
}
}
}
}
if(flag == 1||flag==2)
puts("YES");
else
puts("NO");
}
return 0;
}