zoukankan      html  css  js  c++  java
  • 图论 ---- spfa + 链式向前星 ---- poj 3268 : Silver Cow Party

    Silver Cow Party
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 12674   Accepted: 5651

    Description

    One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total of M (1 ≤ M ≤ 100,000) unidirectional (one-way roads connects pairs of farms; road i requires Ti (1 ≤ Ti ≤ 100) units of time to traverse.

    Each cow must walk to the party and, when the party is over, return to her farm. Each cow is lazy and thus picks an optimal route with the shortest time. A cow's return route might be different from her original route to the party since roads are one-way.

    Of all the cows, what is the longest amount of time a cow must spend walking to the party and back?

    Input

    Line 1: Three space-separated integers, respectively: NM, and X 
    Lines 2..M+1: Line i+1 describes road i with three space-separated integers: AiBi, and Ti. The described road runs from farm Ai to farm Bi, requiring Ti time units to traverse.

    Output

    Line 1: One integer: the maximum of time any one cow must walk.

    Sample Input

    4 8 2
    1 2 4
    1 3 2
    1 4 7
    2 1 1
    2 3 5
    3 1 2
    3 4 4
    4 2 3

    Sample Output

    10

    Hint

    Cow 4 proceeds directly to the party (3 units) and returns via farms 1 and 3 (7 units), for a total of 10 time units.

    Source


    Mean:

    原意:草场上有n个农场,农场之间有一些路径,每个农场里住着一头牛,现在x农场的牛要过生日开party,其他农场的牛要到该农场去参加party,现在让你选择一头来回耗时最多的一头牛出来,输出时间。

    给你一个n个结点、m条边的有向图,现在要你求从n-1个结点到达指定的一个结点的来回最长路。

    analyse:

    这题思路很巧妙,我们在存图的时候用链式向前星来存,存的时候就建两次边,一次正向,一次反向,用一个flag来标记一下。然后用两遍spfa,第一遍求出从x点出发的正向图到每个结点的最短路,第二遍求出从x点出发的反向图到每个结点的最短路,最后将两次的最短路对应相加,求出最大值即为最终的answer。

    Time complexity:O(n*k)

    Source code:

    //Memory   Time
    // 3521K    241MS
    //by : Snarl_jsb
    #include<algorithm>
    #include<cstdio>
    #include<cstring>
    #include<cstdlib>
    #include<iostream>
    #include<vector>
    #include<queue>
    #include<stack>
    #include<iomanip>
    #include<string>
    #include<climits>
    #include<cmath>
    #define MAXV 1010
    #define MAXE 100010
    #define LL long long
    using namespace std;
    namespace Adj
    {
        struct Node
        {
            int to,next,val;
            bool flag;
        } edge[MAXE<<1];
        int top,head[MAXV];
        void init()
        {
            top=1;
            memset(head,0,sizeof(head));
        }
        void addEdge(int u,int v,int val)
        {
            edge[top].to=v;
            edge[top].val=val;
            edge[top].flag=1;
            edge[top].next=head[u];
            head[u]=top++;
    
            edge[top].to=u;
            edge[top].val=val;
            edge[top].flag=0;
            edge[top].next=head[v];
            head[v]=top++;
        }
    }
    using namespace Adj;
    int n,m,x,ans;
    bool vis[MAXV];
    int dis[MAXV];
    int dis1[MAXV];
    void spfa(bool flag)
    {
        memset(vis,0,sizeof(vis));
        for(int i=0;i<=n;i++)
            dis[i]=INT_MAX;
        queue<int>Q;
        Q.push(x);
        vis[x]=1;
        dis[x]=0;
        while(!Q.empty())
        {
            int now=Q.front();
            Q.pop();
            vis[now]=0;
            for(int i=head[now];i;i=edge[i].next)
            {
                if(flag==1)
                {
                    if(edge[i].flag==0)
                        continue;
                }
                else
                {
                    if(edge[i].flag==1)
                        continue;
                }
                int son=edge[i].to;
                int val=edge[i].val;
                if(dis[now]+val<dis[son])
                {
                    dis[son]=dis[now]+val;
                    if(!vis[son])
                    {
                        vis[son]=1;
                        Q.push(son);
                    }
                }
            }
        }
        if(flag==1)
        {
            for(int i=1;i<=n;i++)
                dis1[i]=dis[i];
        }
        else
        {
            int Max=INT_MIN;
            for(int i=1;i<=n;i++)
            {
                dis[i]+=dis1[i];
                if(dis[i]>Max)
                    Max=dis[i];
            }
            ans=Max;
        }
    }
    
    int main()
    {
    //    freopen("cin.txt","r",stdin);
    //    freopen("cout.txt","w",stdout);
        while(~scanf("%d %d %d",&n,&m,&x))
        {
            init();
            int u,v,w;
            while(m--)
            {
                scanf("%d %d %d",&u,&v,&w);
                addEdge(u,v,w);
            }
            spfa(1);
            spfa(0);
            printf("%d
    ",ans);
        }
        return 0;
    }
    

      

  • 相关阅读:
    1.淡入淡出效果js原生代码2.缓冲运动
    php 图片加水印插件
    php redis使用 常用方法 | Windows环境下安装Redis | Windows下php安装redis扩展(详解版)
    Windows下安装使用workman简单实例
    极简生成excel方法;excel表导入数据库
    php 生成表单 | url串禁止转义并解决中文字符乱码
    图片上传预览并保存图片 | 多图上传预览并保存图片 | 树状结构(jquery.treeview.js)
    php Rsa签名算法
    php 正则表达式 1.字符串中提取带小数点的数字 2.判断字符串中是否包含关键字 3.统计二维数组中某个字段值出现的次数
    虚拟主机部署tp项目,在.htaccess文件中隐藏index.php
  • 原文地址:https://www.cnblogs.com/crazyacking/p/3898257.html
Copyright © 2011-2022 走看看