给出平面上两条线段的两个端点,判断这两条线段是否相交(有一个公共点或有部分重合认为相交)。 如果相交,输出"Yes",否则输出"No"。
Input
第1行:一个数T,表示输入的测试数量(1 <= T <= 1000) 第2 - T + 1行:每行8个数,x1,y1,x2,y2,x3,y3,x4,y4。(-10^8 <= xi, yi <= 10^8) (直线1的两个端点为x1,y1 | x2, y2,直线2的两个端点为x3,y3 | x4, y4)
Output
输出共T行,如果相交输出"Yes",否则输出"No"。
Input示例
2 1 2 2 1 0 0 2 2 -1 1 1 1 0 0 1 -1
Output示例
Yes No
判断两个线段相交与否。可以看成直线是否与线段相交
根据高数所学,向量的叉乘积,可以利用右手法则来判断结果的方向。
那么如果两种情况的方向一个上,一个下,那么自然也就是不在直线的同侧,那么就满足条件了。
代码是有需要注意x,y用double类型,否则乘法会有问题
(p3p4*p3p1)*(p3p4*p3p2)<=0;同理(p1p2*p1p3)*(p1p2*p1p4)<=0.
是向量叉乘,即行列式。等于零代表共线
a×b=(
![](https://gss3.bdstatic.com/-Po3dSag_xI4khGkpoWK1HF6hhy/baike/s%3D30/sign=9f5e4b8796eef01f49141ec5e2fe35d1/a50f4bfbfbedab64289ebf23f536afc378311e60.jpg)
![](https://gss0.bdstatic.com/94o3dSag_xI4khGkpoWK1HF6hhy/baike/s%3D30/sign=d37b50f8d60735fa95f048b99f514867/9922720e0cf3d7ca03a8cd95f01fbe096a63a9f3.jpg)
![](https://gss3.bdstatic.com/7Po3dSag_xI4khGkpoWK1HF6hhy/baike/s%3D30/sign=b17013ec8594a4c20e23e12b0cf479fa/f603918fa0ec08fa36c5e1445bee3d6d54fbda08.jpg)
![](https://gss2.bdstatic.com/-fo3dSag_xI4khGkpoWK1HF6hhy/baike/s%3D30/sign=a2aee60ea1cc7cd9fe2d32d93801d181/1ad5ad6eddc451da8fcaf108b4fd5266d0163210.jpg)
![](https://gss1.bdstatic.com/-vo3dSag_xI4khGkpoWK1HF6hhy/baike/s%3D30/sign=820109c89f16fdfadc6cc0eeb68f3bec/d043ad4bd11373f0a7ec9d7ca60f4bfbfaed0405.jpg)
![](https://gss0.bdstatic.com/94o3dSag_xI4khGkpoWK1HF6hhy/baike/s%3D30/sign=21f949183bdbb6fd215be32608244fa7/42166d224f4a20a43600c12492529822720ed033.jpg)
![](https://gss2.bdstatic.com/9fo3dSag_xI4khGkpoWK1HF6hhy/baike/s%3D86/sign=ed67d90cabec8a13101a5ae6f6038050/37d12f2eb9389b50f5891db18735e5dde6116edb.jpg)
只不过这道题是二维的
#include<stdio.h>
using namespace std;
struct data{
double x,y;
}a,b,c,d;
void fun(){
double p[4];
p[0]=(b.x-a.x)*(b.y-c.y)-(b.y-a.y)*(b.x-c.x);//baXbc
p[1]=(b.x-a.x)*(b.y-d.y)-(b.y-a.y)*(b.x-d.x);//baXbd
p[2]=(d.x-c.x)*(d.y-a.y)-(d.y-c.y)*(d.x-a.x);//dcXda
p[3]=(d.x-c.x)*(d.y-b.y)-(d.y-c.y)*(d.x-b.x);//dcXdb
if((p[0]*p[1]<=0)&&(p[2]*p[3]<=0))
printf("Yes\n");
else printf("No\n");
}
int main()
{
int n;
scanf("%d",&n);
while(n--){
scanf("%lf%lf%lf%lf%lf%lf%lf%lf",&a.x,&a.y,&b.x,&b.y,&c.x,&c.y,&d.x,&d.y);
fun();
}
return 0;
}