HDU-1535

题目链接

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<math.h>
#include<functional>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int maxn = 1000005;
const int inf = 1<<30;
typedef __int64 LL;
int n,m,pos;
struct node
{
	int to,w,next;
}edge1[maxn],edge2[maxn];
int head1[maxn],head2[maxn],dis1[maxn],dis2[maxn];
bool vis[maxn];
void addEdge( int u,int v,int w )
{
	edge1[++pos].to = v; edge1[pos].w = w;
	edge1[pos].next = head1[u]; head1[u] = pos; 

	edge2[pos].to = u; edge2[pos].w = w;
	edge2[pos].next = head2[v]; head2[v] = pos; 
}
typedef pair<int,int>pii;
bool Dijkstra( int s,int *head,int *dis,node *edge )
{
	priority_queue<pii,vector<pii>,greater<pii> >que;
	for( int i = 1; i <= n; i ++ ){
		dis[i] = inf;
		vis[i] = 0;
	}
	dis[s] = 0;
	que.push( make_pair(dis[s],s) );
	while( !que.empty() )
	{
		pii u = que.top();  que.pop();
		int x = u.second;
		if( vis[x] )    continue;
		vis[x] = true;
		for( int i = head[x]; i != -1; i = edge[i].next ){
			node &v = edge[i];
			if( dis[v.to] > dis[x] + v.w ){
				dis[v.to] = dis[x] + v.w;
				que.push( make_pair( dis[v.to],v.to) );
			}
		}
	}
}
int main()
{
	//freopen("data.txt","r",stdin);
	int t,u,v,w;
	scanf("%d",&t);
	while( t -- )
	{
		pos = 0;
		scanf("%d%d",&n,&m);
		for( int i = 0; i <= n; i ++ )
			head1[i] = head2[i] = -1;
		for( int i = 0; i < m; i ++ ){
			scanf("%d%d%d",&u,&v,&w);
			addEdge( u,v,w );
		}
		Dijkstra(1,head1,dis1,edge1);
		Dijkstra(1,head2,dis2,edge2);
		int ans = 0;
		for( int i = 2; i <= n; i ++ )
			ans += dis1[i] + dis2[i];
		printf("%d\n",ans);
	}
	return 0;
}

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int maxn = 1000005;
const int inf = 1<<30;
typedef __int64 LL;
int n,m,pos;
struct node
{
    int to,w,next;
}edge1[maxn],edge2[maxn];
int head1[maxn],head2[maxn],dis1[maxn],dis2[maxn],outq[maxn];
bool inq[maxn];
void addEdge( int u,int v,int w )
{
    edge1[++pos].to = v; edge1[pos].w = w;
    edge1[pos].next = head1[u]; head1[u] = pos; 

    edge2[pos].to = u; edge2[pos].w = w;
    edge2[pos].next = head2[v]; head2[v] = pos; 
}
bool SPEA( int s,int *head,int *dis,node *edge )
{
    queue<int>que;
    for( int i = 0; i <= n; i ++ )
        inq[i] = outq[i] = 0;
    for( int i = 0; i <= n; i ++ )    dis[i] = inf;
    dis[s] = 0;
    que.push(s);
    while( !que.empty() )
    {
        int u = que.front();  que.pop();
        inq[u] = false;
        for( int i = head[u]; i != -1; i = edge[i].next )
        {
            node &v = edge[i];
            if( dis[v.to] > dis[u] + v.w ){
                dis[v.to] = dis[u] + v.w;
                if( !inq[v.to] ){
                    que.push(v.to);
                    inq[v.to] = true;
                }
            }
        }
    }
    return true;
}
int main()
{
    //freopen("data.txt","r",stdin);
    int t,u,v,w;
    scanf("%d",&t);
    while( t -- )
    {
        pos = 0;
        scanf("%d%d",&n,&m);
        for( int i = 0; i <= n; i ++ )
            head1[i] = head2[i] = -1;
        for( int i = 0; i < m; i ++ ){
            scanf("%d%d%d",&u,&v,&w);
            addEdge( u,v,w );
        }
        SPEA(1,head1,dis1,edge1);
        SPEA(1,head2,dis2,edge2);
        int ans = 0;
        for( int i = 2; i <= n; i ++ )
            ans += dis1[i] + dis2[i];
        printf("%d\n",ans);
    }
    return 0;
}