[luoguP1027] Car的旅行路线（Floyd）

传送门

建图麻烦，建完图搞一遍Floyd就好了。

——代码

 #include <iostream>
 #include <cstdio>
 #include <cmath>

 using namespace std;

 int n, s, a, b;
 int t, x[][], y[][], T[];
 double map[][], ans;

 inline int square(int ax)
 {
     return ax * ax;
 }

 inline int dis(int ax, int ay, int bx, int by)
 {
     return square(ax - bx) + square(ay - by);
 }

 int main()
 {
     int i, j, k;
     scanf("%d", &n);
     while(n--)
     {
         scanf("%d %d %d %d", &s, &t, &a, &b);
         for(i = ; i <  * s; i++)
          for(j = ; j <  * s; j++)
           map[i][j] = ;
         ans = ;
         for(i = ; i < s; i++)
         {
             scanf("%d %d %d %d %d %d %d", &x[i][], &y[i][], &x[i][], &y[i][], &x[i][], &y[i][], &T[i]);
             if(dis(x[i][], y[i][], x[i][], y[i][]) > dis(x[i][], y[i][], x[i][], y[i][])
             && dis(x[i][], y[i][], x[i][], y[i][]) > dis(x[i][], y[i][], x[i][], y[i][]))
             {
                 x[i][] = x[i][] + x[i][] - x[i][];
                 y[i][] = y[i][] + y[i][] - y[i][];
             }
             else if(dis(x[i][], y[i][], x[i][], y[i][]) > dis(x[i][], y[i][], x[i][], y[i][])
                  && dis(x[i][], y[i][], x[i][], y[i][]) > dis(x[i][], y[i][], x[i][], y[i][]))
                  {
                      x[i][] = x[i][] + x[i][] - x[i][];
                      y[i][] = y[i][] + y[i][] - y[i][];
                  }
             else if(dis(x[i][], y[i][], x[i][], y[i][]) > dis(x[i][], y[i][], x[i][], y[i][])
                  && dis(x[i][], y[i][], x[i][], y[i][]) > dis(x[i][], y[i][], x[i][], y[i][]))
                  {
                      x[i][] = x[i][] + x[i][] - x[i][];
                      y[i][] = y[i][] + y[i][] - y[i][];
                   }
             map[ * i][ * i + ] = map[ * i + ][ * i] = sqrt(dis(x[i][], y[i][], x[i][], y[i][])) * T[i];
             map[ * i][ * i + ] = map[ * i + ][ * i] = sqrt(dis(x[i][], y[i][], x[i][], y[i][])) * T[i];
             map[ * i][ * i + ] = map[ * i + ][ * i] = sqrt(dis(x[i][], y[i][], x[i][], y[i][])) * T[i];
             map[ * i + ][ * i + ] = map[ * i + ][ * i + ] = sqrt(dis(x[i][], y[i][], x[i][], y[i][])) * T[i];
             map[ * i + ][ * i + ] = map[ * i + ][ * i + ] = sqrt(dis(x[i][], y[i][], x[i][], y[i][])) * T[i];
             map[ * i + ][ * i + ] = map[ * i + ][ * i + ] = sqrt(dis(x[i][], y[i][], x[i][], y[i][])) * T[i];
             for(j = ; j <  * i; j++)
              for(k =  * i; k <  * i + ; k++)
               map[k][j] = map[j][k] = sqrt(dis(x[j / ][j %  + ], y[j / ][j %  + ], x[k / ][k %  + ], y[k / ][k %  + ])) * t;
         }
         for(i = ; i <  * s; i++) map[i][i] = ;
         for(k = ; k <  * s; k++)
          for(i = ; i <  * s; i++)
           for(j = ; j <  * s; j++)
            map[i][j] = min(map[i][j], map[i][k] + map[k][j]);
         for(i =  * a - ; i <  * a; i++)
          for(j =  * b - ; j <  * b; j++)
           ans = min(ans, map[i][j]);
         printf("%.1f\n", ans);
     }
     return ;
 }