POJ-3268

Silver Cow Party

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 13738		Accepted: 6195

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 T_i (1 ≤ T_i ≤ 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: N, M, and X
Lines 2..M+1: Line i+1 describes road i with three space-separated integers: A_i, B_i, and T_i. The described road runs from farm A_i to farm B_i, requiring T_i time units to traverse.

Output

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

Sample Input

Sample Output

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

/**

          题意：最短路中哪个走的路程最大

          解法：SPFA

**/

#include<iostream>

#include<string.h>

#include<stdio.h>

#include<algorithm>

#include<cmath>

#include<queue>

#include<vector>

#define maxn 1000 + 10

#define INF 0x3f3f3f3f

using namespace std;

int vis[maxn];

int dist[maxn];

int dist1[maxn];

int flag[maxn];

struct Node

{

    int v;

    int cost;

    Node(int _v,int _cost):v(_v),cost(_cost) {}

};

vector<Node>edge[maxn];

vector<Node>edge1[maxn];

int n,m,p;

void addedge(int u,int v,int w)

{

    edge[u].push_back(Node(v,w));

    edge1[v].push_back(Node(u,w));

}

void SPFA(int start)

{

    memset(vis,,sizeof(vis));

    memset(dist,INF,sizeof(dist));

    queue<int>que;

    que.push(start);

    vis[start] = ;

    dist[start] = ;

    while(!que.empty())

    {

        int tt = que.front();

        que.pop();

        vis[tt] = ;

        for(int i=; i<edge[tt].size(); i++)

        {

            int mm = edge[tt][i].v;

            if(dist[mm] > dist[tt] + edge[tt][i].cost)

            {

                dist[mm] = dist[tt] + edge[tt][i].cost;

                if(!vis[mm])

                {

                    vis[mm] = ;

                    que.push(mm);

                }

            }

        }

    }

    memset(vis,,sizeof(vis));

    memset(dist1,INF,sizeof(dist1));

    while(!que.empty()) que.pop();

    vis[start] = ;

    dist1[start] = ;

    que.push(start);

    while(!que.empty())

    {

        int tt = que.front();

        que.pop();

        vis[tt] = ;

        for(int i=; i<edge1[tt].size(); i++)

        {

            int mm = edge1[tt][i].v;

            if(dist1[mm] > dist1[tt] + edge1[tt][i].cost)

            {

                dist1[mm] = dist1[tt] + edge1[tt][i].cost;

                if(!vis[mm])

                {

                    vis[mm] = ;

                    que.push(mm);

                }

            }

        }

    }

    return ;

}

int main()

{

//#ifndef ONLINE_JUDGE

//          freopen("in.txt","r",stdin);

//#endif // ONLINE_JUDGE

    scanf("%d %d %d",&n,&m,&p);

    int u,v,w;

    for(int i=; i<m; i++)

    {

        scanf("%d %d %d",&u,&v,&w);

        addedge(u,v,w);

    }

    SPFA(p);

    int mmax = -INF;

    for(int i=; i<=n; i++)

    {

        if(dist[i] + dist1[i] > mmax && dist[i] != INF && dist1[i]!= INF )

            mmax = dist[i] + dist1[i];

    }

    printf("%d\n",mmax);

    return ;

}

/**

          题意：最短路中哪个走的路程最大

          解法：SPFA

**/

#include<iostream>

#include<string.h>

#include<stdio.h>

#include<algorithm>

#include<cmath>

#include<queue>

#include<vector>

#define maxn 1000 + 10

#define INF 0x3f3f3f3f

using namespace std;

int vis[maxn];

int dist[maxn];

int dist1[maxn];

int flag[maxn];

struct Node

{

    int v;

    int cost;

    Node(int _v,int _cost):v(_v),cost(_cost) {}

};

vector<Node>edge[maxn];

vector<Node>edge1[maxn];

int n,m,p;

void addedge(int u,int v,int w)

{

    edge[u].push_back(Node(v,w));

    edge1[v].push_back(Node(u,w));

}

void SPFA(int start)

{

    memset(vis,,sizeof(vis));

    memset(dist,INF,sizeof(dist));

    queue<int>que;

    que.push(start);

    vis[start] = ;

    dist[start] = ;

    while(!que.empty())

    {

        int tt = que.front();

        que.pop();

        vis[tt] = ;

        for(int i=; i<edge[tt].size(); i++)

        {

            int mm = edge[tt][i].v;

            if(dist[mm] > dist[tt] + edge[tt][i].cost)

            {

                dist[mm] = dist[tt] + edge[tt][i].cost;

                if(!vis[mm])

                {

                    vis[mm] = ;

                    que.push(mm);

                }

            }

        }

    }

    memset(vis,,sizeof(vis));

    memset(dist1,INF,sizeof(dist1));

    while(!que.empty()) que.pop();

    vis[start] = ;

    dist1[start] = ;

    que.push(start);

    while(!que.empty())

    {

        int tt = que.front();

        que.pop();

        vis[tt] = ;

        for(int i=; i<edge1[tt].size(); i++)

        {

            int mm = edge1[tt][i].v;

            if(dist1[mm] > dist1[tt] + edge1[tt][i].cost)

            {

                dist1[mm] = dist1[tt] + edge1[tt][i].cost;

                if(!vis[mm])

                {

                    vis[mm] = ;

                    que.push(mm);

                }

            }

        }

    }

    return ;

}

int main()

{

//#ifndef ONLINE_JUDGE

//          freopen("in.txt","r",stdin);

//#endif // ONLINE_JUDGE

    scanf("%d %d %d",&n,&m,&p);

    int u,v,w;

    for(int i=; i<m; i++)

    {

        scanf("%d %d %d",&u,&v,&w);

        addedge(u,v,w);

    }

    SPFA(p);

    int mmax = -INF;

    for(int i=; i<=n; i++)

    {

        if(dist[i] + dist1[i] > mmax && dist[i] != INF && dist1[i]!= INF )

            mmax = dist[i] + dist1[i];

    }

    printf("%d\n",mmax);

    return ;

}

/**

          题意：最短路中哪个走的路程最大

          解法：SPFA

**/

#include<iostream>

#include<string.h>

#include<stdio.h>

#include<algorithm>

#include<cmath>

#include<queue>

#include<vector>

#define maxn 1000 + 10

#define INF 0x3f3f3f3f

using namespace std;

int vis[maxn];

int dist[maxn];

int dist1[maxn];

int flag[maxn];

struct Node

{

    int v;

    int cost;

    Node(int _v,int _cost):v(_v),cost(_cost) {}

};

vector<Node>edge[maxn];

vector<Node>edge1[maxn];

int n,m,p;

void addedge(int u,int v,int w)

{

    edge[u].push_back(Node(v,w));

    edge1[v].push_back(Node(u,w));

}

void SPFA(int start)

{

    memset(vis,,sizeof(vis));

    memset(dist,INF,sizeof(dist));

    queue<int>que;

    que.push(start);

    vis[start] = ;

    dist[start] = ;

    while(!que.empty())

    {

        int tt = que.front();

        que.pop();

        vis[tt] = ;

        for(int i=; i<edge[tt].size(); i++)

        {

            int mm = edge[tt][i].v;

            if(dist[mm] > dist[tt] + edge[tt][i].cost)

            {

                dist[mm] = dist[tt] + edge[tt][i].cost;

                if(!vis[mm])

                {

                    vis[mm] = ;

                    que.push(mm);

                }

            }

        }

    }

    memset(vis,,sizeof(vis));

    memset(dist1,INF,sizeof(dist1));

    while(!que.empty()) que.pop();

    vis[start] = ;

    dist1[start] = ;

    que.push(start);

    while(!que.empty())

    {

        int tt = que.front();

        que.pop();

        vis[tt] = ;

        for(int i=; i<edge1[tt].size(); i++)

        {

            int mm = edge1[tt][i].v;

            if(dist1[mm] > dist1[tt] + edge1[tt][i].cost)

            {

                dist1[mm] = dist1[tt] + edge1[tt][i].cost;

                if(!vis[mm])

                {

                    vis[mm] = ;

                    que.push(mm);

                }

            }

        }

    }

    return ;

}

int main()

{

//#ifndef ONLINE_JUDGE

//          freopen("in.txt","r",stdin);

//#endif // ONLINE_JUDGE

    scanf("%d %d %d",&n,&m,&p);

    int u,v,w;

    for(int i=; i<m; i++)

    {

        scanf("%d %d %d",&u,&v,&w);

        addedge(u,v,w);

    }

    SPFA(p);

    int mmax = -INF;

    for(int i=; i<=n; i++)

    {

        if(dist[i] + dist1[i] > mmax && dist[i] != INF && dist1[i]!= INF )

            mmax = dist[i] + dist1[i];

    }

    printf("%d\n",mmax);

    return ;

}

POJ-3268的更多相关文章

DIjkstra(反向边) POJ 3268 Silver Cow Party || POJ 1511 Invitation Cards
题目传送门 1 2 题意:有向图,所有点先走到x点,在从x点返回,问其中最大的某点最短路程分析:对图正反都跑一次最短路,开两个数组记录x到其余点的距离,这样就能求出来的最短路以及回去的最短路. PO ...
POJ 3268 Silver Cow Party （最短路径）
POJ 3268 Silver Cow Party (最短路径) Description One cow from each of N farms (1 ≤ N ≤ 1000) convenientl ...
POJ 3268——Silver Cow Party——————【最短路、Dijkstra、反向建图】
Silver Cow Party Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Su ...
POJ 3268 Silver Cow Party 最短路—dijkstra算法的优化。
POJ 3268 Silver Cow Party Description One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbe ...
poj 3268(spfa)
http://poj.org/problem?id=3268 对于这道题,我想说的就是日了狗了,什么鬼,定义的一个数值的前后顺序不同,一个就TLE,一个就A,还16MS. 感觉人生观都奔溃了,果然,题 ...
POJ 3268 Silver Cow Party （双向dijkstra）
题目链接:http://poj.org/problem?id=3268 Silver Cow Party Time Limit: 2000MS Memory Limit: 65536K Total ...
poj - 3268 Silver Cow Party (求给定两点之间的最短路）
http://poj.org/problem?id=3268 每头牛都要去标号为X的农场参加一个party,农场总共有N个(标号为1-n),总共有M单向路联通,每头牛参加完party之后需要返回自己的 ...
<poj - 3268> Silver Cow Party 牛のpart 最短路径问题
本题链接 : http://poj.org/problem?id=3268 题目大意:牛们要去聚会,输入N = 顶点数(牛场):M = 边(路)的数目: X = 终点 (聚会点).问题:求来回时间的最 ...
POJ 3268 (dijkstra变形)
题目链接 :http://poj.org/problem?id=3268 Description One cow from each of N farms (1 ≤ N ≤ 1000) conveni ...
POJ 3268 Silver Cow Party 最短路
原题链接:http://poj.org/problem?id=3268 Silver Cow Party Time Limit: 2000MS Memory Limit: 65536K Total ...

随机推荐

LOJ6354 & 洛谷4366：[Code+#4]最短路——题解
https://loj.ac/problem/6354 https://www.luogu.org/problemnew/show/P4366 题面见上面. 这题很妙,且可能是我傻,感觉这题不太好想. ...
[Leetcode] powx n x的n次方
Implement pow(x, n). 题意:计算x的次方思路:这题的思路和sqrt的类似,向二分靠近.例如求4^5,我们可以这样求:res=4.4*4^4.就是将每次在res的基础上乘以x本身, ...
C++语言中数组指针和指针数组彻底分析
################################# ## 基本知识 ## ...
node记录
集中管理 require('sequelize'); require('node-schedule')
注册google账号时出现手机号的问题
注册谷歌账号时出现此电话号码无法用于进行验证这主要是86和手机号之间有一个空格造成的,把这个空格删除就可以了
HDU4027 线段树
Can you answer these queries? Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65768/65768 K ...
分析一个贴图社交app的失败原因：FORK（相机）
FORK(相机)是一个通过分享图片来建立社交的app,它有着鲜明的配色,还算不错的贴图创新,细腻的产品设计,但是由于产品定位不清晰.设计亮点不多以及推广不利,从2014年5月第一版开始就没有火过.所以 ...
ubuntu18.04server设置静态IP
16.04以后的版本配置静态IP是类似这样的文件 /etc/netplan/50-cloud-init.yaml 1.查询网卡名称 2.修改配置文件/etc/netplan/50-cloud-init ...
JS开发中自定义调试信息开关
在开发过程中,可能随处留下几个console.log,或者alert语句,这些语句在开发过程中是很有价值的.但是项目一旦进入生产环境,过多的console.log可能影响到浏览器的运行效率,过多的al ...
Codeforces 713C Sonya and Problem Wihtout a Legend DP
C. Sonya and Problem Wihtout a Legend time limit per test 5 seconds memory limit per test 256 megaby ...

POJ-3268

POJ-3268的更多相关文章

随机推荐

热门专题