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:
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
题目大意:给定一个图,已知起点与终点,求两个点之间的最短路径,如果不唯一选择输出最大点权和的路径(救援队数目最多)
最后输出最短路径数,以及所有路径中可获得的最大救援队数目
思路:dijkstra+dfs即可
#include <iostream>
#include <cstdio>
#include <string>
#include <map>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cctype>
#include <cstring>
#include <cmath>
#include <set>
#include <sstream>
using namespace std;
const int INF=0x3fffffff;
struct node
{
int v;
int dis;
};
int n,m,st,aim; //结点数,边数,起点以及终点
vector<node>adj[505];
bool vis[505]={0};
vector<int>pre[505];
vector<int>path,temppath;
int weight[505]; //点权数组
int d[505];
int numpath=0; //路径数目
int maxnum=-1; //最短路径中可调动的最大救援队数目
void dijkstra(int s) //完全模板
{
fill(d,d+505,INF);
d[s]=0;
for(int i=0;i<n;i++){
int u=-1,MIN=INF;
for(int j=0;j<n;j++){
if(vis[j]==false&&d[j]<MIN){
u=j;
MIN=d[j];
}
}
if(u==-1) return;
vis[u]=true;
for(int j=0;j<(int)adj[u].size();j++){
int v=adj[u][j].v;
if(vis[v]==false&&d[u]+adj[u][j].dis<d[v]){
d[v]=d[u]+adj[u][j].dis;
pre[v].clear();
pre[v].push_back(u);
}
else if(vis[v]==false&&d[u]+adj[u][j].dis==d[v]){
pre[v].push_back(u);
}
}
}
}
void dfs(int v) //第一标尺模板
{
if(v==st){
numpath++;
int tempsum=0;
temppath.push_back(v);
for(int i=temppath.size()-1;i>=0;i--){
tempsum+=weight[temppath[i]];
}
if(tempsum>maxnum){ //进行选取
path=temppath;
maxnum=tempsum;
}
temppath.pop_back();
return;
}
temppath.push_back(v);
for(int i=0;i<(int)pre[v].size();i++){
dfs(pre[v][i]);
}
temppath.pop_back();
}
int main()
{
scanf("%d%d%d%d",&n,&m,&st,&aim);
for(int i=0;i<n;i++){
scanf("%d",&weight[i]);
}
for(int i=0;i<m;i++){
int a,b,dis;
scanf("%d%d%d",&a,&b,&dis);
adj[a].push_back(node{b,dis});
adj[b].push_back(node{a,dis});
}
dijkstra(st);
dfs(aim);
printf("%d %d",numpath,maxnum);
return 0;
}