poj 1556 The Doors（线段相交，最短路）

 

The Doors

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 7430		Accepted: 2915

Description

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 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<cmath>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #define FOR(a,b,c) for(int a=(b);a<=(c);a++)
 using namespace std;

 const int N = +;
 const double INF = 1e9;
 const double eps = 1e-;

 int dcmp(double x) {
     if(x<eps) return ; else return x<? -:;
 }

 struct Pt {
     double x,y;
     Pt(double x=,double y=):x(x),y(y) {};
 };
 struct Seg { Pt a1,a2; };
 typedef Pt vec;

 vec operator - (Pt A,Pt B) { return vec(A.x-B.x,A.y-B.y); }
 bool operator != (Pt A,Pt B) {
     if(dcmp(A.x-B.x)== && dcmp(A.y-B.y)==) return ;
     else return ;
 }

 double cross(Pt A,Pt B) { return A.x*B.y-A.y*B.x; }

 bool SegInter(Pt s1, Pt e1, Pt s2, Pt e2) {
     if(
         cross(e1-s1,s2-s1) * cross(e1-s1,e2-s1) <=  &&
         cross(e2-s2,s1-s2) * cross(e2-s2,e1-s2) <=
       ) return true;
     return false;
 }
 double dist(Pt a,Pt b) {
     return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
 }
 double f[N][N];
 Seg L[N]; int lc;
 Pt P[N]; int pc;
 int n;

 int main() {
     while(scanf("%d",&n)== && n>) {
         pc=lc=;
         FOR(i,,n) {
             double x,y1,y2,y3,y4;
             scanf("%lf%lf%lf%lf%lf",&x,&y1,&y2,&y3,&y4);
             L[++lc]=(Seg) {Pt(x,),Pt(x,y1)};
             L[++lc]=(Seg) {Pt(x,y2),Pt(x,y3)};
             L[++lc]=(Seg) {Pt(x,y4),Pt(x,)};
             P[++pc]=Pt(x,y1) , P[++pc]=Pt(x,y2);
             P[++pc]=Pt(x,y3) , P[++pc]=Pt(x,y4);
         }
         P[++pc]=Pt(,), P[++pc]=Pt(,);
         FOR(i,,pc) FOR(j,,pc) f[i][j]=INF;
         FOR(i,,pc) FOR(j,i+,pc) {
             bool flag=;
             FOR(k,,lc)
             if(SegInter(P[i],P[j],L[k].a1,L[k].a2))
                 { flag=; break; }
             if(flag)
                 f[i][j]=f[j][i]=dist(P[i],P[j]);
         }
         FOR(i,,n) {
             FOR(j,i+,n) if(f[i][j]!=INF)
                 printf("%d,%d : %.2lf\n",i,j,f[i][j]);
         }
         FOR(k,,pc) FOR(i,,pc) FOR(j,,pc)
             f[i][j]=min(f[i][j],f[i][k]+f[k][j]);
         printf("%.2lf\n",f[pc-][pc]);
     }
     return ;
 }