hdu 3790 最短路径问题

使用邻接表的过了，邻接矩阵的跪了囧rz。改不出来望路过的看出哪里错的人赐教==

邻接表：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<queue>

using namespace std;

const int M = 100005;
const int N = 1004;
const int inf = 0x3f3f3f3f;

struct node{
	int nxt, to, cost, dist;
}e[M << 1];

int cnt;
int dis[N];
int c[N];
int head[N];
int st, ed;
int n, m;

void add( int u, int v, int dist, int cost )
{
	e[cnt].to = v;
	e[cnt].cost = cost;
	e[cnt].dist = dist;
	e[cnt].nxt = head[u];
	head[u] = cnt++;
}

void spfa()
{
	queue<int> q;
	while(!q.empty())
		q.pop();
	for( int i = 1; i <= n; i++ )
	{
		dis[i] = inf;
		c[i] = inf;
	}
	dis[st] = c[st] = 0;
	q.push(st);
	while(!q.empty())
	{
		int now = q.front();
		q.pop();
		for( int i = head[now]; ~i; i = e[i].nxt)
		{
			int to = e[i].to;
			if(dis[to] > dis[now] + e[i].dist)
			{
				dis[to] = dis[now] + e[i].dist;
				c[to] = c[now] + e[i].cost;
				q.push(to);
			}
			else if( dis[to] == dis[now] + e[i].dist && c[to] > c[now] + e[i].cost)
			{
				dis[to] = dis[now] + e[i].dist;
				c[to] = c[now] + e[i].cost;
				q.push(to);
			}
		}
	}
}

int main()
{
	while(~scanf("%d%d", &n, &m) && (n || m))
	{
		cnt = 0;
		memset(head, -1, sizeof(head));
		while(m--)
		{
			int u, v, w, p;
			scanf("%d%d%d%d", &u, &v, &w, &p);
			add(u, v, w, p);
			add(v, u, w, p);
		}
		scanf("%d%d", &st, &ed);
		spfa();
		printf("%d %d\n", dis[ed], c[ed]);
	}
	return 0;
}

邻接矩阵：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<queue>

using namespace std;

#define N 1005
const int MAX = 0x3f3f3f3f;

int a[N][N];
int vis[N];
int dis[N];
int c[N][N];
int cost[N];
int n, m;
int st, ed;

void init()
{
    for( int i = 1; i <= n; i++ )
    {
        for( int j = 1; j <= n; j++ )
        {
            a[i][j] = MAX;
            c[i][j] = MAX;
            if( i == j )
                a[i][j] = 0, c[i][j] = 0;
        }
    }
}

void spfa()
{
    queue<int> q;
    while( !q.empty() )
        q.pop();
    for( int i = 1; i <= n; i++ )
        dis[i] = MAX;
    memset(vis, 0, sizeof(vis));
    vis[st] = 1;
    dis[st] = 0;
    q.push(st);
    while( !q.empty() )
    {
        int now = q.front();
        vis[now] = 0;
        q.pop();
        for( int i = 1; i <= n; i++ )
        {
            if( dis[i] > dis[now] + a[now][i] )
            {
                dis[i] = dis[now] + a[now][i];
                cost[i] = cost[now] + c[now][i];
                if( !vis[i] )
                {
                    vis[i] = 1;
                    q.push(i);
                }
            }
            else if( dis[i] == dis[now] + a[now][i] && cost[i] > cost[now] + c[now][i] )
            {
                dis[i] = dis[now] + a[now][i];
                cost[i] = cost[now] + c[now][i];
                if( !vis[i] )
                {
                    vis[i] = 1;
                    q.push(i);
                }
            }
        }
    }
}

int main()
{
    while(~scanf("%d%d", &n, &m) && (n || m ))
    {
        int u, v, aa, cc;
        init();
        while(m--)
        {
            scanf("%d%d%d%d", &u, &v, &aa, &cc);
            if( aa < a[u][v] )
            {
                a[u][v] = aa;
                a[v][u] = aa;
            }
            if( cc < c[u][v] )
            {
                c[u][v] = cc;
                c[v][u] = cc;
            }
        }
        scanf("%d%d", &st, &ed);
        spfa();
        printf("%d %d\n", dis[ed], cost[ed]);
    }
    return 0;
}