【51nod】1264 线段相交

线段相交

Link

---

解题思路

快速排斥实验+三点共线 or 跨立实验

code

#include<iostream>
#include<cstdio>
using namespace std;

int T;

struct abc{
	double x,y;
}a1,a2,a3,a4;

double cj(abc b1,abc b2,abc b3)
{
	return (b1.x-b3.x)*(b2.y-b3.y)-(b2.x-b3.x)*(b1.y-b3.y);
}

int online(abc b1,abc b2,abc b3)
{
	if(b3.x>=min(b1.x,b2.x)&&b3.x<=max(b1.x,b2.x)
	 &&b3.y>=min(b1.y,b2.y)&&b3.y<=max(b1.y,b2.y))
	 	return 1;
	return 0;
}

int check()
{
	if(cj(a1,a2,a3)*cj(a1,a2,a4)<0&&cj(a3,a4,a1)*cj(a3,a4,a2)<0) return 1;
	if(cj(a1,a2,a3)==0&&online(a1,a2,a3)) return 1;
	if(cj(a1,a2,a4)==0&&online(a1,a2,a4)) return 1;
	if(cj(a3,a4,a1)==0&&online(a3,a4,a1)) return 1;
	if(cj(a3,a4,a2)==0&&online(a3,a4,a1)) return 1;
	return 0;
}

int main()
{
	cin>>T;
	while(T--)
	{
		scanf("%lf%lf%lf%lf%lf%lf%lf%lf",&a1.x,&a1.y,&a2.x,&a2.y,&a3.x,&a3.y,&a4.x,&a4.y);
		if(check())
			printf("Yes\n");
		else
			printf("No\n");
	}
}