牛客 NC25077 [USACO 2007 Ope B]Bronze Cow Party

Double.Qing

已于 2022-09-03 22:21:54 修改

阅读量177

点赞数 1

分类专栏：牛客文章标签： c++ 算法图论

于 2022-09-03 22:19:41 首次发布

本文链接：https://blog.csdn.net/qq_62242287/article/details/126683445

版权

牛客专栏收录该内容

22 篇文章 0 订阅

订阅专栏

这篇博客讲述了如何解决一个关于N个农场和M条双向道路的最优化问题，即计算所有奶牛往返于派对和家之间的最长时间，以便决定派对暂停的最少时间。通过SPFA算法找到最短路径，求得单程最大距离后计算总暂停时间。

摘要由CSDN通过智能技术生成

题目描述

One cow from each of N farms (1 <= N <= 1000) conveniently numbered 1..N is attending the big cow party to be held at farm #X (1 <= X <= N). Each of M (1 <= M <= 100,000) bidirectional roads connects one farm to another. It is always possible to travel from one farm to another on the roads. Traversing road i requires Ti (1 <= Ti <= 100) units of time. One or more pairs of farms might be directly connected by more than one road.
After all the cows gathered at farm #X, they realized that every single cow left her party favors back at the farm. They decided to suspend the party and send all the cows back to get the party favors. The cows all travel optimal routes to their home farm and back to the party. What is the minimum number of time units the party must be suspended?One cow from each of N farms (1 <= N <= 1000) conveniently numbered 1..N is attending the big cow party to be held at farm #X (1 <= X <= N). Each of M (1 <= M <= 100,000) bidirectional roads connects one farm to another. It is always possible to travel from one farm to another on the roads. Traversing road i requires Ti (1 <= Ti <= 100) units of time. One or more pairs of farms might be directly connected by more than one road.

输入描述:

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, respectively: Ai, Bi, and Ti. The described road connects Ai and Bi and requires Ti time units to traverse.

输出描述:

Line 1: One integer: the minimum amount of time the party must be suspended.

示例1

输入

复制

输出

复制

说明

Four cows; eight roads; party at farm 2.
Direct paths connects farm 2 to each of the other farms (to farm 1: 7 and 3; to farm 3: 1; to farm 4: 2). The longest path is length 3, so the round-trip time is 6.

思路：一道非常简单的最短路问题，要求所有奶牛往返的最短时间，只需要求所有牛场到终点之间最短路的最大值，然后将最大值的两倍输出即可，于是我们可以以终点为起点跑一遍spfa，然后遍历终点到每个牛场的距离取最大值即可；

AC代码：

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
using namespace std;

const int N=1010,M=200010;

int n,m,x;
int h[N],w[M],ne[M],e[M],idx;
int dist[N];
bool st[N];

void add(int a,int b,int c)
{
	w[idx]=c,e[idx]=b,ne[idx]=h[a],h[a]=idx++;
}

void spfa()
{
	memset(dist,0x3f,sizeof dist);
	dist[x]=0;
	queue<int>q;
	q.push(x);
	
	while(q.size())
	{
		int t=q.front();
		q.pop();
		st[t]=0;
		
		for(int i=h[t];~i;i=ne[i])
		{
			int j=e[i];
			if(dist[j]>dist[t]+w[i])
			{
				dist[j]=dist[t]+w[i];
				if(!st[j])
				{
					st[j]=1;
					q.push(j);
				}
			}
		}
	}
}

int main()
{
	memset(h,-1,sizeof h);
	scanf("%d%d%d",&n,&m,&x);
	while(m--)
	{
		int a,b,c;
		scanf("%d%d%d",&a,&b,&c);
		add(a,b,c),add(b,a,c);
	}
	spfa();
	
	int res=0;
	for(int i=1;i<=n;i++)
		res=max(res,dist[i]);
	cout<<res*2<<endl;
}

题目描述

输入描述:

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, respectively: Ai, Bi, and Ti. The described road connects Ai and Bi and requires Ti time units to traverse.

输出描述:

Line 1: One integer: the minimum amount of time the party must be suspended.

示例1

输入

复制

输出

复制

说明

Four cows; eight roads; party at farm 2.
Direct paths connects farm 2 to each of the other farms (to farm 1: 7 and 3; to farm 3: 1; to farm 4: 2). The longest path is length 3, so the round-trip time is 6.