PAT (Advanced Level) Practise 1118 Birds in Forest (25)
来源:互联网 发布:看本子专业软件 编辑:程序博客网 时间:2024/06/03 20:52
1118. Birds in Forest (25)
Some scientists took pictures of thousands of birds in a forest. Assume that all the birds appear in the same picture belong to the same tree. You are supposed to help the scientists to count the maximum number of trees in the forest, and for any pair of birds, tell if they are on the same tree.
Input Specification:
Each input file contains one test case. For each case, the first line contains a positive number N (<= 104) which is the number of pictures. Then N lines follow, each describes a picture in the format:
K B1 B2 ... BK
where K is the number of birds in this picture, and Bi's are the indices of birds. It is guaranteed that the birds in all the pictures are numbered continuously from 1 to some number that is no more than 104.
After the pictures there is a positive number Q (<= 104) which is the number of queries. Then Q lines follow, each contains the indices of two birds.
Output Specification:
For each test case, first output in a line the maximum possible number of trees and the number of birds. Then for each query, print in a line "Yes" if the two birds belong to the same tree, or "No" if not.
Sample Input:43 10 1 22 3 44 1 5 7 83 9 6 4210 53 7Sample Output:
2 10YesNo
题意:给出n棵树每棵树有哪些鸟,一共问有多少棵树和多少只鸟,然后q次询问,问两只鸟判断是否在同一个树上
解题思路:并查集
#include <iostream> #include <cstdio> #include <cstring> #include <string> #include <algorithm> #include <cmath> #include <map> #include <set> #include <stack> #include <queue> #include <vector> #include <bitset> #include <functional> using namespace std; #define LL long long const int INF = 0x3f3f3f3f;int n,q,visit[10050],f[10050],k,x,y;int Find(int x){return f[x]==x?x:f[x]=Find(f[x]);}int main(){while(~scanf("%d",&n)){for(int i=1;i<=10000;i++) f[i]=i,visit[i]=0;for(int i=1;i<=n;i++){scanf("%d%d",&k,&x);visit[x]=1;int xx=Find(x);for(int j=2;j<=k;j++){scanf("%d",&y);visit[y]=1;int yy=Find(y);if(xx!=yy) f[yy]=xx;}}int sum1=0,sum2=0;for(int i=1;i<=10000;i++){if(visit[i]) sum1++;if(visit[i]&&f[i]==i) sum2++;}printf("%d %d\n",sum2,sum1);scanf("%d",&q);while(q--){scanf("%d%d",&x,&y);printf("%s\n",Find(x)==Find(y)?"Yes":"No");}}return 0;}
- PAT (Advanced Level) Practise 1118Birds in Forest (25)
- PAT (Advanced Level) Practise 1118 Birds in Forest (25)
- 【PAT】【Advanced Level】1118. Birds in Forest (25)
- PAT 1118 Birds in Forest (25)
- PAT 1118 Birds in Forest
- PAT (Advanced Level) Practise 1044 Shopping in Mars (25)
- PAT (Advanced Level) Practise 1082 Read Number in Chinese (25)
- PAT (Advanced Level) Practise 1082 Read Number in Chinese (25)
- PAT (Advanced Level) Practise 1044 Shopping in Mars (25)
- PAT(A) - 1118. Birds in Forest (25)
- 【PAT】1118. Birds in Forest (25)
- 1118. Birds in Forest (25) PAT 甲级
- PAT A1118 birds in forest (25)
- PAT-1118. Birds in Forest (25)
- PAT A1118. Birds in Forest (25)
- PAT 甲级 1118. Birds in Forest (25)
- [PAT] (Advanced Level) Practise
- PAT (Advanced Level) Practise
- perl 播放windows文件
- springmvc前端控制器中的配置项loadonstartup的作用
- 快乐数
- PAT 1069 微博转发抽奖
- 区块链技术概述
- PAT (Advanced Level) Practise 1118 Birds in Forest (25)
- 浅析angular,react,vue.js jQuery使用区别
- Android studio 创建本地文件时没有权限的怪现象
- idea javaweb项目导入标签库
- LeetCode 62. Unique Paths
- HDU 5412 CRB and Queries 整体二分
- 安装本地存在的包到maven中
- github提交代码无法改变远程仓库路径
- 系统调用实现Linux命令 ls -al