You have just moved from a quiet Waterloo neighbourhood to a big, noisy city. Instead of getting to ride your bike to school every day, you now get to walk and take the subway. Because you don't want to be late for class, you want to know how long it will take you to get to school.
You walk at a speed of 10 km/h. The subway travels at 40 km/h.
Assume that you are lucky, and whenever you arrive at a subway station, a
train is there that you can board immediately. You may get on and off
the subway any number of times, and you may switch between different
subway lines if you wish. All subway lines go in both directions.

Input
consists of the x,y coordinates of your home and your school, followed
by specifications of several subway lines. Each subway line consists of
the non-negative integer x,y coordinates of each stop on the line, in
order. You may assume the subway runs in a straight line between
adjacent stops, and the coordinates represent an integral number of
metres. Each line has at least two stops. The end of each subway line is
followed by the dummy coordinate pair -1,-1. In total there are at most
200 subway stops in the city.

Output is the number of minutes it will take you to get to school, rounded to the nearest minute, taking the fastest route.

0 0 10000 1000

0 200 5000 200 7000 200 -1 -1

2000 600 5000 600 10000 600 -1 -1

21

已知家和学校的坐标，并给出若干条地铁线，以及步行速度和地铁速度，求从家到学校最少需要多少时间
题目的难点在于输入和建图，由于输入的点最多200个，我们可以直接读入点的坐标，生成一个邻接矩阵，而同一地铁线上的各个站点，就可以在输入是直接存入邻接矩阵了，为了便于松弛，邻接矩阵中我们存入路径的用时，注意速度的单位是km/h，而路程的单位是m
建好图之后，就是一个简单的最短路问题了

 #include<iostream>

 #include<cstring>

 #include<cmath>

 #include<algorithm>

 #include<map>

 #include<cstdio>

 #include<queue>

 #include<stack>

 using namespace std;

 const int INF = 0x3f3f3f3f;

 const int MAXN = ;

 const double wsp =  *  / ;

 const double ssp =  *  / ;

 struct Node{

     double x, y;

 }node[MAXN];

 struct ff{

     int x, d;

     ff(){}

     ff( int a, double b ){ x = a; d = b; }

     bool operator <( const ff & a )const{

         return d > a.d;

     }

 };

 int cnt;

 double cost[MAXN][MAXN];

 double dis[MAXN];

 double gdis( int pre, int pos ){

     double dx = node[pre].x - node[pos].x;

     double dy = node[pre].y - node[pos].y;

     return sqrt( dx * dx + dy * dy );

 }

 void dij(){

     for( int i = ; i < MAXN; i++ )

         dis[i] = INF;

     dis[] = ;

     priority_queue<ff> Q;

     Q.push( ff( , dis[]) );

     while( !Q.empty() ){

         ff temp = Q.top(); Q.pop();

         int x = temp.x;

         if( temp.d > dis[x] ) continue;

         for( int i = ; i < cnt; i++ ){

             if( dis[i] > dis[x] + cost[x][i] ){

                 dis[i] = dis[x] + cost[x][i];

                 Q.push( ff( i, dis[i] ) );

             }

         }

     }

 }

 int main(){

     ios::sync_with_stdio( false );

     for( int i = ; i < MAXN; i++ )

         for( int j = ; j < MAXN; j++ )

             cost[i][j] = INF;

     cin >> node[].x >> node[].y >> node[].x >> node[].y;

     cnt = ;

     while( cin >> node[cnt].x >> node[cnt].y ){

         cnt++;

         while( cin >> node[cnt].x >> node[cnt].y, !( node[cnt].x == - && node[cnt].y == - ) ){

             cost[cnt][cnt - ] = cost[cnt - ][cnt] = gdis( cnt - , cnt ) / ssp;

             cnt++;

         }

     }

     for( int i = ; i < cnt - ; i++ ){

         cost[i][i] = ;

         for( int j = i + ; j < cnt; j++ ){

             cost[i][j] = cost[j][i] = min( cost[i][j], gdis( i, j ) / wsp );

         }

     }

     dij();

     cout << int( dis[] + 0.5 );

 }