zoj2913 Bus Pass BFS

原创 2015年11月18日 21:12:52

ZOJ - 2913

Time Limit: 5000MS   Memory Limit: 32768KB   64bit IO Format: %lld & %llu

 Status

Description

You travel a lot by bus and the costs of all the seperate tickets are starting to add up.

Therefore you want to see if it might be advantageous for you to buy a bus pass.

The way the bus system works in your country (and also in the Netherlands) is as follows:

when you buy a bus pass, you have to indicate a center zone and a star value. You are allowed to travel freely in any zone which has a distance to your center zone which is less than your star value. For example, if you have a star value of one, you can only travel in your center zone. If you have a star value of two, you can also travel in all adjacent zones, et cetera.

You have a list of all bus trips you frequently make, and would like to determine the minimum star value you need to make all these trips using your buss pass. But this is not always an easy task. For example look at the following figure:


Here you want to be able to travel from A to B and from B to D. The best center zone is 7400, for which you only need a star value of 4. Note that you do not even visit this zone on your trips!

Input

On the first line an integert(1 <=t<= 100): the number of test cases. Then for each test case:

One line with two integersnz(2 <=nz<= 9 999) andnr(1 <=nr<= 10): the number of zones and the number of bus trips, respectively.

nz lines starting with two integers idi (1 <= idi <= 9 999) and mzi (1 <= mzi <= 10), a number identifying the i-th zone and the number of zones adjacent to it, followed by mzi integers: the numbers of the adjacent zones.

nr lines starting with one integer mri (1 <= mri <= 20), indicating the number of zones the ith bus trip visits, followed by mriintegers: the numbers of the zones through which the bus passes in the order in which they are visited.

All zones are connected, either directly or via other zones.

Output

For each test case:

One line with two integers, the minimum star value and the id of a center zone which achieves this minimum star value. If there are multiple possibilities, choose the zone with the lowest number.

Sample Input

1
17 2
7400 6 7401 7402 7403 7404 7405 7406
7401 6 7412 7402 7400 7406 7410 7411
7402 5 7412 7403 7400 7401 7411
7403 6 7413 7414 7404 7400 7402 7412
7404 5 7403 7414 7415 7405 7400
7405 6 7404 7415 7407 7408 7406 7400
7406 7 7400 7405 7407 7408 7409 7410 7401
7407 4 7408 7406 7405 7415
7408 4 7409 7406 7405 7407
7409 3 7410 7406 7408
7410 4 7411 7401 7406 7409
7411 5 7416 7412 7402 7401 7410
7412 6 7416 7411 7401 7402 7403 7413
7413 3 7412 7403 7414
7414 3 7413 7403 7404
7415 3 7404 7405 7407
7416 2 7411 7412
5 7409 7408 7407 7405 7415
6 7415 7404 7414 7413 7412 7416

Sample Output

4 7400

Source

The 2007 Benelux Algorithm Programming Contest


对线路上的每个站点进行bfs,找出该站点到所有站点的最短距离,再更新线路上的站点到地图上的所有站点的的距离的最大值。

线路中的所有站点到地图上的所有站点的最大值中的最小值就是答案。

<span style="font-size:18px;">#include<iostream>
#include<cstdio>
#include<queue>
#include<cmath>
#include<cstring>
using namespace std;
const int INF=0x3f3f3f3f;
int t,nz,nr,mr,id;
int mz[10000];//相邻站点的数目
int edge[10000][15];//站的邻接表
int ans[10000];//线路上的站点到达这个站点的距离的最大值
int ID[10000];//站的号码
int ANS,ANSID;
void bfs(int v)
{
	int p;
	int c[10000];
	memset(c,INF,sizeof(c));
	c[v]=1;
	queue<int> q;
	q.push(v);
	while(!q.empty())
	{
		p=q.front();
		q.pop();
		for(int i=0;i<mz[p];i++)
		{
			if(c[edge[p][i]]>c[p]+1)
			{
				c[edge[p][i]]=c[p]+1;
				q.push(edge[p][i]);
			}
		}

	}
	for(int i=0;i<nz;i++)
	{
		ans[ID[i]]=max(c[ID[i]],ans[ID[i]]);	
	}
	/*for(int i=0;i<nz;i++)
	{
		printf("%d%   d\n",ID[i],ans[ID[i]]);
	}
	puts("_________________________");*/
}
int main()
{
	freopen("in.in","r",stdin);
	scanf("%d",&t);
	while(t--)
	{
		memset(ans,0,sizeof(ans));
		ANS=INF;
		scanf("%d%d",&nz,&nr);
		for(int i=0;i<nz;i++)
		{
			scanf("%d",&ID[i]);
			scanf("%d",&mz[ID[i]]);
			for(int j=0;j<mz[ID[i]];j++)
			{
				scanf("%d",&edge[ID[i]][j]);
			}
		}
		for(int i=0;i<nr;i++)
		{
			scanf("%d",&mr);
			for(int j=0;j<mr;j++)
			{
				scanf("%d",&id);
				bfs(id);
			}
		}
		for(int i=0;i<nz;i++)
		{
			if(ANS>ans[ID[i]])
			{
				ANS=ans[ID[i]];
				ANSID=ID[i];
			}
			else if(ANS==ans[ID[i]] && ANSID>ID[i])
			{
				ANSID=ID[i];
			}
		}
		printf("%d %d\n",ANS,ANSID);
	}
}</span>


ZOJ 2913 Bus Pass (最近的最远BFS HDU2377)

题意  在所有城市中找一个中心满足这个中心到所有公交站点距离的最大值最小 输出最小距离和满足最小距离编号最小的中心 最基础的BFS  对每个公交站点BFS  dis[i]表示编号为i的点到所有公交站...
  • acvay
  • acvay
  • 2014年10月18日 22:12
  • 1168

“Bus Pass(公交车通票),ZOJ2913”的一种解法

本文介绍了Bus Pass(公交车通票),ZOJ2913的一种解题思路,采用一种比较特殊的广度优先算法进行解答。...
  • PosPro
  • PosPro
  • 2016年06月25日 17:30
  • 707

zoj 2913 Bus Pass

//BFS经典题 #include #include #include #include #include #define MAX 10000 #define INF 1000000 using ...
  • regnjka
  • regnjka
  • 2013年09月20日 10:43
  • 354

hdu2913 Traveling Cube (bfs+hash)

题意: 一个立方体,六面都有一个颜色。给定一张地图,'w'可走无数次,'b'不可走,'r', 'g', 'b', 'c', 'm', 'y'都只能走一次,而且当立方体滚到这几种颜色上时,立方体的上表...

HDU 2377 Bus Pass spfa

Problem Description You travel a lot by bus and the costs of all the seperate tickets are starting ...
  • AXuan_K
  • AXuan_K
  • 2015年01月18日 10:24
  • 688

【最短路+spfa+有难度】杭电 hdu 2377 Bus Pass

/* THE PROGRAM IS MADE BY PYY */ /*-----------------------------------------------------------------...

(未完成) Bus Pass

这道题没有成功,一反正自己试了一些数据也是对的。就是不正确。 我的思路,把车经过 的站点进行最短路搜索(因为这样的点比较少),然后找到各站点到各点的最大值中所有的最小值即可。 #i...

HDU 2377 Bus Pass 最短路SPaf

Bus Pass Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tota...

HDU 2377 Bus Pass(最短路 SPFA)

Bus Pass Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tota...

HDU2377Bus Pass(spfa)

Bus Pass Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tota...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:zoj2913 Bus Pass BFS
举报原因:
原因补充:

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