pat1030 Travel Plan

#include<algorithm>
#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<vector>
#include<set>
#include<map>
#include<queue>
#define ll long long
using namespace std;
queue<int>q;
int g1[505][505],g2[505][505],in[505],dis[505],pre[505],cost[505];
int n,m,bg,ed;
void spfa()
{
	memset(dis,0x7f,sizeof(dis));
	memset(in,0,sizeof(in));
	q.push(bg);
	in[bg] = 1;
	dis[bg] = 0;
	while(!q.empty())
	{
		int u = q.front();
		q.pop();
		in[u] = 0;
		for(int i = 0;i<n;i++)
		{
			if(g1[u][i] == -1)continue;
			if((dis[i]>dis[u]+g1[u][i])||(dis[i] == dis[u]+g1[u][i]&&cost[i]>cost[u]+g2[u][i]))
			{
				dis[i] = dis[u]+g1[u][i];
				cost[i] = cost[u]+g2[u][i];
				pre[i] = u;
				if(!in[u])
				{
					q.push(i);
					in[i] = 1;
				}
			}
		}
	}
}
void out(int u)
{
	if(u == bg)
	{
		printf("%d",u);
		return;
	}
	out(pre[u]);
	printf(" %d",u);
}
int main()
{
	int i,j,x,y,z,p;
	while(scanf("%d%d%d%d",&n,&m,&bg,&ed)!=EOF)
	{
		memset(g1,-1,sizeof(g1));
		for(i = 1;i<=m;i++)
		{
			scanf("%d%d%d%d",&x,&y,&z,&p);
			g1[x][y] = g1[y][x] = z;
			g2[x][y] = g2[y][x] = p;
		}
		spfa();
		out(ed);
		printf(" %d %d\n",dis[ed],cost[ed]);
	}
	return 0;
}