# 1118 Birds in Forest （25 分)

=y）{p[x]=y；}返回；}boolistrue（inta，intb）｛returnfound（a）==found（b）；｝intmain（）｛intx，y；set＜int＞s；for（inti＝1；i＜＝10010；i++）｛p[i]＝i；｝scanf（“%d”，&n）；对于（inti=1；i˂=n；i++）{scanf（“%d”，&m）；对于（intj=1；j˂=m；j++）{scanf（”%d“，&a[j]）；s.insert（a[j]]）；}对于（intj=2；j˂=m；j++）{联合（a[j-1]，a[j]]）；}}intsum=s.size（）；set＜int＞ss；对于（inti=1；i˂=sum；i++）｛ss.insert（找到（i））；｝cout˂˂ss.size（）˂˂“”˂˂sum˂˂endl；扫描（“%d”，&k）；而（k--）{scanf（“%d%d”，&x，&y）；if（istrue（x，y））{cout˂˂“是”˂˂endl；}否则{cout˂˂“否”˂˂end l；}}返回0；}

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:

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
``````

```#include <bits/stdc++.h>
using namespace std;
int p;
int visit;
int a;
int n,m,k;
int found(int a)
{
if(a==p[a]){
return a;
}
return p[a]=found(p[a]);
}
void unite(int a,int b)
{
int x = found(a);
int y = found(b);
if(x!=y){
p[x] = y;
}
return ;
}
bool istrue(int a,int b){
return found(a) == found(b);
}
int main()
{
int x,y;
set<int> s;

for(int i=1;i<=10010;i++){
p[i] = i;
}
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&m);
for(int j=1;j<=m;j++)
{
scanf("%d",&a[j]);
s.insert(a[j]);
}
for(int j=2;j<=m;j++)
{
unite(a[j-1],a[j]);
}
}
int sum = s.size();
set<int> ss;
for(int i=1;i<=sum;i++)
{
ss.insert(found(i));
}
cout<<ss.size()<<" "<<sum<<endl;
scanf("%d",&k);
while(k--)
{
scanf("%d%d",&x,&y);
if(istrue(x,y)){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
}
return 0;
}```

## 相关文章

### HDU5783

HDU 5783 题意： 给出字符串 A 和 它的长度， 要求把 A 分成尽可能多的连续字串， 且每一段的每个前缀和都 >= 0 ; 答案保证存在。 解题：因为要求每一段的每个前缀和都大于等于 0 ，答案一定存在，所以就直接从后往前找，遇到一段满足条件的就算上，否则继续往前加，和用64位整数存（WA*1 ）= =。 #include<bits/...

### UVA 1482 Playing With Stones

(蓝书里有这个题貌似) 一言不合就打表，可以发现sg数组是个分形的，所以可以推出递推式： 1.x是偶数时，sg(x)=x/2 2.否则，sg(x)=sg(x/2) #include<iostream>#include<cstdio>#include<cstdlib>#include<algorithm>...

### 98描述 输入一个百分制的成绩M，将其转换成对应的等级，具体转换规则如下：90~100为A;80~89为B;70~79为C;60~69为D;0~59为E;输入 第一行是一个整数N，表示测试数据的组数(N&lt;10)

#include "stdio.h"int main(){int a,n;scanf("%d",&n);while(n--){ scanf("%d",&a);if(a>=90&&a<=100) printf("A\n");else if(a>=80&&a<=89) printf("B\n...

### 函数，拷贝（开了个玩笑，设了个张浩东）

#include<stdio.h>int n;void zhd(double a){scanf("%d",&n);for(int i=0;i<=n-1;i++){scanf("%lf",&a[i]);}}int main(){double b;zhd(b);for(int i=0;i<=n-...