线段判交-- POJ 2653

Pick-up sticks

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 9419		Accepted: 3478

题意解释：

    给出几根棍子扔出的顺序，抛出方式任意，有的会重叠有的不会，问最后哪些棍子不被其他的棍子压住。

代码：

#include <iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#define M 100005

using namespace std;
const double eps=1e-10;
struct Point{
    double x,y;
    Point(double x=0,double y=0):x(x),y(y) {}
};
Point a1[M+5],a2[M+5];

typedef Point Vector;

Vector operator + (Vector A,Vector B) {return Vector(A.x+B.x,A.y+B.y);}
Vector operator - (Vector A,Vector 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);}


int dcmp(double x)
{
    if(fabs(x)<eps) return 0;
    else return x<0?-1:1;
}
bool operator ==(const Point& a,const Point &b)
{
    return dcmp(a.x-b.x)==0 && dcmp(a.y-b.y)==0;
}

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 OnSegment(Point p,Point a1,Point a2) // 判断点P是否在线段a1a2上
{
  /*  Vector m1,m2;
    m1.x=a1.x-p.x;
    m1.y=a1.y-p.y;
    m2.x=a2.x-p.x;
    m2.y=a2.y-p.y; */
  //  return dcmp(Cross(m1,m2))==0 && dcmp(Dot(m1,m2))<0;
    return dcmp(Cross(a1-p,a2-p))==0 && dcmp(Dot(a1-p,a2-p))<0;
}

int 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);

    if(c1==0 && c2==0) return 2; // 共线
    if(OnSegment(b1,a1,a2) ||  OnSegment(b2,a1,a2)  // 端点在另一条线段上
       || OnSegment(a1,b1,b2) || OnSegment(a2,b1,b2)) return 1; // 相交
    return (dcmp(c1)*dcmp(c2)<0 && dcmp(c3)*dcmp(c4)<0);
}

bool quick_(Point a1,Point a2,Point b1,Point b2)
{
    if(min(a1.x,a2.x)<=max(b1.x,b2.x)
        && min(b1.x,b2.x)<=max(a1.x,a2.x)
        && min(a1.y,a2.y)<=max(b1.y,b2.y)
        && min(b1.y,b2.y)<=max(a1.y,a2.y))
    return 1;
    else return 0;
}


bool Intersect(Point a1,Point a2,Point b1,Point b2)
{
    if(quick_(a1,a2,b1,b2))
    {
        int ret=SegmentProperIntersection(a1,a2,b1,b2);
        if(ret!=0) return 1;
        else return 0;

    }else return 0;
}

int main()
{

    int n;
    int ans[1000+5];
  // puts("INTERSECTING LINES OUTPUT");
    while(~scanf("%d",&n) && n)
    {
        memset(ans,0,sizeof(ans));
        for(int i=1;i<=n;i++)
        scanf("%lf%lf%lf%lf",&a1[i].x,&a1[i].y,&a2[i].x,&a2[i].y);

      //  puts("wo");
        int cnt=0;
        for(int i=1;i<=n;i++)
        {
            int ok=1;
            for(int j=i+1;j<=n;j++)
            if(Intersect(a1[i],a2[i],a1[j],a2[j]))
            {
                ok=0; break;
            }
            if(ok) ans[cnt++]=i;
        }

        printf("Top sticks:");
        for(int i=0;i<cnt-1;i++)
            printf(" %d,",ans[i]);
        printf(" %d.\n",ans[cnt-1]);
    }


    return 0;
}

直线的位置判断

POJ 1269 Intersecting Lines

题意：给出两条直线（4个点），要求判断出这两条直线的关系：平行，同线，相交。如果相交还要求出交点坐标。
分析：先判断是否共线，否则判断是否平行，否则只能相交，求出交点。   

#include <iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#define M 100005

using namespace std;
const double eps=1e-10;
struct Point{
    double x,y;
    Point(double x=0,double y=0):x(x),y(y) {}
};
Point a1[M+5],a2[M+5];

typedef Point Vector;

Vector operator + (Vector A,Vector B) {return Vector(A.x+B.x,A.y+B.y);}
Vector operator - (Vector A,Vector 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);}


int dcmp(double x)
{
    if(fabs(x)<eps) return 0;
    else return x<0?-1:1;
}
bool operator ==(const Point& a,const Point &b)
{
    return dcmp(a.x-b.x)==0 && dcmp(a.y-b.y)==0;
}

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 OnSegment(Point p,Point a1,Point a2) // 判断点P是否在线段a1a2上
{
  /*  Vector m1,m2;
    m1.x=a1.x-p.x;
    m1.y=a1.y-p.y;
    m2.x=a2.x-p.x;
    m2.y=a2.y-p.y; */
  //  return dcmp(Cross(m1,m2))==0 && dcmp(Dot(m1,m2))<0;
    return dcmp(Cross(a1-p,a2-p))==0 && dcmp(Dot(a1-p,a2-p))<0;
}

int 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);

    if(c1==0 && c2==0) return 2; // 共线
    if(OnSegment(b1,a1,a2) ||  OnSegment(b2,a1,a2)  // 端点在另一条线段上
       || OnSegment(a1,b1,b2) || OnSegment(a2,b1,b2)) return 1; // 相交
    return (dcmp(c1)*dcmp(c2)<0 && dcmp(c3)*dcmp(c4)<0);
}

bool quick_(Point a1,Point a2,Point b1,Point b2)
{
    if(min(a1.x,a2.x)<=max(b1.x,b2.x)
        && min(b1.x,b2.x)<=max(a1.x,a2.x)
        && min(a1.y,a2.y)<=max(b1.y,b2.y)
        && min(b1.y,b2.y)<=max(a1.y,a2.y))
    return 1;
    else return 0;
}


bool Intersect(Point a1,Point a2,Point b1,Point b2)
{
    if(quick_(a1,a2,b1,b2))
    {
        int ret=SegmentProperIntersection(a1,a2,b1,b2);
        if(ret!=0) return 1;
        else return 0;

    }else return 0;
}

int main()
{

    int n;
    int ans[1000+5];
  // puts("INTERSECTING LINES OUTPUT");
    while(~scanf("%d",&n) && n)
    {
        memset(ans,0,sizeof(ans));
        for(int i=1;i<=n;i++)
        scanf("%lf%lf%lf%lf",&a1[i].x,&a1[i].y,&a2[i].x,&a2[i].y);

      //  puts("wo");
        int cnt=0;
        for(int i=1;i<=n;i++)
        {
            int ok=1;
            for(int j=i+1;j<=n;j++)
            if(Intersect(a1[i],a2[i],a1[j],a2[j]))
            {
                ok=0; break;
            }
            if(ok) ans[cnt++]=i;
        }

        printf("Top sticks:");
        for(int i=0;i<cnt-1;i++)
            printf(" %d,",ans[i]);
        printf(" %d.\n",ans[cnt-1]);
    }


    return 0;
}