zoukankan      html  css  js  c++  java
  • PAT 1118 Birds in Forest

    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 (≤10^​4​​ ) which is the number of pictures. Then N lines follow, each describes a picture in the format:

    K B​1 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 (≤10^4 ) 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<iostream> //并查集
    #include<math.h>
    #include<vector> 
    using namespace std;
    vector<int> birds(10010, 0), check(10010, 0);
    int findfather(int b){
      int t=b;
      while(birds[b]!=b)
        b=birds[b];
      while(birds[t]!=b){
        int temp=t;
        t=birds[t];
        birds[temp]=b;
      }
      return b;
    }
    void Union(int a, int b){
      int m= findfather(a);
      int n= findfather(b);
      if(m!=n) birds[m]=n;
    }
    int main(){
      int n, k, b, num=0, cnt=0, qn;
      cin>>n;
      vector<int> picture(n, 0);
      for(int i=0; i<10010; i++)
        birds[i]=i;
      for(int i=0; i<n; i++){
        cin>>k;
        for(int j=0; j<k; j++){
          cin>>b;
          num=max(num, b);
          if(picture[i]==0)
            picture[i]=b;
          Union(b, picture[i]);
        }
      }
      for(int i=1; i<=num; i++){
        b=findfather(i);
        if(check[b]==0){
          cnt++;
          check[b]=1;
        }
      }
      cout<<cnt<<" "<<num<<endl;
      cin>>qn;
      for(int i=0; i<qn; i++){
        int a, b;
        cin>>a>>b;
        if(findfather(a)==findfather(b))
          cout<<"Yes"<<endl;
        else
          cout<<"No"<<endl;
      }
      return 0;
    }
    
  • 相关阅读:
    Sliverlight常见错误集锦
    Excel公式使用
    Slider绑定事件,初始化NullPointerException错误
    修改VS 2012调试默认浏览器
    Silverlight界面设计
    you can't add a reference to Newtonsoft.Json.dll as it was not built against the silverlight runtime
    安装 ArcGISAPI31forSilverlight an i/o error occured while installing a file错误解决
    关于无法进入电子科大信息门户的相关问题研究
    HDU 1878 欧拉回路
    POJ 2492 A Bug's Life
  • 原文地址:https://www.cnblogs.com/A-Little-Nut/p/9502064.html
Copyright © 2011-2022 走看看