当前位置:网站首页>hdu2377Bus Pass(构建更复杂的图+spfa)
hdu2377Bus Pass(构建更复杂的图+spfa)
2022-07-05 20:47:00 【全栈程序员站长】
大家好,又见面了,我是全栈君
主题链接:
思路:
题目是给了非常多个车站。然后要你找到一个社区距离这些车站的最大值最小。。所以对每一个车站做一次spfa。那么就得到了到每一个社区的最大值,最后对每一个社区扫描一次,得到那个最小值的社区。。 还有题目要求是要最小的id,所以排一次序。
题目:
Bus Pass
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 667 Accepted Submission(s): 271
Problem 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 id i (1 <= id i <= 9 999) and mz i (1 <= mz i <= 10), a number identifying the i-th zone and the number of zones adjacent to it, followed by mz i integers: the numbers of the adjacent zones.
nr lines starting with one integer mr i (1 <= mr i <= 20), indicating the number of zones the ith bus trip visits, followed by mr i 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.
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
lcy | We have carefully selected several similar problems for you: 27222363248229621598
代码为:
#include<cstdio>
#include<queue>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#define INF 0x3f3f3f3f
using namespace std;
const int maxn=9999+10;
int dis[maxn],id[maxn],max_dis[maxn];
bool vis[maxn];
vector<int>vec[maxn];
int t,n,bus,cal;
bool cmp(int a,int b)
{
return a<b;
}
void spfa(int st)
{
queue<int>Q;
while(!Q.empty()) Q.pop();
memset(vis,false,sizeof(vis));
memset(dis,INF,sizeof(dis));
Q.push(st);
dis[st]=0;
vis[st]=true;
while(!Q.empty())
{
int temp=Q.front();
Q.pop();
vis[temp]=false;
for(int i=0;i<vec[temp].size();i++)
{
if(dis[temp]+1<dis[vec[temp][i]])
{
dis[vec[temp][i]]=dis[temp]+1;
if(!vis[vec[temp][i]])
{
vis[vec[temp][i]]=true;
Q.push(vec[temp][i]);
}
}
}
}
}
void read_graph()
{
memset(max_dis,0,sizeof(max_dis));
int u;
scanf("%d%d",&n,&bus);
for(int i=1;i<=maxn;i++)
vec[i].clear();
for(int i=1;i<=n;i++)
{
scanf("%d%d",&id[i],&cal);
for(int j=1;j<=cal;j++)
{
scanf("%d",&u);
vec[id[i]].push_back(u);
}
}
while(bus--)
{
scanf("%d",&cal);
while(cal--)
{
int st;
scanf("%d",&st);
spfa(st);
for(int i=1;i<=n;i++)
{
if(dis[id[i]]>max_dis[id[i]])
max_dis[id[i]]=dis[id[i]];
}
}
}
int ans=999999999,ans_id;
sort(id+1,id+1+n,cmp);
for(int i=1;i<=n;i++)
{
if(max_dis[id[i]]<ans)
{
ans=max_dis[id[i]];
ans_id=id[i];
}
}
printf("%d %d\n",ans+1,ans_id);
}
int main()
{
scanf("%d",&t);
while(t--)
{
read_graph();
}
return 0;
}
版权声明:本文博客原创文章。博客,未经同意,不得转载。
发布者:全栈程序员栈长,转载请注明出处:https://javaforall.cn/117648.html原文链接:https://javaforall.cn
边栏推荐
- Composition of applet code
- Typhoon is coming! How to prevent typhoons on construction sites!
- Abnova丨培养细胞总 RNA 纯化试剂盒中英文说明书
- How to renew NPDP? Here comes the operation guide!
- Is the securities account given by the school of Finance and business safe? Can I open an account?
- Maker education infiltrating the transformation of maker spirit and culture
- 小程序项目结构
- 培养机器人教育创造力的前沿科技
- 教你自己训练的pytorch模型转caffe(三)
- Classic implementation of the basic method of intelligent home of Internet of things
猜你喜欢
leetcode:1755. 最接近目标值的子序列和
The development of research tourism practical education helps the development of cultural tourism industry
Frequent MySQL operations cause table locking problems
Abnova丨DNA 标记高质量控制测试方案
1、强化学习基础知识点
Wanglaoji pharmaceutical's public welfare activity of "caring for the most lovely people under the scorching sun" was launched in Nanjing
National Eye Care Education Conference, 2022 the Fourth Beijing International Youth eye health industry exhibition
Abnova丨血液总核酸纯化试剂盒预装相关说明书
培养机器人教育创造力的前沿科技
Abbkine丨TraKine F-actin染色试剂盒(绿色荧光)方案
随机推荐
Duchefa丨MS培养基含维生素说明书
[record of question brushing] 1 Sum of two numbers
Duchefa细胞分裂素丨二氢玉米素 (DHZ)说明书
Make Jar, Not War
[Yugong series] go teaching course in July 2022 004 go code Notes
Duchefa p1001 plant agar Chinese and English instructions
Maker education infiltrating the transformation of maker spirit and culture
Interpreting the daily application functions of cooperative robots
CADD course learning (7) -- Simulation of target and small molecule interaction (semi flexible docking autodock)
重上吹麻滩——段芝堂创始人翟立冬游记
Abnova CRISPR spcas9 polyclonal antibody protocol
证券开户选择哪个证券比较好?网上开户安全么?
Applet event binding
鸿蒙os第四次学习
Classic implementation method of Hongmeng system controlling LED
NPDP如何续证?操作指南来了!
Typhoon is coming! How to prevent typhoons on construction sites!
解析创客教育的知识迁移和分享精神
Duchefa丨D5124 MD5A 培养基中英文说明书
Duchefa low melting point agarose PPC Chinese and English instructions