hdu 1535 Invitation Cards【SPFA】

原创 2016年06月01日 21:08:02

Invitation Cards

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 3282    Accepted Submission(s): 1523

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

Source

Central Europe 1998

 

题目大意:求其实点1,到其他各点的距离,再求从其他各点到点1的距离和,求最小。


思路:正向SPFA求从点1到其他各点的距离,在反向建边,再求点1到其他各点的距离,加和即可。


AC代码:


#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
int head[1000004];
struct EdgeNode
{
    int to;
    int w;
    int next;
}e[1000004];
int vis[1000004];
int dis[1000004];
int ww[10000004];
int xx[1000004];
int yy[1000004];
int cont,n,m;
void add(int from,int to,int w)
{
    e[cont].to=to;
    e[cont].w=w;
    e[cont].next=head[from];
    head[from]=cont++;
}
void SPFA()
{
    queue<int>s;
    memset(vis,0,sizeof(vis));
    for(int i=0;i<n;i++)dis[i]=0x3f3f3f3f;
    dis[0]=0;
    vis[0]=1;
    s.push(0);
    while(!s.empty())
    {
        int u=s.front();
        s.pop();
        vis[u]=0;
        for(int k=head[u];k!=-1;k=e[k].next)
        {
            int v=e[k].to;int w=e[k].w;
            if(dis[v]>dis[u]+w)
            {
                dis[v]=dis[u]+w;
                if(vis[u]==0)
                {
                    s.push(v);
                    vis[v]=1;
                }
            }
        }
    }
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        cont=0;
        memset(head,-1,sizeof(head));
        for(int i=0;i<m;i++)
        {
            int x,y,w;
            scanf("%d%d%d",&x,&y,&w);
            x--;y--;add(x,y,w);
            xx[i]=x;yy[i]=y;ww[i]=w;
        }
        SPFA();
        int sum=0;
        for(int i=0;i<n;i++)
        {
            sum+=dis[i];
        }
        cont=0;
        memset(head,-1,sizeof(head));
        for(int i=0;i<m;i++)
        {
            add(yy[i],xx[i],ww[i]);
        }
        SPFA();
        for(int i=0;i<n;i++)
        {
            sum+=dis[i];
        }
        printf("%d\n",sum);
    }
}



版权声明:0.0小白有写的不好不对的地方请指出~

相关文章推荐

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...

HDU1535Invitation Cards(有向图,正向建图和反向建图各spfa一次)

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

(spfa专题 1.1)hdu 1535 Invitation Cards(求从1到2~n的点后,再从2~n返回1点的最小距离)

题目:Invitation CardsTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Othe...

HDU 1535 Invitation Cards 【SPFA + 链式前向星】

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

hdu1535 Invitation Cards(spfa+反向建图)

http://acm.hdu.edu.cn/showproblem.php?pid=1535 题意:某演员雇佣一些志愿者去一些站台做志愿活动,每一天他们要从起点CSS安检后到所有站台,安检后的所...

HDU1535 Invitation Cards(最短路,spfa)

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

HDU 1535 Invitation Cards(SPFA+双向建图 )

题目大意:求一个从地点然后再从一个地点返回过来,的最短路径. 思路:正向+逆向建图 #include #include #include #include #define ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdu 1535 Invitation Cards【SPFA】
举报原因:
原因补充:

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