POJ1511 Invitation Cards —— 最短路spfa

题目链接：http://poj.org/problem?id=1511

 

Invitation Cards

Time Limit: 8000MS		Memory Limit: 262144K
Total Submissions: 29286		Accepted: 9788

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

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

Sample Output

46
210

Source

Central Europe 1998

 

 

 

题解：

1.可知最短路分为两段， 点1到各个点的最短距离，以及各个点到点1的最短距离。

2.先求出点1到各个点的最短距离， 记为dis1。

3.将各条边的方向取反， 然后再求出点1到各个点的最短距离，记为dis2。因为边取反了，所以dis2实际是各个点到点1的最短距离。

4.对（dis1+dis2）求和，即为答案。

5.同样的题型：POJ3268

 

 

 

代码如下：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <string>
#include <set>
#define ms(a,b) memset((a),(b),sizeof((a)))
using namespace std;
typedef long long LL;
const double EPS = 1e-8;
const int INF = 2e9;
const LL LNF = 9e18;
const int MOD = 1e9+7;
const int MAXN = 1e6+10;

int n, m;

struct edge
{
    int from, to, w, next;
}edge[MAXN*4];
int cnt, head[MAXN];

void add(int u, int v, int w)
{
    edge[cnt].from = u;
    edge[cnt].to = v;
    edge[cnt].w = w;
    edge[cnt].next = head[u];
    head[u] = cnt++;
}

void init()
{
    cnt = 0;
    memset(head, -1, sizeof(head));
}

LL dis1[MAXN], dis2[MAXN];
int times[MAXN], inq[MAXN];
void spfa(int st, LL dis[])
{
    memset(inq, 0, sizeof(inq));
    memset(times, 0, sizeof(times));
    for(int i = 1; i<=n; i++)
        dis[i] = LNF;

    queue<int>Q;
    Q.push(st);
    inq[st] = 1;
    dis[st] = 0;
    while(!Q.empty())
    {
        int u = Q.front();
        Q.pop(); inq[u] = 0;
        for(int i = head[u]; i!=-1; i = edge[i].next)
        {
            int v = edge[i].to;
            if(dis[v]>1LL*dis[u]+1LL*edge[i].w)
            {
                dis[v] = 1LL*dis[u]+1LL*edge[i].w;
                if(!inq[v])
                {
                    Q.push(v);
                    inq[v] = 1;
                }
            }
        }
    }
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        init();
        scanf("%d%d", &n, &m);
        for(int i = 0; i<m; i++)
        {
            int u, v, w;
            scanf("%d%d%d", &u, &v, &w);
            add(u,v,w);
        }

        spfa(1, dis1);
        init();
        /**一开始想直接取反，即swap(edge[i].from, edge[i].to),
        后来发现处理不了head[]数组， 所以还是重新建边  */
        for(int i = 0; i<m; i++)    //m为原来的边数， 即cnt
            add(edge[i].to, edge[i].from, edge[i].w);
        spfa(1, dis2);

        LL ans = 0;
        for(int i = 1; i<=n; i++)
            ans += dis1[i]+dis2[i];

        printf("%lld\n", ans);
    }
}