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

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

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

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

Sample Output

2 4

思路:题目意思是给你一个带权的无向图,求起点到终点最短路有几条,并求最大权值,采用深搜就可以解决,记得剪枝方可过全部测试数据。

Code:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
using namespace std;
#define max 510
#define INF 0x7fffffff
typedef struct
{
    int vex[max];
    int edge[max][max];
    int n,e;
}MGraph;
MGraph g;
int cnt,maxteam,mindis,visit[max];
void dfs(int p,int end,int dist,int te)
{
    if(p==end)
    {
        if(dist<mindis)
        {
            mindis=dist;
            cnt=1;
            maxteam=te;
        }
        else if(dist==mindis)
        {
            ++cnt;
            if(maxteam<te)
                maxteam=te;
        }
        return;
    }
    if(dist>mindis)
        return;
    for(int i=0;i<g.n;++i)
    {
        if(visit[i]==0&&g.edge[p][i]!=INF)
        {
            visit[i]=1;
            dfs(i,end,dist+g.edge[p][i],te+g.vex[i]);
            visit[i]=0;
        }
    }
}
int main()
{
    int st,ed,i,j,c1,c2,l;
    mindis=INF;
    cin>>g.n>>g.e>>st>>ed;
    for(i=0;i<g.n;++i)
    {
        cin>>g.vex[i];
        visit[i]=0;
        for(j=0;j<g.n;++j)
            g.edge[i][j]=INF;
    }
    for(i=0;i<g.e;++i)    
    {
        cin>>c1>>c2>>l;
        g.edge[c2][c1]=g.edge[c1][c2]=l;
    }
    dfs(st,ed,0,g.vex[st]);
    cout<<cnt<<" "<<maxteam<<endl;
    return 0;
}