计算几何——判线段规范相交+最短路zoj1721

枚举每个端点，然后i点j点连线作为一条路径，逐一判断这条路径是否可行即可

注意的地方：判一条线段是否可行，需要判其余线段是否和其相交，但是这个相交比较难判（因为会不规范相交），所以将问题转化为墙以外的线是否和其相交，所有墙以外的线都要和其相交！

//判断线段相交
bool inter(Line l1,Line l2)
{
    return
        max(l1.s.x,l1.e.x) > min(l2.s.x,l2.e.x) &&
        max(l2.s.x,l2.e.x) > min(l1.s.x,l1.e.x) &&
        max(l1.s.y,l1.e.y) > min(l2.s.y,l2.e.y) &&
        max(l2.s.y,l2.e.y) > min(l1.s.y,l1.e.y) &&
        sgn((l2.s-l1.s)^(l1.e-l1.s))*sgn((l2.e-l1.s)^(l1.e-l1.s)) <  &&
        sgn((l1.s-l2.s)^(l2.e-l2.s))*sgn((l1.e-l2.s)^(l2.e-l2.s)) < ;
}

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <queue>
#include <map>
#include <vector>
#include <set>
#include <string>
#include <math.h>

using namespace std;

const double eps = 1e-;
int sgn(double x)
{
    if(fabs(x) < eps)return ;
    if(x < ) return -;
    else return ;
}
struct Point
{
    double x,y;
    Point(){}
    Point(double _x,double _y)
    {
        x = _x;y = _y;
    }
    Point operator -(const Point &b)const
    {
        return Point(x - b.x,y - b.y);
    }
    double operator ^(const Point &b)const
    {
        return x*b.y - y*b.x;
    }
    double operator *(const Point &b)const
    {
        return x*b.x + y*b.y;
    }
};
struct Line
{
    Point s,e;
    Line(){}
    Line(Point _s,Point _e)
    {
        s = _s;e = _e;
    }
};
//判断线段相交
bool inter(Line l1,Line l2)
{
    return
        max(l1.s.x,l1.e.x) > min(l2.s.x,l2.e.x) &&
        max(l2.s.x,l2.e.x) > min(l1.s.x,l1.e.x) &&
        max(l1.s.y,l1.e.y) > min(l2.s.y,l2.e.y) &&
        max(l2.s.y,l2.e.y) > min(l1.s.y,l1.e.y) &&
        sgn((l2.s-l1.s)^(l1.e-l1.s))*sgn((l2.e-l1.s)^(l1.e-l1.s)) <  &&
        sgn((l1.s-l2.s)^(l2.e-l2.s))*sgn((l1.e-l2.s)^(l2.e-l2.s)) < ;
}
double dist(Point a,Point b)
{
    return sqrt((b-a)*(b-a));
}
const int MAXN = ;
Line line[MAXN<<];
Point p[MAXN<<];
double dis[MAXN][MAXN];
const double INF = 1e20;
int n;

int check(Line tmp){
    for(int i=;i<=*n;i++)
        if(inter(tmp,line[i]))return ;
    return ;
}

int main(){
    double x,y1,y2,y3,y4;
    while(scanf("%d",&n) == )
    {
        if(n == -) break;
        p[]=Point(,),p[*n+]=Point(,);
        for(int i = ;i <= n;i++)
        {
            scanf("%lf%lf%lf%lf%lf",&x,&y1,&y2,&y3,&y4);
            line[*i-] = Line(Point(x,),Point(x,y1));
            line[*i-] = Line(Point(x,y2),Point(x,y3));
            line[*i] = Line(Point(x,y4),Point(x,));
            p[*i-]=Point(x,y1);
            p[*i-]=Point(x,y2);
            p[*i-]=Point(x,y3);
            p[*i]=Point(x,y4);
        }
        for(int i = ;i <= *n+;i++)
            for(int j = ;j <= *n+;j++)
            {
                if(i == j)dis[i][j] = ;
                else dis[i][j] = INF;
            }

        for(int i=;i<=*n+;i++)
            for(int j=i+;j<=*n+;j++){
                Line tmp=Line(p[i],p[j]);
                if(check(tmp))
                    dis[i][j]=dis[j][i]=dist(p[i],p[j]);
            }

        for(int k = ;k <= *n+;k++)
            for(int i = ;i <= *n+;i++)
                for(int j = ;j <= *n+;j++)
                    if(dis[i][k] + dis[k][j] < dis[i][j])
                        dis[i][j] = dis[i][k] + dis[k][j];
        printf("%.2lf\n",dis[][*n+]);
    }

    return ;
}