pat 1118. Birds in Forest (25) 并查集
来源:互联网 发布:七天网络查分平台登陆 编辑:程序博客网 时间:2024/06/11 18:26
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
#include <cstdio>#include <algorithm>#include <cstring>#include <iostream>#include <map>#include <set>using namespace std;int N, Q;int f[10005], a[10005];int maxn, minn;set<int> s;int getf(int x) {return f[x] == x ? x : f[x] = getf(f[x]);}int main(){cin >> N;for (int i = 1; i <= 10003; i++) {f[i] = i;}maxn = -1;for (int i = 0; i < N; i++) {int K;scanf("%d", &K);minn = 99999;for (int j = 0; j < K; j++) {scanf("%d", &a[j]);maxn = max(maxn, a[j]);minn = min(minn, a[j]);}for (int j = 0; j < K; j++) {f[getf(a[j])] = getf(minn); //debug f[a[j]] -> f[getf(a[j])]}}for (int i = 1; i <= maxn; i++) {s.insert(getf(i));}printf("%d %d\n", s.size(), maxn);cin >> Q;while (Q--) {int x, y;scanf("%d%d", &x, &y);if (getf(x) == getf(y)) {puts("Yes");}else {puts("No");}}return 0;}
- PAT - 甲级 - 1118. Birds in Forest (25) (并查集)
- pat 1118. Birds in Forest (25) 并查集
- PAT 1118. Birds in Forest (25) 并查集
- PAT--1118. Birds in Forest(并查集)
- pat甲1118. Birds in Forest(并查集)
- PAT A1118. Birds in Forest (25)(并查集)
- 1118. Birds in Forest (25)-PAT甲级真题(并查集)
- 1118. Birds in Forest (25) 并查集
- 1118. Birds in Forest (25) (并查集,注意顺序)
- 1118. Birds in Forest (25)[并查集]
- 1118. Birds in Forest (25) <并查集+set>
- PAT(A) - 1118. Birds in Forest (25)
- 【PAT】1118. Birds in Forest (25)
- 1118. Birds in Forest (25) PAT 甲级
- PAT-1118. Birds in Forest (25)
- PAT 甲级 1118. Birds in Forest (25)
- 【PAT】1118. Birds in Forest
- pat 1118. Birds in Forest
- 存储过程的优缺点
- springMVC事务回滚
- js时间戳(时间格式转换)
- 编程范式
- 使用React Native 实现自定义Dialog
- pat 1118. Birds in Forest (25) 并查集
- 一个例子,序列化与反序列化
- do{...}while(0)的意义和用法
- 体验异步的终极解决方案-ES7的Async/Await
- Number()
- 前端移动端开发头部标签
- Android下ListView使用
- HashMap中的equals()方法
- Cinder命令行使用文档