POJ 1556 The Doors 计算几何（叉积+最短路dij）

题目链接：http://poj.org/problem?id=1556

题意：一个10*10的方格中，起点为（0，5），终点为（10，5），横坐标0-10中间有n（n<=18）堵墙，第i墙的横坐标为xi,每堵墙中间有两个门，坐标会在题意中给出，求起点到终点的最短路径长度

思路：可推断出，最短路径一定是某个门端点到其他门端点距离的和，所以将门都转换为点，可以通过dijsktra直接求最短路径即可

代码：

/*#include <bits/stdc++.h>*/
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;

typedef long long ll;
const ll mod = 2147493647;
const int maxn = 1000;
const double eps = 1e-8;
const double inf = 1e20;

int cmp(double a, double b)
{
    if(fabs(a-b)<eps)return 0;
    if(a<b)return -1;
    return 1;
}

struct Line
{
    double u, l, x;
    Line(double a = 0, double b = 0, double c = 0)
    {
        u = a, l = b, x = c;
    }
}l[maxn];

struct Point
{
    double x, y;
    Point(double a = 0, double b = 0)
    {
        x = a, y = b;
    }
    const Point operator-(const Point &b)const
    {
        return Point(x - b.x, y - b.y);
    }
    double operator *(const Point &b)const //cross
    {
        return x*b.y - y*b.x;
    }
    double len (const Point &b)const
    {
        return (b.x-x)*(b.x-x)+(b.y-y)*(b.y-y);
    }
}p[maxn];

int n, cp = 1, cl = 0;
double mm[maxn][maxn];

double dijsktra()
{
    double dis[maxn];
    bool vis[maxn];
    memset(vis,0,sizeof(vis));
    vis[0] = 1;
    for(int i=0;i<cp;i++)
    {
        dis[i] = mm[0][i];
    }
    dis[0] = 0;
    for(int i=0;i<cp;i++)
    {
        int u = -1;
        double v = inf;
        for(int j=1;j<cp;j++)
        {
            if(!vis[j] && dis[j]<v)
            {
                u = j;
                v = dis[j];
            }
        }
        if(u==-1)break;
        vis[u] = 1;
        for(int j = 1;j<cp;j++)
        {
            if(!vis[j] && dis[j]>mm[u][j]+dis[u])
            {
                dis[j] = mm[u][j]+dis[u];
            }
        }
    }
    return dis[cp-1];
}

int main()
{
    while(scanf("%d",&n) && n!=-1)
    {
        cp = 1, cl = 0;
        for(int i=0;i<n;i++)
        {
            double x, a, b, c, d;
            scanf("%lf%lf%lf%lf%lf",&x,&a,&b,&c,&d);
            p[cp++] = Point(x,a);
            p[cp++] = Point(x,b);
            p[cp++] = Point(x,c);
            p[cp++] = Point(x,d);
            l[cl++] = Line(0,a,x);
            l[cl++] = Line(b,c,x);
            l[cl++] = Line(d,10,x);
        }
        p[0] = Point(0,5), p[cp++] = Point(10,5);
        for(int i=0;i<cp;i++)
        {
            for(int j=0;j<cp;j++)
                mm[i][j] = inf;
        }
        for(int i=0;i<cp;i++)
        {
            for(int j = i+1;j<cp;j++)
            {
                int f = 1;
                if(cmp(p[j].x,p[i].x)<=0)continue;
                for(int k = 0;k<cl;k++)
                {
                    if(cmp(l[k].x,p[i].x)<0 || cmp(l[k].x,p[j].x)>0)continue;
                    double tmpa = ((p[j] - p[i])*(Point(l[k].x,l[k].l) - p[i]));
                    double tmpb = ((p[j] - p[i])*(Point(l[k].x,l[k].u) - p[i]));
                    if(cmp(tmpa*tmpb,0)<0)
                    {
                        f = 0;
                        break;
                    }
                }
                if(f)
                {
                    double tmp = p[j].len(p[i]);
                    mm[i][j] = sqrt(tmp);
                }
            }
        }
        double ans = dijsktra();
        printf("%.2lf\n",ans);
    }
}