51nod 1264 线段相交

传送门--线段相交

快速排斥&&跨立实验

#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
struct point
{
    double x;
    double y;
};
struct v
{
    point start;
    point end;
};
double fun(point p1,point p2,point p0)
{
    return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);
}
bool cross(v v1,v v2)
{
    if(max(v1.start.x,v1.end.x)>=min(v2.start.x,v2.end.x)&&
       max(v2.start.x,v2.end.x)>=min(v1.start.x,v1.end.x)&&
       max(v1.start.y,v1.end.y)>=min(v2.start.y,v2.end.y)&&
       max(v2.start.y,v2.end.y)>=min(v1.start.y,v1.end.y)&&
       fun(v2.start,v1.end,v1.start)*fun(v1.end,v2.end,v1.start)>=0&&
       fun(v1.start,v2.end,v2.start)*fun(v2.end,v1.end,v2.start)>=0)
       return true;
    return false;
}
int main()
{
    int a,i,c,b,f;
    struct v v1,v2;
    while(scanf("%d",&a)!=-1)
    {
        if(a==0)
        break;
        else
        {
           for(i=0;i<a;i++)
            { scanf("%lf%lf%lf%lf%lf%lf%lf%lf",&v1.start.x,&v1.start.y,
                  &v1.end.x,&v1.end.y,&v2.start.x,&v2.start.y,
                  &v2.end.x,&v2.end.y);
                if(cross(v1,v2))

                   printf("Yes\n");
            else printf("No\n");

            }
        }

    }
    return 0;
}