hdu 2377 Bus Pass
Bus Pass
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 667 Accepted Submission(s): 271
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!
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 mri integers: 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.
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.
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
#include <iostream>
#include <stack>
#include <cstring>
#include <cstdio>
#include <string>
#include <algorithm>
#include <queue>
using namespace std;
/*
要求出某个点到所有公交站点的距离最大的最小;
那么就可以先求出每个公交站点到所有点的距离中,相应的每个点到公交站点的距离取最大,在所有点距离去最小即可。
*/
#define ms(arr, val) memset(arr, val, sizeof(arr))
#define N 10000
#define INF 0x3fffffff
struct node
{
int seq;
int lay;
};
int id[N][];
int idtag[N];
int idmax[N];
int iddis[N];
queue<int> q; void bfs(int p)//求bfs求单元最短路,因为相邻两点距离为1.
{
ms(iddis, );
ms(idtag, );
q.push(p);
idtag[p] = iddis[p] = ;
while (!q.empty())
{
int s = q.front();
q.pop();
int i = ;
while (id[s][i])
{
if (!idtag[id[s][i]])
{
iddis[id[s][i]] = iddis[s] + ;
idtag[id[s][i]] = ;
q.push(id[s][i]);
}
i++;
}
}
}
int main()
{
int t, nz, nr, mzn, idp, mrn, tt, ans, pos;
cin >> t;
while (t--)
{
ms(id, );
ms(idmax, );
cin >> nz >> nr;
for (int i = ; i < nz; i++)
{
cin >> idp >> mzn;
for (int j = ; j < mzn; j++)
{
cin >> id[idp][j];
}
} for (int i = ; i < nr; i++)
{
cin >> mrn;
for (int j = ; j < mrn; j++)
{
cin >> tt;
bfs(tt);
for (int i = ; i < N; i++)
{
idmax[i] = max(idmax[i], iddis[i]);
}
}
}
pos = ;
ans = INF;
for (int i = ; i < N; i++)
{
if (idmax[i] > && ans > idmax[i])
{
pos = i;
ans = idmax[i];
}
}
cout << ans <<' '<<pos<< endl;
}
return ;
}
hdu 2377 Bus Pass的更多相关文章
- Bus Pass
ZOJ Problem Set - 2913 Bus Pass Time Limit: 5 Seconds Memory Limit: 32768 KB You travel a lot b ...
- ZOJ 2913 Bus Pass (近期的最远BFS HDU2377)
题意 在全部城市中找一个中心满足这个中心到全部公交网站距离的最大值最小 输出最小距离和满足最小距离编号最小的中心 最基础的BFS 对每一个公交网站BFS dis[i]表示编号为i的点到全部公交网 ...
- hdu 5552 Bus Routes
hdu 5552 Bus Routes 考虑有环的图不方便,可以考虑无环连通图的数量,然后用连通图的数量减去就好了. 无环连通图的个数就是树的个数,又 prufer 序我们知道是 $ n^{n-2} ...
- HDU 3420 -- Bus Fair ACM
Bus Fair Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total S ...
- hdu 1690 Bus System(Dijkstra最短路)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1690 Bus System Time Limit: 2000/1000 MS (Java/Others ...
- hdu 1690 Bus System (有点恶心)
Problem Description Because of the huge population of China, public transportation is very important ...
- hdu 1690 Bus System (最短路径)
Bus System Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total ...
- HDU 3420 Bus Fair [补]
今天玩魔灵玩多了,耽误了时间,回去宿舍又没电. /*********************************************/ Bus Fair Time Limit: 2000/10 ...
- HDU 1690 Bus System
题目大意:给出若干巴士不同价格的票的乘坐距离范围,现在有N个站点,有M次询问,查询任意两个站点的最小花费 解析:由于是多次查询不同站点的最小花费,所以用弗洛伊德求解 时间复杂度(O^3) 比较基础的弗 ...
随机推荐
- 例题 3-5 生成元 digit generator
#include<stdio.h> #include<string.h> #define maxn 100005 int ans[maxn]; //类似于 比较大的数组还是开导 ...
- spring boot 项目发布运行
1. maven install 发布jar包 2. java -jar webservice.jar 启动jar包
- 进击的Python【第九章】:paramiko模块、线程与进程、各种线程锁、queue队列、生产者消费者模型
一.paramiko模块 他是什么东西? paramiko模块是用python语言写的一个模块,遵循SSH2协议,支持以加密和认证的方式,进行远程服务器的连接. 先来个实例: import param ...
- 题解报告:hdu 2057 A + B Again
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2057 问题描述 我们的HDOJ必须有许多A + B问题,现在又有新的问题出现. 给你两个十六进制整数, ...
- VS2010下安装Opencv 分类: Opencv 2014-11-02 13:51 778人阅读 评论(0) 收藏
Opencv作为一种跨平台计算机视觉库,在图像处理领域得到广泛的应用,下面介绍如何在VS2010中安装配置Opencv 一.下载Opencv 下载网址:http://sourceforge.net/p ...
- 在Eclipse+ADT中开发Android系统的内置应用
转自: http://www.iteye.com/topic/1050439 在Eclipse+ADT中开发Android系统的内置应用 Android系统内置有:Browser(浏览器).Mms( ...
- 3、InputStream
package com.io.file; import java.io.File; import java.io.FileInputStream; import java.io.FileNotFoun ...
- jmeter(九)分布式测试
Jmeter 是java 应用,对于CPU和内存的消耗比较大,因此,当需要模拟数以千计的并发用户时,使用单台机器模拟所有的并发用户就有些力不从心,甚至会引起JAVA内存溢出错误.为了让jmeter工具 ...
- ubuntu14.04 + GTX980ti + cuda 8.0 ---Opencv3.1.0(基础+opecv_contrib)配置
如果喜欢视频的话:YouTube 上有视频教程 https://www.youtube.com/watch?v=1YIAp3Lh5hI 后来我在mac上安装最新版的OpenCV 找到了一片非常详细的教 ...
- zojDakar Rally(01背包)
01背包 加上每次更新解题数目最多 总用时最少 因为要保证用时最少,要先把时长由小到大排序. 没排序 WA了几小时..链接 #include <iostream> #include< ...