1030. Travel Plan (30)寻找最短路径-白红宇

1030. Travel Plan (30)寻找最短路径

阅读量：4072 次

发布时间：2019-05-25

本文共 748 字，大约阅读时间需要 2 分钟。

题目传送门:

AC代码

#include 
   
    #include 
    
     #include 
     
      #include 
      
       #include 
       
        #include 
        
         #include 
         
          #include 
          using namespace std;struct highway{ int startCity,endCity,distances,cost;};struct city{ int id; vector
           
            distance;};struct onePath{ vector
            
              h; int cost,distance; onePath(vector
             
               _h,int _cost,int _distance):h(_h),cost(_cost),distance(_distance){};};vector
              
               allPath;void findShortPath(vector
               
                ans,int start,int end,vector
                
                 curPath,int cost,int distance,vector
                 
                  has){ if(start==end){ onePath o(curPath,cost,distance); allPath.push_back(o); }else{ for (int i=0; i
                  
                   ans(N); for (int i=0; i
                   
                    (),0,0,vector
                    
                     ()); sort(allPath.begin(), allPath.end(), [](onePath a,onePath b){ if(a.distance!=b.distance) return a.distance