[最短路spfa]pku1511-Invitation Cards-优快云博客

http://acm.pku.edu.cn/JudgeOnline/problem?id=1511

Invitation Cards

Time Limit: 8000MS		Memory Limit: 262144K
Total Submissions: 5784		Accepted: 1616

Description

In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. They have printed invitation cards with all the necessary information and with the programme. A lot of students were hired to distribute these invitations among the people. Each student volunteer has assigned exactly one bus stop and he or she stays there the whole day and gives invitation to people travelling by bus. A special course was taken where students learned how to influence people and what is the difference between influencing and robbery.

The transport system is very special: all lines are unidirectional and connect exactly two stops. Buses leave the originating stop with passangers each half an hour. After reaching the destination stop they return empty to the originating stop, where they wait until the next full half an hour, e.g. X:00 or X:30, where 'X' denotes the hour. The fee for transport between two stops is given by special tables and is payable on the spot. The lines are planned in such a way, that each round trip (i.e. a journey starting and finishing at the same stop) passes through a Central Checkpoint Stop (CCS) where each passenger has to pass a thorough check including body scan.

All the ACM student members leave the CCS each morning. Each volunteer is to move to one predetermined stop to invite passengers. There are as many volunteers as stops. At the end of the day, all students travel back to CCS. You are to write a computer program that helps ACM to minimize the amount of money to pay every day for the transport of their employees.

Input

The input consists of N cases. The first line of the input contains only positive integer N. Then follow the cases. Each case begins with a line containing exactly two integers P and Q, 1 <= P,Q <= 1000000. P is the number of stops including CCS and Q the number of bus lines. Then there are Q lines, each describing one bus line. Each of the lines contains exactly three numbers - the originating stop, the destination stop and the price. The CCS is designated by number 1. Prices are positive integers the sum of which is smaller than 1000000000. You can also assume it is always possible to get from any stop to any other stop.

Output

For each case, print one line containing the minimum amount of money to be paid each day by ACM for the travel costs of its volunteers.

Sample Input

Sample Output

46
210

Source

Central Europe 1998

题目大意：给出一个有向图和起点，求其他所有点到这个点的最短路和这个点到其他点的最短路的总和。

分析：因为数据规模很大，所以用dijkstra会超时，考虑到边不是特别多，所以选择用spfa。如果枚举每个点作为起点求它到1的距离的话，效率太低，会超时。其实，只要把图中的边都反过来，再求一次单源最短路就可以了。

我用的是静态链表。

codes:

var
  tot,n,m,k:longint;
  e,e2:array[1..1000000] of record b,w:longint; end;
  d,f,f2,ne,ne2:array[0..1000000] of longint;
  b:array[0..5000000] of longint;
  v:array[0..1000000] of boolean;
procedure init;
  var
    i,x,y,w:longint;
  begin
    tot:=0;
    fillchar(f,sizeof(f),0);
    fillchar(f2,sizeof(f2),0);
    fillchar(e,sizeof(e),0);
    fillchar(e2,sizeof(e2),0);
    fillchar(ne,sizeof(ne),0);
    fillchar(ne2,sizeof(ne2),0);
    readln(n,m);
    for i:=1 to m do
      begin
        readln(x,y,w);
        inc(tot);
        ne[tot]:=f[x];
        f[x]:=tot;
        e[tot].w:=w; e[tot].b:=y;
        ne2[tot]:=f2[y];
        f2[y]:=tot;
        e2[tot].w:=w; e2[tot].b:=x;
      end;
  end;
procedure spfa;
  var
    head,tail,i,tx:longint;
  begin
    head:=0; tail:=1;
    fillchar(v,sizeof(v),false);
    fillchar(d,sizeof(d),127);
    b[1]:=1; v[1]:=true; d[1]:=0;
    repeat
      inc(head);
      tx:=b[head];
      i:=f[tx];
      while i<>0 do
        begin
          if d[tx]+e[i].w<d[e[i].b] then
            begin
              d[e[i].b]:=d[tx]+e[i].w;
              if not v[e[i].b] then
                begin
                  inc(tail);
                  b[tail]:=e[i].b;
                end;
            end;
          i:=ne[i];
        end;
      v[tx]:=false;
   until head>=tail;
  end;
procedure main;
  var
    i:longint;
    ans:int64;
  begin
    ans:=0;
    spfa;
    for i:=2 to n do inc(ans,d[i]);
    e:=e2;
    f:=f2;
    ne:=ne2;
    spfa;
    for i:=2 to n do inc(ans,d[i]);
    writeln(ans);
  end;
begin
  readln(k);
  while k>0 do
    begin
      dec(k);
      init;
      main;
    end;
end.