HDU 1535 Invitation Cards（最短路 spfa）

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.

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.

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.

2
2 2
1 2 13
2 1 33
4 6
1 2 10
2 1 60
1 3 20
3 4 10
2 4 5
4 1 50

46
210

题目大意：给出始末站点以及之间的乘坐的价格，问从中心站出发到各个站点以及从各个站点回到中心站的价格总和

最简单的做法就是建立两张图，然后跑两遍spfa，速度挺高效的，对于dijkstra的O（ElogV）没试过，有空再写写看。

另外，本题在poj也有，在本题中，poj的测试数据更加强大。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
typedef __int64 LL;
const LL INF = 0x7fffffff ;
const int MAX_V = 1000005;
struct Edge{
int u,v,w,next;
};

Edge edge1[MAX_V];
Edge edge2[MAX_V];
int dis[MAX_V];
int head1[MAX_V];
int head2[MAX_V];
bool vis[MAX_V];
int P,Q,i;
LL sum = 0;

void init(Edge *edge,int *head,int u,int v,int w)
{
edge[i].u = u;edge[i].v = v;edge[i].w = w;edge[i].next = head[u];head[u] = i;
}

void spfa(Edge *edge,int *head)
{
memset(dis,0x3f,sizeof(dis));
memset(vis,false,sizeof(vis));
queue<int>que;
dis[1] = 0;
vis[1] = true;
que.push(1);
while (!que.empty())
{
int curval = que.front();
que.pop();
vis[curval] = false;
for (int i = head[curval];i != -1;i = edge[i].next)
{
if (dis[curval] + edge[i].w < dis[edge[i].v])
{
dis[edge[i].v] = dis[curval] + edge[i].w;
if (!vis[edge[i].v])
{
vis[edge[i].v] = true;
que.push(edge[i].v);
}
}
}
}
//cout << sum << endl;
for (int i = 1;i <= P;i++)
{
sum += dis[i];
}
}

int main()
{
int T;
scanf("%d",&T);
while (T--)
{
int u,v,w;
memset(edge1,0,sizeof(edge1));
memset(edge2,0,sizeof(edge2));
memset(head1,-1,sizeof(head1));
memset(head2,-1,sizeof(head2));
scanf("%d%d",&P,&Q);
for (i = 0;i < Q;i++)
{
scanf("%d%d%d",&u,&v,&w);
init(edge1,head1,u,v,w);
init(edge2,head2,v,u,w);
}
sum = 0;
spfa(edge1,head1);
spfa(edge2,head2);
printf("%I64d\n",sum);
}
return 0;
}