PAT 甲级 1003 Emergency （dfs+剪枝）

1003 Emergency (25 分)

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, 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.

题目链接：https://pintia.cn/problem-sets/994805342720868352/problems/994805523835109376

题目大意：给定n个城市，每个城市都有相对应的人数，当前你在c1，目标去c2，每次到达一个城市就会带上该城市的人。
求c1到c2的最短路径的条数，以及在多条最短路径中（路线不同，但步数相同），求最大人数。
思路：
求c1到c2的最短路径，用dfs遍历邻接矩阵，求得c1到c2的所有路径，取得最小的Minpath和pathNum，并且更新Maxpeople。
中间需要剪枝，否则会超时

ac代码：

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;

int Maxpeo=-1,MinPath=99999999,pathNum=1;
int n,m,C1,C2,rescue[505];
int road[505][505];
int vis[505][505];
void dfs(int now,int people,int path)
{
    if(path>MinPath) return;//剪枝，不加这句会有一个测试点超时
    if(now==C2)//到达终点后
    {
        if(path<MinPath)//当前是最短路径，更新pathnum和people
        {
            pathNum=1;
            Maxpeo=people;
            MinPath=path;
        }
        else if(path==MinPath)//有多条最短路径
        {
            pathNum++;
            Maxpeo=max(Maxpeo,people);
        }
        return ;
    }
    for(int i=0;i<501;i++)
    {
        if(road[now][i]!=0 && vis[now][i]==0 && now!=i)
        {
//            printf("now=%d i=%d\n",now,i);
            vis[now][i]=vis[i][now]=1;
            dfs(i,  people+rescue[i]   ,path+road[now][i]);
            vis[now][i]=vis[i][now]=0;
        }
    }
    return ;
}
int main()
{
    cin>>n>>m>>C1>>C2;
    for(int i=0;i<n;i++)
        cin>>rescue[i];
    int c1,c2,L;
    for(int i=0;i<m;i++)
    {
        cin>>c1>>c2>>L;
        road[c1][c2]=L;road[c2][c1]=L;
    }
    dfs(C1,rescue[C1],0);
    cout<<pathNum<<" "<<Maxpeo<<endl;
    return 0;
}