HDU 2377 基础dijkstra,spfa算法
来源:互联网 发布:哥德尔和人工智能 编辑:程序博客网 时间:2024/06/14 08:19
先贴题目:
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!
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.
117 27400 6 7401 7402 7403 7404 7405 74067401 6 7412 7402 7400 7406 7410 74117402 5 7412 7403 7400 7401 74117403 6 7413 7414 7404 7400 7402 74127404 5 7403 7414 7415 7405 74007405 6 7404 7415 7407 7408 7406 74007406 7 7400 7405 7407 7408 7409 7410 74017407 4 7408 7406 7405 74157408 4 7409 7406 7405 74077409 3 7410 7406 74087410 4 7411 7401 7406 74097411 5 7416 7412 7402 7401 74107412 6 7416 7411 7401 7402 7403 74137413 3 7412 7403 74147414 3 7413 7403 74047415 3 7404 7405 74077416 2 7411 74125 7409 7408 7407 7405 74156 7415 7404 7414 7413 7412 7416
4 7400
下面贴代码:
#include<cstdio>
#include<cstring>
#include<queue>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
const int MAXN = 10005;
int nz,nr;
int INF = 100;
int id[MAXN],head[MAXN],dist[MAXN],maxid[MAXN];
bool vis[MAXN];
struct edge
{
int u,v;
int next;
} edge[200005];
int cnt;
void add(int u,int v) / /这步把所有与u有关的节点连起来
{
edge[cnt].u=u;
edge[cnt].v=v;
edge[cnt].next=head[u];
head[u]=cnt++;
}
void spfa(int st) // 模板代码
{
memset(vis,0,sizeof(vis));
memset(dist,INF,sizeof(dist));
queue <int> q;
q.push(st);
dist[st]=0;
vis[st]=true;
while(!q.empty())
{
int u=q.front();
q.pop();
for(int i=head[u];i!=-1;i=edge[i].next)
{
int v=edge[i].v;
if(dist[v]>dist[u]+1)
{
dist[v]=dist[u]+1;
if(!vis[v])
{
q.push(v);
vis[v]=true;
}
}
}
}
}
int main()
{
freopen("test.txt","r",stdin);
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&nz,&nr);
memset(maxid,0,sizeof(maxid));
memset(head,-1,sizeof(head));
cnt=0;
for(int i=0;i<nz;i++)
{
int mz;
scanf("%d%d",&id[i],&mz);
while(mz--)
{
int v;
scanf("%d",&v);
add(id[i],v);
}
}
while(nr--)
{
int mr;
scanf("%d",&mr);
while(mr--)
{
int st;
scanf("%d",&st);
spfa(st);
for(int i=0;i<nz;i++)
{
if(dist[id[i]]>maxid[id[i]])
maxid[id[i]]=dist[id[i]];
}
}
}
int mindist=1000000,k;
sort(id,id+nz);//就是这步,一开始我没加,真是害惨我了
for(int i=0;i<nz;i++)
{
if(maxid[id[i]]<mindist)
{
mindist=maxid[id[i]];
k=id[i];
}
}
printf("%d %d\n",mindist+1,k);
}
return 0;
}
- HDU 2377 基础dijkstra,spfa算法
- HDU 2544 最短路【Dijkstra算法、spfa算法】
- hdu 1548 A strange lift Dijkstra+SPFA算法AC
- 一个人的旅行 HDU杭电2066【dijkstra算法 || SPFA】
- 六度分离 HDU杭电1869【dijkstra算法 || SPFA】
- 最短路 HDU杭电2544【dijkstra算法 || SPFA】
- 畅通工程续HDU杭电1874【dijkstra算法 || SPFA】
- 最短路 HDU杭电2544【dijkstra算法 || SPFA】
- HDU 2112 HDU Today【最短路+map容器,spfa算法+Dijkstra算法】
- HDU 2544-最短路(Dijkstra算法 Floyd算法 SPFA算法,3种实现代码,包含路径)
- HDU 2112:HDU Today【Dijkstra & SPFA & Floyd】
- HDU 3790 最短路径问题【多关键字最短路,Dijkstra算法+spfa算法】
- HDU 1874 畅通工程续【最短路,Dijkstra算法+spfa算法】
- HDU 2066 一个人的旅行【最短路,多起点多终点,Dijkstra算法+spfa算法】
- HDU 2066 一个人的旅行【最短路,多起点多终点,Dijkstra算法+spfa算法】
- HDU - 2544 - 最短路 (最基础单源最短路问题!!dijkstra+floyd+SPFA)
- hdu 2962 Trucking 最短路+二分。。Dijkstra+SPFA两种算法实现。
- Choose the best route HDU杭电2680【dijkstra算法 || SPFA】
- 多线程简单示例
- Mysql 安装 错误 记录
- C#winform设置窗体自动缩放适应不同尺寸的电脑屏幕大小
- POJ 3009Curling 2.0(基础题)
- Java集合框架面试问题集锦
- HDU 2377 基础dijkstra,spfa算法
- Django学习笔记(六)Django上传文件
- 拓扑排序(AOV)---判断图中是否有环---《数据结构》严蔚敏
- OC语言特点
- 试探究一种查找素数算法
- TCP协议中的三次握手和四次挥手(图解)
- Java fast-fail机制
- leetcode Single Number & Single Number ||
- 【HDU】4908 BestCoder Sequence 预处理