51nod(1264)——线段相交

题目：

给出平面上两条线段的两个端点，判断这两条线段是否相交（有一个公共点或有部分重合认为相交）。 如果相交，输出"Yes"，否则输出"No"。

这道题直接套白书里面的模板就行~

但是要注意的是因为白书给的那个模板不包含端点。所以我们这里需要进行修改一下。

包含了端点，所以自然点积就为0了。。

#include<cstdio>
#include<cstring>
#include<map>
#include<set>
#include<cmath>
#include<algorithm>
#include<vector>
#include<queue>
#include<iostream>
#include<time.h>
using namespace std;
typedef __int64 ll;
typedef unsigned __int64 ULL;
#define pi acos(-1.0)
#define Ex exp(1.0)
#define maxn 12
#define eps 1e-6
struct Point{
    double x,y;
    Point(double x=0, double y=0):x(x),y(y){}
};
typedef Point Vector;
Vector operator +(Vector A,Vector B){
    return Vector(A.x+B.x,A.y+B.y);
}
Vector operator -(Point A,Point B){
    return Vector(A.x-B.x,A.y-B.y);
}
Vector operator *(Vector A,double p){
    return Vector(A.x*p,A.y*p);
}
Vector operator /(Vector A,double p){
    return Vector(A.x/p,A.y/p);
}
bool operator < (const Point& a,const Point& b){
    return a.x<b.x||(a.x==b.x&&a.y<b.y);
}
int dcmp(double x){
    if(fabs(x)<eps) return 0;
    else return x<0 ? -1: 1;
}
double Dot(Vector A,Vector B){
    return A.x*B.x+A.y*B.y;
}
double Cross(Vector A, Vector B){
    return A.x*B.y-A.y*B.x;
}
bool SegmentProperIntersection(Point a1,Point a2,Point b1,Point b2){
    double c1=Cross(a2-a1,b1-a1),c2=Cross(a2-a1,b2-a1),
           c3=Cross(b2-b1,a1-b1),c4=Cross(b2-b1,a2-b1);
           return dcmp(c1)*dcmp(c2)<0&&dcmp(c3)*dcmp(c4)<0;
}
bool OnSegment(Point p,Point a1,Point a2){
    return dcmp(Cross(a1-p,a2-p))==0 && dcmp(Dot(a1-p,a2-p))<=0;    //注意这里是写成小于等于，因为这里包含了端点！！
}
int main(){
    int T;
    scanf("%d",&T);
    while(T--){
        Point a,b,c,d;
        scanf("%lf%lf",&a.x,&a.y);
        scanf("%lf%lf",&b.x,&b.y);
        scanf("%lf%lf",&c.x,&c.y);
        scanf("%lf%lf",&d.x,&d.y);
        if(SegmentProperIntersection(a,b,c,d)||
          OnSegment(a,c,d)||OnSegment(b,c,d)||
          OnSegment(c,a,b)||OnSegment(d,a,b)){
            printf("Yes\n");
        }
        else printf("No\n");
    }
    #ifndef ONLINE_JUDGE
    system("pause");
    #endif
    return 0;
}