1021 Deepest Root (25 point(s))

最新推荐文章于 2021-11-22 08:52:42 发布

摩天佳迪斯

最新推荐文章于 2021-11-22 08:52:42 发布

阅读量114

点赞数

分类专栏： PAT (Advanced Level) Practice 文章标签：算法

本文链接：https://blog.csdn.net/weixin_44970602/article/details/114272241

版权

PAT (Advanced Level) Practice 专栏收录该内容

85 篇文章 1 订阅

订阅专栏

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 (≤10
4
) 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
Author
CHEN, Yue
Organization
浙江大学
Code Size Limit
16 KB
Time Limit
2000 ms
Memory Limit
64 MB

先用并查集统计连通块数量（使用DFS统计亦可）
dfs一次找到最深的根节点，再从其中一个根节点dfs一次，两次结果的并集即为所求，原理懒得看

#include<bits/stdc++.h>
using namespace std;
const int maxv=10010;
vector<int> Adj[maxv];
int father[maxv];
int isRoot[maxv]={false},vis[maxv]={false};
int n,maxH=0;
vector<int> temp;
set<int> ans;
int findFather(int x){
    int a=x;
    while(x!=father[x]) x=father[x];
    while(a!=father[a]){
        father[a]=x;
        a=father[a];
    }
    return x;
}
void Union(int a,int b){
    int faA=findFather(a);
    int faB=findFather(b);
    if(faA!=faB) father[faA]=faB;
}
void init(){
    for(int i=1;i<=n;++i){
        father[i]=i;
    }
}
void DFS(int u,int hight){
    if(hight>maxH){
        temp.clear();
        temp.push_back(u);
        maxH=hight;
    }else if(hight==maxH){
        temp.push_back(u);
    }
    vis[u]=true;
    for(int i=0;i<Adj[u].size();++i){
        if(vis[Adj[u][i]]==false)
            DFS(Adj[u][i],hight+1);
    }
}
int main(){
    scanf("%d",&n);
    int a,b;
    for(int i=0;i<n-1;++i){
        scanf("%d%d",&a,&b);
        Adj[a].push_back(b);
        Adj[b].push_back(a);
    }
    init();
    for(int i=1;i<=n;++i){
        for(int j=0;j<Adj[i].size();++j){
            int u=i,v=Adj[i][j];
            Union(u,v);
        }
    }
    int block=0;
    for(int i=1;i<=n;++i){
        int fa=findFather(i);
        if(!isRoot[fa]){
            isRoot[fa]=true;
            block++;
        }
    }
    if(block>1){
        printf("Error: %d components\n",block);
    }else{
        DFS(1,1);
        for(int i=0;i<temp.size();++i)
            ans.insert(temp[i]);
        temp.clear();
        memset(vis,false,sizeof(vis));
        DFS(*ans.begin(),1);
        for(int i=0;i<temp.size();++i)
            ans.insert(temp[i]);
        for(auto it=ans.begin();it!=ans.end();++it)
            printf("%d\n",*it);
    }
}