Dijkstra HDU 3790

#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
#include<iostream>
using namespace std;
#define inf 1<<27;
int used[1005];
struct node
{
int x;
int d;
int p;
node(){}
node(int a, int b, int c) { x = a; d = b; p = c; }
};
bool operator<(node a, node b)
{
if (a.d == b.d)return a.p > b.p;
return a.d > b.d;
}
vector<node>eg[1005];
int s, e;
int dis[1005];
int tim[1005];
int n, m;
void dijkstra()
{
memset(used, 0, sizeof(used));
for (int i = 0; i <= n; i++){ dis[i] = inf; tim[i] = inf; }
priority_queue<node>q;
dis[s] = 0; tim[s] = 0;
q.push(node(s, 0, 0));
while (!q.empty())
{
node x = q.top();
q.pop();
if (used[x.x])continue;
used[x.x] = 1;
for (int i = 0; i < eg[x.x].size(); i++)
{
node y = eg[x.x][i];
if (dis[y.x]>x.d + y.d)
{
dis[y.x] = x.d + y.d;
tim[y.x] = x.p + y.p;
q.push(node(y.x, dis[y.x], tim[y.x]));
}
else if (dis[y.x] == x.d + y.d&&tim[y.x] > x.p + y.p)
{
dis[y.x] = x.d + y.d;
tim[y.x] = x.p + y.p;
q.push(node(y.x, dis[y.x], tim[y.x]));
}
}
}
}
int main()
{
while (~scanf("%d%d", &n, &m), (n + m))
{
for (int i = 0; i <= n; i++)eg[i].clear();
for (int i = 1; i <= m; i++)
{
int a, b, c, d;
scanf("%d%d%d%d", &a, &b, &c, &d);
eg[a].push_back(node(b, c, d));
eg[b].push_back(node(a, c, d));
}
scanf("%d%d", &s, &e);
dijkstra();
printf("%d %d\n", dis[e], tim[e]);
}
}