(简单) POJ 1511 Invitation Cards,SPFA。

  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.

  题目是最短路问题,求源点到所有点的来回的最短距离之和,只需要反向边图+正向边图即可。。。

代码如下:

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>

using namespace std;

const int INF = 10e8;
const int MaxN = 1000010;

struct Edge
{
    int v, cost,next;
};

Edge E1[MaxN],E2[MaxN],*E;
int head1[MaxN],head2[MaxN],Ecou1,Ecou2;
int *head;
bool vis[MaxN];
int couNode[MaxN];

bool SPFA(long long lowcost[], int n, int start,int type)
{
    if(type)
        E=E1,head=head1;
    else
        E=E2,head=head2;

    queue <int> que;
    int u, v, c;
    int len;

    for (int i = 1; i <= n; ++i) { lowcost[i] = INF; vis[i] = 0; couNode[i] = 0; }

    vis[start] = 1; lowcost[start] = 0; couNode[start] = 1;
    que.push(start);

    while (!que.empty())
    {
        u = que.front(); que.pop();

        vis[u] = 0;

        for (int i = head[u]; i!=-1; i=E[i].next)
        {
            v = E[i].v; c = E[i].cost;

            if (lowcost[v]>lowcost[u] + c)
            {
                lowcost[v] = lowcost[u] + c;

                if (!vis[v])
                {
                    vis[v] = 1; ++couNode[v]; que.push(v);

                    if (couNode[v]>n) return 0;
                }
            }
        }
    }

    return 1;
}

inline void addEdge(int u, int v, int c,int type)
{
    int *Ecou;
    if(type)
    {
        E=E1,head=head1;
        Ecou=&Ecou1;
    }
    else
    {
        E=E2,head=head2;
        Ecou=&Ecou2;
    }

    E[*Ecou].v=v;
    E[*Ecou].cost=c;
    E[*Ecou].next=head[u];
    head[u]=(*Ecou)++;
}

void init(int N)
{
    Ecou1=Ecou2=0;

    for(int i=1;i<=N;++i)
        head1[i]=head2[i]=-1;
}

long long ans1[MaxN],ans2[MaxN];

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);

    int T;
    int N,M;
    int a,b,c;
    long long ans;

    cin>>T;

    while(T--)
    {
        scanf("%d %d",&N,&M);
        init(N);

        for(int i=1;i<=M;++i)
        {
            scanf("%d %d %d",&a,&b,&c);
            addEdge(a,b,c,1);
            addEdge(b,a,c,0);
        }

        SPFA(ans1,N,1,1);
        SPFA(ans2,N,1,0);

        ans=0;
        for(int i=2;i<=N;++i)
            ans+=ans1[i]+ans2[i];

        cout<<ans<<endl;
    }

    return 0;
}

时间: 2024-10-28 15:16:30

(简单) POJ 1511 Invitation Cards,SPFA。的相关文章

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

Invitation Cards HDU: Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) POJ: Time Limit: 8000 MS     Memory Limit: 262144 K       Problem Description In the age of television, not many people attend theater performa

poj 1511 Invitation Cards spfa 邻接矩阵

题目链接: http://poj.org/problem?id=1511 题目大意: 这道题目比较难理解,我读了好长时间,最后还是在队友的帮助下理解了题意,大意就是,以一为起点,求从一到其他各点的最短回路总和. 解题思路: 解决这个题目有几个容易错的,解决了离ac就不远了^_^. 1:数据范围是1<=边数<=顶点数<=1000000,所以不能用邻接矩阵,要用邻接表,用vector实现时要动态申请内存. 2:求得是起始点到其他点的最短回路和,我们可以建两个邻接表(一个正向,一个负向邻接表)

POJ 1511 Invitation Cards

题目来源:http://poj.org/problem?id=1511 题目很长,花了不少时间才理解题意,目的就是为了求出来回两次最小路径(即为本题的差旅费)之和, 第一次从CCS(1)出发到各个点路径最小,SPFA算法没得说,回来时终点是确定的都是CCS(1),相当于把路 径反过来,即把有向图去反方向,又是从1出发到各个点路径最小,再用一个SPFA.注意ans要用long long 不然也WA,这个地方WA了好几次,虽然更改后AC了,但还是不明白,题目明明写了smaller than 1000

POJ 1511 Invitation Cards (最短路)

Invitation Cards Time Limit: 8000MS   Memory Limit: 262144K Total Submissions: 19215   Accepted: 6311 Description In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They wan

[2016-04-05][POJ][1511][Invitation Cards]

时间:2016-04-05 12:57:22 星期二 题目编号:[2016-04-05][POJ][1511][Invitation Cards] 题目大意:给定一个有向图,从点1出发,分别到各个站点后,又回到点1,问最少需要多少车费, 分析: 从1跑一次最短路,然后矩阵转置,再跑一次最短路,两次求和 这里不能用邻接矩阵保存,所以改成邻接表,然后矩阵转置的操作变成重新加一次边 遇到的问题:用vector存图超时,改用数组实现 #include <queue> #include <algo

POJ 1511 Invitation Cards 【最短路,spfa算法,Dijkstra算法堆优化】

Invitation Cards Time Limit: 8000MS   Memory Limit: 262144K Total Submissions: 25219   Accepted: 8346 Description In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They wan

POJ 1511 Invitation Cards(逆向思维 SPFA)

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

poj 1511 Invitation Cards (spfa+邻接表)

Invitation Cards Time Limit: 8000MS   Memory Limit: 262144K Total Submissions: 19527   Accepted: 6375 Description In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They wan

poj 1511 Invitation Cards (最短路)

Invitation Cards Time Limit: 8000MS   Memory Limit: 262144K Total Submissions: 33435   Accepted: 11104 Description In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They wa