hdu 3790(最短路BellmanFord)

984MS,真险!Bellman_Frod效率不高啊！

/*
  Name: 最短路(bellmanFord) 
  Copyright: 
  Author: Try_86
  Date: 11/04/12 21:16
  Description: 
*/

#include <cstdio>
#include <iostream>

using namespace std;

const int N = 1005;
const int M = 200005;
const int MAX = 1000000000;

int dis[N], cs[N];
struct edge {

    int u;
    int v;
    int w;
    int c;
}e[M];

void init(int vs, int s) {
    for (int i=1; i<=vs; ++i) dis[i] = cs[i] = MAX;
    dis[s] = cs[s] = 0;
    return ;
}

void relax(int u, int v, int w, int c) {

    if (dis[v] > dis[u] + w) {//选择路径长度小的 
        dis[v] = dis[u] + w;
        cs[v] = cs[u] + c;
    }
    else if (dis[v] == dis[u] + w && cs[v] > cs[u] + c) {//路径长度相同时，选择花费小的 
        dis[v] = dis[u] + w;
        cs[v] = cs[u] + c;
    }
    return ;
}

void bellmanFord(int es, int vs, int s) {
    init(vs, s);
    for (int i=1; i<vs; ++i) {
        for (int j=0; j<es; ++j) relax(e[j].u, e[j].v, e[j].w, e[j].c);
    }
    return ;
}

int main() {
    int n, m, s, t;
    while (scanf("%d%d", &n, &m), n+m) {
        for (int i=0; i<m; ++i) {
            scanf ("%d%d%d%d", &e[i].u, &e[i].v, &e[i].w, &e[i].c);
            e[i+m].v = e[i].u;
            e[i+m].u = e[i].v;
            e[i+m].w = e[i].w;
            e[i+m].c = e[i].c;
        }
        scanf ("%d%d", &s, &t);
        bellmanFord(m<<1, n, s);
        printf ("%d %d\n", dis[t], cs[t]);
    }
    return 0;
}