PAT 1030 Travel Plan SPFA

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
using namespace std;
struct node
{
  int to,next,dd,w;
}e[100005];
int dis[1005],cost[1005],head[1005],in[1005],pre[1005];
int cnt;
stack<int>st;
void addedge(int a,int b,int dd,int w)
{
  e[cnt].to = b;
  e[cnt].dd = dd;
  e[cnt].w = w;
  e[cnt].next = head[a];
  head[a] = cnt++;
}
void spfa(int s,int d)
{
  memset(dis,0x7f,sizeof(dis));
  memset(in,0,sizeof(in));
  dis[s] = 0;
  queue<int>q;
  q.push(s);
  while(!q.empty())
  {
    int u = q.front();
    q.pop();
    in[u] = 0;
    for(int i = head[u];i!=-1;i = e[i].next)
    {
      int v = e[i].to;
      int dd = e[i].dd;
      int w = e[i].w;
      if(dis[v]>dis[u]+dd||(dis[v] == dis[u]+dd&&cost[u]+w<cost[v]))
      {
        dis[v] = dis[u]+dd;
        cost[v] = cost[u]+w;
        pre[v] = u;
        if(!in[v])
        {
          in[v] = 1;
          q.push(v);
        }
      }
    }
  }
}
int main()
{
  int n,m,s,d,i,j;
  cnt = 0;
  cin>>n>>m>>s>>d;
  memset(head,-1,sizeof(head));
  for(i = 1;i<=m;i++)
  {
    int a,b,c,e;
    cin>>a>>b>>c>>e;
    addedge(a,b,c,e);
    addedge(b,a,c,e);
  }
  spfa(s,d);
  int td = d;
  while(td!=s)
  {
    st.push(td);
    td = pre[td];
  }
  st.push(s);
  while(!st.empty())
  {
      cout<<st.top()<<" ";
      st.pop();
  }
  cout<<dis[d]<<" "<<cost[d];
  return 0;
}