1003. Emergency (25)

最新推荐文章于 2019-10-30 19:19:20 发布

liudy95

最新推荐文章于 2019-10-30 19:19:20 发布

阅读量261

点赞数

分类专栏： ACM 文章标签： PAT

本文链接：https://blog.csdn.net/liudyOoO/article/details/73261953

版权

ACM 专栏收录该内容

19 篇文章 0 订阅

订阅专栏

#include <iostream>

using namespace std;
#define Max 999999999
int dis[501][501];
int team[501];
struct City{
  int  step, teams;
  City(){
    step = Max;
    teams = 0;
  }
};
City city[500];
int min_dis = Max, num_road = 0, num_team;
bool visit[501] = {0};
void DFS(int cur, int end, int num_citys){
  if(cur == end){
    if(city[cur].step < min_dis){
      min_dis = city[cur].step;
      num_road = 1;
      num_team = city[cur].teams;
    }else if(city[cur].step == min_dis){
      num_road++;
      if(num_team < city[cur].teams)
        num_team = city[cur].teams;
    }
    return;
  }
  visit[cur] = 1;
  for(int i = 0; i < num_citys; i++){
    if(!visit[i] && dis[cur][i]){
      city[i].step = dis[cur][i] + city[cur].step;
      city[i].teams = team[i] + city[cur].teams;
      DFS(i, end, num_citys);
      city[i].step = Max;
      city[i].teams = 0;
    }
  }
  visit[cur] = 0;
}
int main(){
  int N, M, C1, C2;
  cin >> N >> M >> C1 >> C2;
  for(int i = 0; i < N; i++)
    cin >> team[i];
  for(int i = 0; i < M; i++){
    int city1, city2, distance;
    cin >> city1 >> city2 >> distance;
    dis[city1][city2] = distance;
    dis[city2][city1] = distance;
  }

  city[C1].step = 0;
  city[C1].teams = team[C1];
  DFS(C1, C2, N);
  cout << num_road << " " << num_team << endl;
  return 0;
}