zoukankan      html  css  js  c++  java
  • (并查集)How Many Tables

    Today is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each other, and all the friends do not want to stay with strangers.

    One important rule for this problem is that if I tell you A knows B, and B knows C, that means A, B, C know each other, so they can stay in one table.

    For example: If I tell you A knows B, B knows C, and D knows E, so A, B, C can stay in one table, and D, E have to stay in the other one. So Ignatius needs 2 tables at least.

    Input

    The input starts with an integer T(1<=T<=25) which indicate the number of test cases. Then T test cases follow. Each test case starts with two integers N and M(1<=N,M<=1000). N indicates the number of friends, the friends are marked from 1 to N. Then M lines follow. Each line consists of two integers A and B(A!=B), that means friend A and friend B know each other. There will be a blank line between two cases. 

    Sample Input

    2 
    
    5 3 
    1 2
    2 3
    4 5
    
    5 1 
    2 5

    Sample Output

    2 
    4
    #include <stdio.h>
    int rankk[1001];
    int F[1001];
    int findd(int n)
    {
        int root=n;
        while(root!=F[root])
            root=F[root];
        return root;
    }
    void unionn(int x,int y)
    {
        int root1,root2;
        root1=findd(x);
        root2=findd(y);
        if(root1!=root2)
               F[root1]=root2;
    }
    int main()
    {
        int m,n,i,x,y,t;
        scanf("%d",&t);
        while(t--)
        {
            int s=0;
            scanf("%d%d",&n,&m);
            for(i=1;i<=n;i++)
                F[i]=i;
            for(i=1;i<=m;i++)
            {
                scanf("%d%d",&x,&y);
                unionn(x,y);
            }
            for(i=1;i<=n;i++)
                if(F[i]==i)
                    s++;
            printf("%d
    ",s);
        }
        return 0;
    }
    
    
  • 相关阅读:
    当前日期减去TIMESTAMP(6)日期
    java 对象之间的复制
    根据用户编码分组。根据日期倒序排序只取其中一条
    最大权闭合子图
    CodeForces-1082E Increasing Frequency
    CodeForces-1082D Maximum Diameter Graph
    HDU 6446 -- Tree and Permutation
    python学习之函数(二)
    python学习之函数(一)
    python学习之文件操作
  • 原文地址:https://www.cnblogs.com/zcy19990813/p/9702792.html
Copyright © 2011-2022 走看看