HDU1535:Invitation Cards(SPFA)

原创 2013年12月03日 21:53:38
Problem 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
 


 

题意:重1出发,每个车站安排一个人,然后所有人回来,问最小花费,注意路是单向的

思路:两次SPFA,也就是巧妙的将路线进行了翻转

 

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <queue>
using namespace std;

const int L = 10000000+10;
const int inf = 1500000000;
struct node
{
    int now,to,w;
} e[L];
int first[L],next[L];
int dis[L],vis[L];
int n,m;

void init()
{
    int i,j;
    for(i = 0; i<=m; i++)
        first[i] = next[i] = -1;
    for(i = 0; i<m; i++)
    {
        scanf("%d%d%d",&e[i].now,&e[i].to,&e[i].w);
        next[i] = first[e[i].now];
        first[e[i].now] = i;
    }
}

void SPFA(int src,int flag)
{
    int i;
    for(i = 0; i<=n; i++)
        dis[i] = inf;
    dis[src] = 0;
    for(i = 0;i<=n;i++)
    vis[i] = 0;
    queue<int> Q;
    Q.push(src);
    while(!Q.empty())
    {
        src = Q.front();
        Q.pop();
        vis[src] = 0;
        for(i = first[src]; i!=-1; i = next[i])
        {
            int to = (flag?e[i].to:e[i].now);
            if(dis[to]>dis[src]+e[i].w)
            {
                dis[to]=dis[src]+e[i].w;
                if(!vis[to])
                {
                    vis[to] = 1;
                    Q.push(to);
                }
            }
        }
    }
}

void set_map()
{
    int i;
    for(i = 0; i<=m; i++)
        first[i] = next[i] = -1;
    for(i = 0; i<m; i++)
    {
        int now = e[i].now;
        int to = e[i].to;
        next[i] = first[to];
        first[to] = i;
    }
}

int main()
{
    int t,sum,i,j;
    scanf("%d",&t);
    while(t--)
    {
        sum = 0;
        scanf("%d%d",&n,&m);
        init();
        SPFA(1,1);
        for(i = 2; i<=n; i++)//先将1到每个车站的最小花费加起来
            sum+=dis[i];
        set_map();//重置图
        SPFA(1,0);
        for(i = 2; i<=n; i++)//将所有点到1的最小花费加起来
            sum+=dis[i];
        printf("%d\n",sum);
    }

    return 0;
}


 

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

poj1511 - Invitation Cards

想看更多的解题报告: http://blog.csdn.net/wangjian8006/article/details/7870410                              ...

POJ-1511-Invitation Cards

POJ-1511-Invitation Cards http://poj.org/problem?id=1511 题意是给出一些边,求第一个点到其他各点距离之和+其他各点到第一个点的距离之和的最小...

HDU1535(反向建边)

题意:求从出发点到每个车站的最短距离+从每个车站回到出发点的最短距离是多少 思路:如果从每个点到出发点求一次最短路10^5个点10^5次求SPFA也会超时,那么如果我们反向建边的话可以只用一次SPF...

HDU1535 Invitation Cards(最短路)

Invitation Cards Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Other...

hdu 4767 Bell

从维基百科查到两个公式: 维基百科网址:http://en.wikipedia.org/wiki/Bell_number 通过这两个公式可以把Bn分别对于mod拆分成的五个素数...

HDU - 1595 find the longest of the shortest(最短路Dijkstra+枚举删边)

题意:某人要从 1 号城市到 n 号城市。有一条最短路径,在这条路径上可能会有一条边在维修,问此时从1~n的最短路径可能的最大值。读起来略拗口。慢慢理解就是了,不难懂。 思路:先用最短路径保存路径,...

hdu1535—Invitation Cards(spfa)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1535 Invitation Cards Time Limit: 10000/5000 MS...

poj1511||hdu1535 Invitation Cards spfa

题目链接: Invitation Cards 题意: 给出一个M个点N条边的单向图 1 题解: 1 代码: ...
  • AXuan_K
  • AXuan_K
  • 2015年01月30日 16:45
  • 623

HDU 1535 && POJ 1511 Invitation Cards (SPFA 模板 + 反向建图)

HDU 1535 && POJ 1511 Invitation Cards (SPFA 模板 + 反向建图)

hdu 1535 Invitation Cards ( 做2次spfa )

1 题目大意 给你一个源点,让你从这里派发学生到其余的点邀请人们去CSS,然后这些学生再返回源点,求使得学生总的cost最小的值。 2 解题思路 (1)从源点出去的时候:求一次最短路,将所有的d...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU1535:Invitation Cards(SPFA)
举报原因:
原因补充:

(最多只允许输入30个字)