[PAT Advanced Level] 1003 Emergency

[PAT Advanced Level] 1003 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(\le 500)$ - the number of cities (and the cities are numbered from 0 to N−1), M - the number of roads, $C_1$ and $C_2$ - 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 $c_1$,$c_2$
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 $C_1$ to $C_2$.

Output Specification:
For each test case, print in one line two numbers: the number of different shortest paths between $C_1$ and$C_2$ , 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.

寻找最短路径，N为城市数，M为路径数，$C_1$ 为起始点，$C_2$ 为终点，需寻找起点到终点的最短路径，且所获得救援队最多的路径。

输入第一行为，城市数，路径数，起始点，终点；第二行为各个城市所拥有的救援队数目；接下来为距离矩阵，第一位起点，第二位终点，第三位路径长度。

输出，第一位为最短路径，第二位为所拥有的救援队数。
示例

输入：
5 6 0 2
1 2 1 5 3
0 1 1
0 2 2
0 3 1
1 2 1
2 4 1
3 4 1

输出：
2 4

题解

Dijkstra法，from《算法笔记——上机训练实战指南》

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXV=510;     //最大顶点数
const int INF=1000000000;       //无穷大

//n为顶点数，m为边数，st为起点，ed为终点
//G为邻接矩阵，weight为点权
//d[]记录最短距离，w[]记录最大点权之和，num[]记录最短路径条数
int n,m,st,ed,G[MAXV][MAXV],weight[MAXV];
int d[MAXV],w[MAXV],num[MAXV];
bool vis[MAXV]={false};     //vist[i]=true，表示顶点i已访问，初始值均为false

void Dijkstra(int s)
{
//s为起点
    
    fill(d,d+MAXV,INF);
    memset(num,0,sizeof(num));
    memset(w,0,sizeof(w));
    d[s]=0;
    w[s]=weight[s];
    num[s]=1;
    for(int i=0;i<n;i++)
    {
        int u=-1,MIN=INF;
        for(int j=0;j<n;j++)    //找到未访问的顶点中d[]最小的，第一轮遍历为起始点
        {
            if(vis[j]==false&&d[j]<MIN)
            {
                u=j;
                MIN=d[j];
            }
        }
        //找不到小于INF的d[u],说明剩下的顶点和起点s不连通
        if(u==-1)   return;
        vis[u]=true;    //标记u为已访问
        for(int v=0;v<n;v++)
        {
            //如果v未访问 && u能到达v && 以u为中介点可以使d[v]更优
            if(vis[v]==false && G[u][v]!=INF)
            {
                if(d[u]+G[u][v]<d[v])
                {
                    d[v]=d[u]+G[u][v];
                    w[v]=w[u]+weight[v];
                    num[v]=num[u];
                }
                else if(d[u]+G[u][v]==d[v])
                {
                    if(w[u]+weight[v]>w[v])
                    {
                        w[v]=w[u]+weight[v];
                    }
                    num[v]+=num[u];
                }
                
            }
        }
    }
}

int main()
{
    scanf("%d%d%d%d",&n,&m,&st,&ed);
    for(int i=0;i<n;i++)
    {
        scanf("%d",&weight[i]); //读入点权
    }
    int u,v;
    fill(G[0],G[0]+MAXV*MAXV,INF);  //初始化图G
    for(int i=0;i<m;i++)
    {
        scanf("%d%d",&u,&v);
        scanf("%d",&G[u][v]);   //读入边权
        G[v][u]=G[u][v];
    }
    Dijkstra(st);
    printf("%d %d\n",num[ed],w[ed]);
    return 0;
}

memset函数的使用
内存赋值函数，用于给某一块内存空间赋值，s为数组或指针，v为要填充的值，n为要填充的字节数。

void *memset(void *s, int v, size_t n);

fill函数的使用
给数组或vector中的每个元素赋以相同的值，赋值范围 [first,last) ，所赋的值为val

template <class ForwardIterator, class T>
  void fill (ForwardIterator first, ForwardIterator last, const T& val)
{
  while (first != last) {
    *first = val;
    ++first;
  }
}

区别
因为memset函数按照字节填充，所以一般memset只能用来填充char型数组，（因为只有char型占一个字节）如果填充int型数组，除了0和-1，其他的不能。

fill函数可以赋值任何数