PAT Advanced 1003 Emergency-CSDN博客

本文链接：https://blog.csdn.net/weixin_42265429/article/details/103858326

Emergency

As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the length of each road between any pair of cities are marked on the map. When there is an emergency call to you from some other city, your job is to lead your men to the place as quickly as possible, and at the mean time, call up as many hands on the way as possible.

Input Specification:

Each input file contains one test case. For each test case, the first line contains 4 positive integers: N (≤500) - the number of cities (and the cities are numbered from 0 to N−1), M - the number of roads, C1 and C2 - the cities that you are currently in and that you must save, respectively. The next line contains N integers, where the i-th integer is the number of rescue teams in the i-th city. Then M lines follow, each describes a road with three integers c1, c2 and L, which are the pair of cities connected by a road and the length of that road, respectively. It is guaranteed that there exists at least one path from C1 to C2.

Output Specification:

For each test case, print in one line two numbers: the number of different shortest paths between C1 and C2, and the maximum amount of rescue teams you can possibly gather. All the numbers in a line must be separated by exactly one space, and there is no extra space allowed at the end of a line.

Sample Input:

Sample Output:

2 4

题目大意：

本题是一道最短路径的问题，给定点的数量n，边数量m，起点st，终点des，对应每个点都有固定的权值，找到由起点到中终点的最短路径的条数，并输出在最短路径中权值最大的值

解题思路：

本题主要是dijkstra算法的使用，在基础上需要求出路径的条数，并求出可选路径中最大的权值，需要添加 nums数组表示到当前点的路径条数，w数组表示到每个点的最大权值

解题代码

#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;

const int N = 510, INF = 0x3f3f3f3f;
int g[N][N], dist[N], w[N];
int wei[N], nums[N];
bool vis[N];

int n, m, st, des;
void dijkstra(int s){
    memset(dist, 0x3f, sizeof dist);
    dist[s] = 0, nums[s] = 1, w[s] = wei[s];
    for (int i = 0; i < n; i ++){
        int t = -1;
        for (int j = 0; j < n; j++)
            if (!vis[j] && (t == -1 || dist[t] > dist[j]))
                t = j;
        for (int j = 0; j < n; j++){
            if (dist[j] > dist[t] + g[t][j]){
                dist[j] = dist[t] + g[t][j];
                w[j] = w[t] + wei[j];
                nums[j] = nums[t];
            } else if (dist[j] == dist[t] + g[t][j]){
                if (w[j] < w[t] + wei[j]) w[j] = w[t] + wei[j];
                nums[j] += nums[t];
            }
        }
        vis[t] = true;
    }
}
int main(){
    scanf("%d %d %d %d", &n , &m, &st, &des);
    memset(g, 0x3f, sizeof g);
    for (int i = 0 ; i < n; i++) scanf("%d", &wei[i]);
    while (m --){
        int a, b, c;
        scanf("%d %d %d", &a, &b, &c);
        g[a][b] = g[b][a] = c;
    }
    dijkstra(st);
    printf("%d %d", nums[des], w[des]);
    return 0;
}