刷题向 | 最短路相关

求最短路条数和最短路经过的点的权重和最大值

基本按照dij最短路做，更新时距离相等时也要更新，但是距离相等时经过点的权重和要取大值

#include<stdio.h>
#include<vector>
#include<algorithm>
#include<string.h>
#include<iostream>
#include<limits>
#include<fstream>
#include<math.h>
#include<stack>
#include<queue>
#include<bitset>
#include<utility>
#include<set>
#include<map>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
const int N=505;
const ll mod=1e9+7;
const int M=10000;
int n,m,s,t;
struct Point{
	int p;
	ll l;
	friend bool operator<(Point a,Point b){
		return a.l>b.l;
	}
};
struct Edge{
	int y;
	ll l;
	int nt;	
};
int head[N];
Edge e[N*N];
int a[N];
ll dis[N];
ll ans[N];
ll an;
ll at;
void solve(){
	priority_queue<Point> q;
	Point sp;
	sp.p=s;
	sp.l=0;
	memset(dis,127,sizeof(dis));
	memset(ans,0,sizeof(ans));
	ans[s]=a[s];
	dis[s]=0;
	q.push(sp);
	an=0;
	at=0;
	while(!q.empty()){
		Point now=q.top();
		q.pop();
		//cout<<now.p<<"     *******"<<endl;
		if(now.p==t){
			an++;
			at=max(at,ans[t]);
			continue;
		}
		Point x;
		for(int i=head[now.p];i!=-1;i=e[i].nt){			
			if(dis[now.p]+e[i].l<=dis[e[i].y]){
				dis[e[i].y]=dis[now.p]+e[i].l;
				
				//!!!
				if(dis[now.p]+e[i].l==dis[e[i].y]){
					ans[e[i].y]=max(ans[e[i].y],ans[now.p]+a[e[i].y]);
				}
				else ans[e[i].y]=ans[now.p]+a[e[i].y];
									
				x.p=e[i].y;
				x.l=dis[x.p];
				q.push(x);
			}
		}
	}
}
void add(int i,int x,int y,ll l){
	e[i].y=y;
	e[i].l=l;
	e[i].nt=head[x];
	head[x]=i;
}
int main(){
	while(~scanf("%d%d%d%d",&n,&m,&s,&t)){
		for(int i=0;i<n;i++){
			scanf("%d",&a[i]);
		}
		memset(head,-1,sizeof(head));
		int xx,yy;
		ll l;
		for(int i=0;i<m;i++){
			scanf("%d%d%lld",&xx,&yy,&l);
			add(i,xx,yy,l);
			add(i+m,yy,xx,l);
		}
		solve();
		printf("%lld %lld\n",an,at);
	}
	
    return 0;
}