poj 1066 Treasure Hunt【叉乘】

题目链接：http://poj.org/problem?id=1066
题意：有一个100x100的正方形，其实也就是有四面墙围成的一个图形，正方形中间有一个点，也就是宝藏所在的位置，除此之外还有内墙，为你从外面到宝藏哪里，最少炸几面墙就可以到达
解析：枚举每一面内墙的起点和终点与宝藏连线，判断和几面内墙相交，除此之外还要枚举正方形的四个端点

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <set>
using namespace std;
const int maxn = 1000+100;
struct point
{
    double x,y;
    point() {}
    point(double _x,double _y)
    {
        x = _x;
        y = _y;
    }
};
struct line
{
    point a;
    point b;
    line() {}
    line(point _a,point _b)
    {
        a = _a;
        b = _b;
    }
}a[maxn];
double x_mul(point p0,point p1,point p2)
{
    return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);
}
bool judge(line l1,line l2)
{
    bool flag1 = min(l1.a.x,l1.b.x)<=max(l2.a.x,l2.b.x)&&
                min(l2.a.x,l2.b.x)<=max(l1.a.x,l1.b.x)&&
                min(l2.a.y,l2.b.y)<=max(l1.a.y,l1.b.y)&&
                min(l1.a.y,l1.b.y)<=max(l2.a.y,l2.b.y);
    bool flag2 = (x_mul(l1.a,l2.a,l2.b)*x_mul(l1.b,l2.a,l2.b)<0.0)&&
                (x_mul(l2.a,l1.a,l1.b)*x_mul(l2.b,l1.a,l1.b)<0.0);
    return flag1&&flag2;
}
int countJudge(line l1,int n)
{
    int res = 0;
    for(int i=0;i<n;i++)
    {
        if(judge(a[i],l1))
            res++;
    }
    return res;
}
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        for(int i=0;i<n;i++)
        {
            double x1,y1,x2,y2;
            scanf("%lf %lf %lf %lf",&x1,&y1,&x2,&y2);
            a[i] = line(point(x1,y1),point(x2,y2));
        }
        point tag;
        scanf("%lf %lf",&tag.x,&tag.y);
        int ans = 0x7ffffff;
        for(int i=0;i<n;i++)
        {
            line tmp1 = line(a[i].a,tag);
            line tmp2 = line(a[i].b,tag);
            ans = min(ans,countJudge(tmp1,n));
            ans = min(ans,countJudge(tmp2,n));
        }
        line t1 = line(tag,point(0,0));
        line t2 = line(tag,point(0,100));
        line t3 = line(tag,point(100,0));
        line t4 = line(tag,point(100,100));

        ans = min(ans,countJudge(t1,n));
        ans = min(ans,countJudge(t2,n));
        ans = min(ans,countJudge(t3,n));
        ans = min(ans,countJudge(t4,n));
        printf("Number of doors = %d\n",ans+1);

    }
    return 0;
}