You are to find the length of the shortest path through a chamber containing obstructing walls. The chamber will always have sides at x = 0, x = 10, y = 0, and y = 10. The initial and final points of the path are always (0, 5) and (10, 5). There will also be from 0 to 18 vertical walls inside the chamber, each with two doorways. The figure below illustrates such a chamber and also shows the path of minimal length.
Input
The input data for the illustrated chamber would appear as follows.
2
4 2 7 8 9
7 3 4.5 6 7
The first line contains the number of interior walls. Then there is a line for each such wall, containing five real numbers. The first number is the x coordinate of the wall (0 < x < 10), and the remaining four are the y coordinates of the ends of the doorways in that wall. The x coordinates of the walls are in increasing order, and within each line the y coordinates are in increasing order. The input file will contain at least one such set of data. The end of the data comes when the number of walls is -1.
Output
The output file should contain one line of output for each chamber. The line should contain the minimal path length rounded to two decimal places past the decimal point, and always showing the two decimal places past the decimal point. The line should contain no blanks.
Sample Input
1
5 4 6 7 8
2
4 2 7 8 9
7 3 4.5 6 7
-1
Sample Output
10.00
10.06
Source: Mid-Central USA 1996
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
#define INF 10000000
#define MAXN 100
struct POINT
{
double x,y;
};
struct EDGE
{
int u,v;
};
int n; //房间里墙的数目
double wX[20]; //每堵墙的x坐标(升序)
POINT p[MAXN]; //存储起点、每扇门的两个端点、终点的平面坐标
int pSize; //点的数目(含起点、终点)
double pY[20][4]; //第i堵墙的4个y坐标
double g[MAXN][MAXN]; //邻接矩阵
EDGE e[MAXN*MAXN]; //存储构造的每条边
int eSize; //边的数目
int i,j; //循环变量
double Dis(POINT a,POINT b)
{
return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
//判断点(x3,y3)是否位于点(x1,y1)和(x2,y2)所确定的直线的上方还是下方
//返回值>0表示位于上方,<0表示位于下方
double Cross(double x1,double y1,double x2,double y2,double x3,double y3)
{
return (x2-x1)*(y3-y1)-(x3-x1)*(y2-y1);
}
bool IsOk(POINT a,POINT b) //在构造有向网时判断两个点之间能否连一条边
{
if(a.x>=b.x) return false;
bool flag=true;
int i=0;
while(wX[i]<=a.x && i<n)
i++;
while(wX[i]<b.x && i<n)
{
if(Cross(a.x,a.y,b.x,b.y,wX[i],0)*Cross(a.x,a.y,b.x,b.y,wX[i],pY[i][0])<0
||Cross(a.x,a.y,b.x,b.y,wX[i],pY[i][1])*Cross(a.x,a.y,b.x,b.y,wX[i],pY[i][2])<0
||Cross(a.x,a.y,b.x,b.y,wX[i],pY[i][3])*Cross(a.x,a.y,b.x,b.y,wX[i],10)<0
)
{
flag=false;
break;
}
i++;
}
return flag;
}
double BellmanFord(int beg,int end)
{
double d[MAXN];
int i,j;
for(i=0;i<MAXN;i++)
{
d[i]=INF;
}
d[beg]=0;
bool ex=true;
for(i=0;i<pSize && ex;i++)//如果在某次循环中,考虑每条边后,都没能改变当前源点到所有顶点的最短长度,就可以提前结束
{
ex=false;
for(j=0;j<eSize;j++)
{
if(d[e[j].u]<INF && d[e[j].v]>d[e[j].u]+g[e[j].u][e[j].v])
{
d[e[j].v]=d[e[j].u]+g[e[j].u][e[j].v];
ex=true;
}
}
}
return d[end];
}
void Solve()
{
p[0].x=0;
p[0].y=5;
pSize=1;
for(i=0;i<n;i++)
{
cin>>wX[i];
for(j=0;j<4;j++)
{
p[pSize].x=wX[i];
cin>>p[pSize].y;
pY[i][j]=p[pSize].y;
pSize++;
}
}
p[pSize].x=10;
p[pSize].y=5;
pSize++;
for(i=0;i<pSize;i++)
{
for(j=0;j<pSize;j++)
g[i][j]=INF;
}
eSize=0;
for(i=0;i<pSize;i++)
{
for(j=i+1;j<pSize;j++)
{
if(IsOk(p[i],p[j]))
{
g[i][j]=Dis(p[i],p[j]);
e[eSize].u=i;
e[eSize].v=j;
eSize++;
}
}
}
printf("%.2lf\n",BellmanFord(0,pSize-1));
}
int main()
{
while(cin>>n)
{
if(n==-1) break;
Solve();
}
return 0;
}