- 编程题
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:
4
3 10 1 2
2 3 4
4 1 5 7 8
3 9 6 4
2
10 5
3 7
Sample Output:
2 10
Yes
No
题目大意:给出每棵树上的小鸟编号,求一共有几棵树和几只小鸟。给出每两个小鸟编号,求问他们是否在同一棵树上。
题解1:
思路:并查集。
将每棵树上的小鸟合并。最后数一下有几棵树。根据每只小鸟的book值可以知道两只小鸟是否在同一棵树上。
注意事项:曾经以为所有并查集最后都要重新更新一下父亲值才能进行统计,后来发现可以一边更新一边统计。
1.先更新再统计:
for (i = 1; i <= bmax; i++)
getfather(i) ;
for (i = 1; i <= bmax; i++)
if (book[i] == i)tmax++;
2.一边更新一边统计:
for (i = 1; i <= bmax; i++)
if (getfather(i) == i)tmax++;
源代码1:
#include<iostream>
#include<algorithm>
#include<stdlib.h>
#include<vector>
using namespace std;
int book[10001];
int getfather(int x)
{
if (x == book[x])return x;
else return book[x] = getfather(book[x]);
}
void merge(int x, int y)
{
int fx, fy;
fx = getfather(x);
fy = getfather(y);
book[fx] = fy;
return;
}
int main()
{
int n, k, i, j,tmax=0,bmax=0,b1,b2;
for (i = 1; i <= 10000; i++)book[i] = i;
scanf("%d", &n);
for (i = 1; i <= n; i++)
{
scanf("%d %d", &k, &b1);
if (b1 > bmax)bmax = b1;
for (j = 1; j < k; j++)
{
scanf("%d", &b2);
if (b2 > bmax)bmax = b2;
merge(b1, b2);
}
}
for (i = 1; i <= bmax; i++)
{
if (getfather(i) == i)tmax++;
}
printf("%d %d\n", tmax, bmax);
scanf("%d", &k);
for (j = 0; j < k; j++)
{
scanf("%d %d", &b1,&b2);
if (book[b1] == book[b2])printf("Yes\n");
else printf("No\n");
}
system("pause");
return 0;
}