PAT甲1003最短路

PAT甲级1003最短路

PAT还有10天要去深圳走一遭了，临阵突击一波，wa了好多发，难受。明天又是ICPC网络赛，感觉很GG，今年希望别再打铁。

#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define maxn 505
using namespace std;
int n,m,st,ed;
int G[maxn][maxn];
typedef pair<int, int> PII;
int vis[maxn],dis[maxn];
set<PII,less<PII> > min_p;

int node[maxn],num[maxn],cnt[maxn];
void djs(int st, int end)
{
	memset(vis,0,sizeof vis);
	memset(dis,0x3f,sizeof dis);
	memset(num,0,sizeof num);
	dis[st] = 0;num[st] = 1;
	min_p.insert(make_pair(0,st));

	for(int i = 0; i < n; ++i)
	{
		if(min_p.size() == 0)break;
		set<PII,less<PII> >:: iterator it = min_p.begin();
		int v = it->second;
		vis[v] = 1;
		min_p.erase(*it);

		for (int j = 0; j < n; ++j)
		{
			if(v==j||G[v][j]==INF)continue;
			if(!vis[j]&&dis[j]==dis[v]+G[v][j])//更新人数 、路径
			{
				cnt[j] = cnt[j]>cnt[v]+node[j]?cnt[j]:cnt[v]+node[j];
				num[j] += num[v];
			}
			if(!vis[j] && dis[j]>dis[v]+G[v][j])
			{
				num[j] = num[v];cnt[j] = cnt[v]+node[j];
				min_p.erase(make_pair(dis[j],j));
				dis[j] = dis[v]+G[v][j];
				min_p.insert(make_pair(dis[j],j));
			}

		}
	}
	cout <<num[end]<<" "<<cnt[end];
}


int main(int argc, char const *argv[])
{
	scanf("%d%d%d%d",&n,&m,&st,&ed);
	for (int i = 0; i < n; ++i)
	{
		scanf("%d",&node[i]);
		cnt[i] = node[i];
	}
	int a,b,v;
	memset(G,0x3f,sizeof(G));
	for(int i = 0; i<m; i++)
	{
		scanf("%d%d%d",&a,&b,&v);
		G[a][b] = G[b][a] = v;
	}
	djs(st,ed);

	return 0;
}