1021. Deepest Root (25) -并查集判树 -BFS求深度
题目如下:
A graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supposed to find the root that results in a highest tree. Such a root is called
the deepest root.
Input Specification:
Each input file contains one test case. For each case, the first line contains a positive integer N (<=10000) which is the number of nodes, and hence the nodes are numbered from 1 to N. Then N-1 lines follow, each describes an edge by given the two adjacent
nodes' numbers.
Output Specification:
For each test case, print each of the deepest roots in a line. If such a root is not unique, print them in increasing order of their numbers. In case that the given graph is not a tree, print "Error: K components" where K is the number of connected components
in the graph.
Sample Input 1:
5
1 2
1 3
1 4
2 5
Sample Output 1:
3
4
5
Sample Input 2:
5
1 3
1 4
2 5
3 4
Sample Output 2:
Error: 2 components
这个题有N个顶点,N-1条边,属于稀疏图,应该用邻接矩阵而不是邻接表,否则会内存超限。
刚开始拿到这道题目的时候我想到的方法是用带颜色标记的BFS判断环路,并且排除掉,但是这样会超时,后来在网上查阅,看到大家都是使用并查集来判断是否是树,通过把所有元素归入并查集,并且在查询根的时候压缩路径,如果所有元素都是同根的,那么把他们加入Set后集合的规模为1,说明是一棵完整的树,如果不是如此,则说明图由多个连通的部分组成,连通部分的个数等于根的个数,因此只需要输出Set的规模即可。
如果是一棵树,只需要使用BFS来遍历树中的每一个顶点,来计算深度。
为了计算深度,改进BFS,加入三个变量:head、last、tail,last表示这一层的最后一个元素,tail表示下一层的某个元素,初始化时,让last=s,代表第一层只有源点,接下来在出队一个结点,并让head等于这个结点,然后在遍历结点的邻接点时不断的更新tail,不难看出tail在最后一次更新后指向的是下一层的最后一个元素,然后判断head是否等于last,如果是代表本层结束,把层计数变量+1,更新last为tail,以此类推即可。
#include <iostream>
#include <stdio.h>
#include <queue>
#include <set> using namespace std; #define MAX 10002 bool visited[MAX];
vector<vector<int> > Graph;
int N;
int P[MAX]; void initSet(int N){ for(int i = 1; i <= N; i++) P[i] = i; } void CompressSet(int x, int top){ if(P[x] != top){
CompressSet(P[x],top);
P[x] = top;
} } int FindSet(int x){ if(x != P[x]){
int t = FindSet(P[x]);
CompressSet(x,t);
}
return P[x]; } void UnionSet(int x, int y){ int p1 = FindSet(x);
int p2 = FindSet(y);
P[p1] = p2; } int BFS(int s){ for(int i = 1; i <= N; i++) visited[i] = false;
int head,tail,last;
int stage = 0;
queue<int> Q;
Q.push(s);
visited[s] = 1;
last = s;
while(!Q.empty()){
int v = Q.front();
visited[v] = 1;
head = v;
Q.pop();
for(int index = 0; index < Graph[v].size(); index++){
int w = Graph[v][index];
if(!visited[w]){
Q.push(w);
tail = w;
}
}
if(head == last){
last = tail;
stage++;
} } return stage; } int main()
{
cin >> N;
int v1,v2; Graph.resize(N + 1);
initSet(N);
for(int i = 1; i <= N; i++){
visited[i] = false;
} for(int i = 1; i < N; i++){
scanf("%d%d",&v1,&v2);
Graph[v1].push_back(v2);
Graph[v2].push_back(v1);
} for(int i = 1; i <= N; i++){
for(int j = 0; j < Graph[i].size(); j++){
UnionSet(i,Graph[i][j]);
}
} set<int> root;
for(int i = 1; i<= N; i++){
root.insert(FindSet(i));
} if(root.size() != 1){
printf("Error: %d components\n",root.size());
return 0;
} vector<int> maxDeepNodes;
maxDeepNodes.clear();
int maxDepth = 0;
int depth = 0; for(int i = 1; i <= N; i++){
depth = BFS(i);
if(depth > maxDepth){
maxDepth = depth;
maxDeepNodes.clear();
maxDeepNodes.push_back(i);
}else if(depth == maxDepth){
maxDeepNodes.push_back(i);
}
} for(int i = 0; i < maxDeepNodes.size(); i++){
printf("%d\n",maxDeepNodes[i]);
} return 0;
}
1021. Deepest Root (25) -并查集判树 -BFS求深度的更多相关文章
- [PAT] 1021 Deepest Root (25)(25 分)
1021 Deepest Root (25)(25 分)A graph which is connected and acyclic can be considered a tree. The hei ...
- PAT 甲级 1021 Deepest Root (25 分)(bfs求树高,又可能存在part数part>2的情况)
1021 Deepest Root (25 分) A graph which is connected and acyclic can be considered a tree. The heig ...
- 1021. Deepest Root (25)——DFS+并查集
http://pat.zju.edu.cn/contests/pat-a-practise/1021 无环连通图也可以视为一棵树,选定图中任意一点作为根,如果这时候整个树的深度最大,则称其为 deep ...
- PAT甲题题解-1021. Deepest Root (25)-dfs+并查集
dfs求最大层数并查集求连通个数 #include <iostream> #include <cstdio> #include <algorithm> #inclu ...
- 1021. Deepest Root (25)
A graph which is connected and acyclic can be considered a tree. The height of the tree depends on t ...
- PAT (Advanced Level) 1021. Deepest Root (25)
先并查集判断连通性,然后暴力每个点作为根节点判即可. #include<iostream> #include<cstring> #include<cmath> #i ...
- 1021 Deepest Root (25)(25 point(s))
problem A graph which is connected and acyclic can be considered a tree. The height of the tree depe ...
- 1021 Deepest Root (25 分)
A graph which is connected and acyclic can be considered a tree. The height of the tree depends on t ...
- Is It A Tree? POJ - 1308(并查集判树)
Problem Description A tree is a well-known data structure that is either empty (null, void, nothing) ...
随机推荐
- form submit提交
form内控件参数自动添加到url后,而自定义的url参数则不能添加到url后 $('#fm').form('submit', { url: 'Data/Diary.ashx?dt=' + new D ...
- idea和androidstudio的首次git配置一些问题
网上都有很清楚的步骤 但是 都是教怎么使用 但是对第一次应用idea内部vcs的git 则很少有详细说明 首先要在网上创建个项目 然后本地git clone下来 不建议内部vcs的fetch from ...
- 深入理解Java类加载器(1):Java类加载原理解析
1 基本信息 每个开发人员对Java.lang.ClassNotFoundExcetpion这个异常肯定都不陌生,这背后就涉及到了java技术体系中的类加载.Java的类加载机制是技术体系中比较核心的 ...
- centos 6安装 H3C iNode 上网客户端
我的安装目录是/usr/iNode 直接把客户端安装包拷到这个文件夹下然后解压: #rar x iNode2.-R0162.rar 然后进入文件夹,里边有一个install.sh文件,这是一个安装文件 ...
- 百钱买百鸡问题Java
//百钱买百鸡public class baiqianbaiji { static void BQBJ(int m,int n)//m为钱的总数,n为鸡数 { int z; for(int x = 0 ...
- 用js来实现那些数据结构13(树01-二叉搜索树的实现)
前一篇文章我们学会了第一个非顺序数据结构hashMap,那么这一篇我们来学学树,包括树的概念和一些相关的术语以及二叉搜索树的实现.唉?为什么不是树的实现,不是二叉树的实现.偏偏是二叉搜索树的实现?嗯, ...
- Dynamics CRM2016 Web Api之查询查找字段的相关属性
之前有篇博文介绍了如何获取查找字段的name值(跳转),本篇在此基础上再延伸下,实现的效果类似于EntityReference,可以取到查找字段的id,name,localname. 这里我以客户实体 ...
- formData的实现
参考:https://developer.mozilla.org/zh-CN/docs/Web/API/XMLHttpRequest/Using_XMLHttpRequest <!doctype ...
- android ActionBarActivity设置全屏无标题
新建的Activity继承自ActionBarActivity,设置全屏无标题本来很简单的事,但是没想到app竟然无缘无故的挂,要么就是白屏一片,要么就是黑屏.坑了我一个多小时!!! 原因是Actio ...
- GDAL创建图像提示Driver xxx does not support XXX creation option的原因
经常在群里有人问,创建图像的时候为什么老是提示下面的信息. CPLError: Driver GTiff does not support DCAP_CREATE creation option Wa ...