源地址:http://www.patest.cn/contests/pat-a-practise/1003
题目大意就是给你n座城市(编号从0-n-1),m条道路,起点c1,终点c2,然后接下去一行有n个数hands[0]....hands[n-1],代表每座城市有hands[i]个team,每经过一座城市就能收集到那个城市的team,然后接下去m行,每行三个数u,v,c,代表连接城市u和v的道路长为c,现在问你从c1到c2的最短路有几条,并且在这几条最短路中,能够收集到最多team是多少。
这道题目刚开始我采用的是 最短路+深搜的方法,即先求出最短路,然后将这个距离记下来,从起点深搜所有去终点的路,看看哪条路的长度和这个最短路一样,并且在这个条件下更新最多的team值。
#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<set>
#include<map>
//#define ONLINE_JUDGE
#define eps 1e-3
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
#define ll __int64
int n,m;
#define Mod 1000000007
#define N 510
#define M 1000100
const int size = 10010;
const int mod = 9901;
char ch[M];
int c1,c2;
int hands[N];
int mp[N][N];
int vis1[N];
int length;
int path,team;
void Init(){
for(int i=0;i<=n;i++)
for(int j=0;j<=n;j++){
if(i == j) mp[i][j] = 0;
else
mp[i][j] = INF;
}
}
void Dijkstra(){
int vis[N];
int dis[N];
memset(vis,0,sizeof vis);
for(int i=0;i<n;i++)
dis[i] = mp[c1][i];
dis[c1] = 0;
for(int i=0;i<n;i++){
int mmin = INF;
int flag = -1;
for(int j=0;j<n;j++)
if(!vis[j] && mmin>dis[j])
mmin = dis[flag=j];
if(mmin == INF) break;
vis[flag] = 1;
for(int j=0;j<n;j++)
if(!vis[j] && mp[flag][j]!=INF&&dis[j]>mmin+mp[flag][j])
dis[j] = mmin+mp[flag][j];
}
length = dis[c2];
}
void dfs(int u,int maxhands,int len){ //u代表当前节点,maxhands代表当前的team数,len代表当前路径的长度
if(u == c2 && len == length){
team = Max(maxhands,team);
path++;
return;
}
for(int i=0;i<n;i++){
if(!vis1[i]&&mp[u][i] != INF){
vis1[i] = 1;
dfs(i,maxhands+hands[i],len+mp[u][i]);
vis1[i] = 0;
}
}
return;
}
int main(){
while(scanf("%d%d%d%d",&n,&m,&c1,&c2)!=EOF){
Init();
for(int i=0;i<n;i++)
sf(hands[i]);
int u,v,c;
for(int i=0;i<m;i++){
scanf("%d%d%d",&u,&v,&c);
if(mp[u][v]>c){
mp[u][v] = c;
mp[v][u] =c;
}
}
Dijkstra();
path=0;
team=0;
memset(vis1,0,sizeof vis1);
vis1[c1] = 1;
dfs(c1,hands[c1],0);
printf("%d %d\n",path,team);
// printf("%d\n",length);
}
return 0;
}
后来稍微参照了别人的思路,,发现并没有这么麻烦,在求最短路的过程中,我们就能够把这些信息都记录下来。
这样子既方便速度也更快。
#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<set>
#include<map>
//#define ONLINE_JUDGE
#define eps 1e-3
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
#define ll __int64
int n,m;
#define Mod 1000000007
#define N 510
#define M 1000100
const int size = 10010;
const int mod = 9901;
char ch[M];
int c1,c2;
int hands[N];
int mp[N][N];
struct Path{
int val,num,team; //val代表路径长度,num代表最短路径的数目,team代表到达某个城市后能够搜集的最多的team值
}p[N];
void Init(){
for(int i=0;i<=n;i++)
for(int j=0;j<=n;j++){
if(i == j) mp[i][j] = 0;
else
mp[i][j] = INF;
}
}
void Dijkstra(){
int vis[N];
memset(vis,0,sizeof vis);
for(int i=0;i<n;i++){
p[i].val = mp[c1][i];
p[i].team = 0;
p[i].num = 0;
}
p[c1].val = 0;
p[c1].team = hands[c1];
p[c1].num = 1;
for(int i=0;i<n;i++){
int mmin = INF;
int flag = -1;
for(int j=0;j<n;j++)
if(!vis[j] && mmin>p[j].val)
mmin = p[flag=j].val;
if(mmin == INF) break;
vis[flag] = 1;
for(int j=0;j<n;j++){
if(vis[j] || mp[flag][j]==INF) continue;
if(p[j].val>mmin+mp[flag][j]){
p[j].val = mmin+mp[flag][j];
p[j].num = p[flag].num; //在寻找最短路的过程中,它们之间的最短路数目是一样的,因为它们在同一条最短路上面
p[j].team = p[flag].team+hands[j]; //
}else if(p[j].val == mmin+mp[flag][j]){
p[j].num += p[flag].num; //如果有else if()这个条件成立,那么从j到终点的最短路数目要+从flag到达终点的最短路数目
if(p[j].team<p[flag].team+hands[j]) //更新最大的team值
p[j].team = p[flag].team+hands[j];
}
}
}
printf("%d %d\n",p[c2].num,p[c2].team);//输出到终点的最短路数目和能够搜集到的最大team值
}
int main(){
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
#endif
while(scanf("%d%d%d%d",&n,&m,&c1,&c2)!=EOF){
Init();
for(int i=0;i<n;i++)
sf(hands[i]);
int u,v,c;
for(int i=0;i<m;i++){
scanf("%d%d%d",&u,&v,&c);
if(mp[u][v]>c){
mp[u][v] = c;
mp[v][u] =c;
}
}
Dijkstra();
// printf("%d\n",length);
}
return 0;
}