poj1511

题意：读了半天才看明白，英语太差了。。。。最终就是在有向图中，求所有点到1号点的最短往返距离之和。

解法：建了两遍图，正向建一边去的图，反向建一遍回的路。然后spfa求两遍。

代码：

#include <iostream>
#include <stdio.h>
#include <cstring>
using namespace std;
struct edge
{
    int v,w;
    int next;
} edges1[1000010],edges2[1000010];
int head1[1000010];
int head2[1000010];
int count1=0;
int count2=0;
void addedge1(int u,int v,int w)
{
    edges1[count1].v=v;
    edges1[count1].w=w;
    edges1[count1].next=head1[u];
    head1[u]=count1++;
}
void addedge2(int u,int v,int w)
{
    edges2[count2].v=v;
    edges2[count2].w=w;
    edges2[count2].next=head2[u];
    head2[u]=count2++;
}
int n,m;
long long dist1[1000100];
int que1[10000100];
bool rem1[1000010];
void spfa1()
{
   for(int i=0;i<=n;i++)
    dist1[i]=200000000000;
   dist1[1]=0;
   int left=0,right=1;
   que1[0]=1;
   while(left<right)
   {
       for(int i=head1[que1[left]];i!=-1;i=edges1[i].next)
       {
           int a=edges1[i].v;
           if(dist1[a]>dist1[que1[left]]+edges1[i].w)
           {
               dist1[a]=dist1[que1[left]]+edges1[i].w;
               if(!rem1[a])
               {
                   que1[right++]=a;
                   rem1[a]=1;
               }
           }
       }
       rem1[que1[left]]=0;
       left++;
   }
}
long long dist2[1000100];
long long que2[10000100];
bool rem2[1000010];
void spfa2()
{
   for(int i=0;i<=n;i++)
    dist2[i]=200000000000;
   dist2[1]=0;
   int left=0,right=1;
   que2[0]=1;
   while(left<right)
   {
       for(int i=head2[que2[left]];i!=-1;i=edges2[i].next)
       {
           int a=edges2[i].v;
           if(dist2[a]>dist2[que2[left]]+edges2[i].w)
           {
               dist2[a]=dist2[que2[left]]+edges2[i].w;
               if(!rem2[a])
               {
                   que2[right++]=a;
                   rem2[a]=1;
               }
           }
       }
       rem2[que2[left]]=0;
       left++;
   }
}
int main()
{
   int t;
   cin>>t;
   while(t--)
   {
       count1=0;count2=0;
       scanf("%d%d",&n,&m);
       memset(rem1,0,sizeof rem1);
       memset(rem2,0,sizeof rem2);
        for(int i=0;i<=n;i++)
        head1[i]=-1,head2[i]=-1;
       for(int i=0;i<m;i++)
       {
           int a,b,w;
           scanf("%d%d%d",&a,&b,&w);
           addedge1(a,b,w);
           addedge2(b,a,w);
       }
       spfa1();
       spfa2();
       long long ans=0;
       for(int i=2;i<=n;i++)
        ans+=dist1[i]+dist2[i];
       cout<<ans<<endl;
   }
    return 0;
}