http://acm.hdu.edu.cn/showproblem.php?pid=3790
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) |
spfa模板套上
#include <cstdio>
#include <queue>
#include <cstring>
using namespace std;
const int SIZE=1e5+10;
const int maxn=1<<30;
struct Edge{
int v,w,p,next;
Edge(int vv,int ww,int pp):v(vv),w(ww),p(pp){}
Edge(){}
}edge[SIZE*2];
int head[1010],tot;
int dis[1010],pris[1010];
void init(){
tot=0;
memset(head,-1,sizeof(head));
}
void addedge(int u,int v,int w,int p){
edge[tot].v=v;
edge[tot].w=w;
edge[tot].p=p;
edge[tot].next=head[u];
head[u]=tot++;
}
void spfa(int s,int t,int n){
for(int i=1;i<=n;i++){
dis[i]=maxn;
pris[i]=maxn;
}
dis[s]=pris[s]=0;
queue<int> q;
q.push(s);
while(!q.empty()){
int u=q.front();
q.pop();
for(int i=head[u];i!=-1;i=edge[i].next){
int v=edge[i].v;
int w=edge[i].w;
int p=edge[i].p;
if(dis[v]>dis[u]+w||(dis[v]==dis[u]+w&&pris[v]>pris[u]+p)){
dis[v]=dis[u]+w;
pris[v]=pris[u]+p;
q.push(v);
}
}
}
printf("%d %d\n",dis[t],pris[t]);
}
int main(){
int n,m,a,b,w,p,s,t;
while(scanf("%d%d",&n,&m)&&n+m){
init();
for(int i=0;i<m;i++){
scanf("%d%d%d%d",&a,&b,&w,&p);
addedge(a,b,w,p);
addedge(b,a,w,p);
}
scanf("%d%d",&s,&t);
spfa(s,t,n);
}
return 0;
}