【HDU】 3790 最短路径问题

#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>using namespace std;struct Edge
{int from,to,d,c,next;
};
struct Edge e[200005];
int pos[1005],s,t,vis[1005],d[1005],c[1005],cnt[1005],n,m;
queue<int> q;int spfad(int s)
{int x;memset(vis,0,sizeof(vis));memset(cnt,0,sizeof(cnt));q.push(s); vis[s]=1; cnt[s]++;while (!q.empty()){x=q.front(); q.pop(); vis[x]=0;for (int i=pos[x]; i!=0; i=e[i].next)if (d[e[i].to]>d[e[i].from]+e[i].d){d[e[i].to]=d[e[i].from]+e[i].d;c[e[i].to]=c[e[i].from]+e[i].c;if (!vis[e[i].to]){vis[e[i].to]=1;cnt[e[i].to]++;if (cnt[e[i].to]>n) return 0;q.push(e[i].to);}}else if (d[e[i].to]==d[e[i].from]+e[i].d)if (c[e[i].to]>c[e[i].from]+e[i].c)c[e[i].to]=c[e[i].from]+e[i].c;}return 1;
}int main()
{while (scanf("%d%d",&n,&m),m+n){memset(e,0,sizeof(e));memset(pos,0,sizeof(pos));for (int i=1;i<=m;i++){scanf("%d%d%d%d",&e[i].from,&e[i].to,&e[i].d,&e[i].c);e[i].next=pos[e[i].from]; pos[e[i].from]=i;e[i+m].from=e[i].to; e[i+m].to=e[i].from; e[i+m].d=e[i].d; e[i+m].c=e[i].c;e[i+m].next=pos[e[i+m].from]; pos[e[i+m].from]=i+m;}for (int i=1;i<=n;i++){d[i]=0x3fffffff;c[i]=0x3fffffff;}scanf("%d%d",&s,&t);d[s]=0; c[s]=0;spfad(s);printf("%d %d\n",d[t],c[t]);}return 0;
}