PTA练习

L2-001 紧急救援 （25 分) （最短路+路径打印+最短路径个数）

const int N = 510;
int dist[N],g[N][N];
bool st[N];
int road[N];
int num[N],tot[N],pre[N];
int n,m,s,d;

void dijkstra(int be)
{
   MEM(dist,INF);
   dist[be] = 0;
   tot[be] = num[be];
   road[be] = 1;
   for(int i=1;i<=n;++i)
   {
      int t = -1;
      for(int j=1;j<=n;++j)
      {
         if(!st[j] && (t == -1 || dist[j] < dist[t]))
         {
            t = j;
         }
      }
      // if(t == -1) break;
      st[t] = 1;
      for(int j=1;j<=n;++j)
      {
         if(!st[j] && dist[t] + g[t][j] < dist[j])
         {
            road[j] = road[t];
            dist[j] = dist[t] + g[t][j];
            tot[j] = tot[t] + num[j];
            pre[j] = t;
         }
         else if(!st[j] && dist[t] + g[t][j] == dist[j])//有某个点到源点的距离 == 这个点先到t点再t->源点的距离，走那条路呢？当然走救援队多的那条路
         {
            if(tot[t] + num[j] > tot[j])
            {
               tot[j] = tot[t] + num[j];
               pre[j] = t;
            }
            road[j] += road[t];
         }
      }
   }
}

int main()
{
   //freopen("in.txt","r",stdin);
   //freopen("out.txt","w",stdout);
   IOS;
   MEM(g,INF);
   MEM(st,0);
   cin >> n >> m >> s >> d;
   s++,d++;
   rep(i,1,n)
   {
      cin >> num[i];
   }
   while(m--)
   {
      int u,v,w;
      cin >> u >> v >> w;
      u++,v++;
      g[u][v] = w;
      g[v][u] = w;
   }
   dijkstra(s);
   int mi = INF;
   // rep(i,1,n) cout << dist[i] << " \n"[i==n];
   cout << road[d] << " " << tot[d] << endl;
   vector<int>v;
   v.pb(d-1);
   for(int i=pre[d];i>=1;i=pre[i])
   {
      v.pb(i-1);
   }
   int sz = v.size();
   for(int i=sz-1;i>=1;--i) cout << v[i] << " ";
   cout << v[0];
}