zoukankan      html  css  js  c++  java
  • hdoj 1213

    How Many Tables

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 41138    Accepted Submission(s): 20555


    Problem Description
    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.
     
    Output
    For each test case, just output how many tables Ignatius needs at least. Do NOT print any blanks.
     
    Sample Input
    2 5 3 1 2 2 3 4 5 5 1 2 5
     
    Sample Output
    2 4
     1 #include<cstdio>
     2 using namespace std;
     3 const int maxn=1006;
     4 int fa[maxn];
     5 bool flag[maxn];
     6 int n,m;
     7 
     8 int find_fa(int op)
     9 {
    10     if(fa[op]==op) return op;
    11     return fa[op]=find_fa(fa[op]);
    12 }
    13 
    14 int main()
    15 {
    16     int T;
    17     while( ~scanf("%d",&T)){
    18         while(T--){
    19             scanf("%d%d",&n,&m);
    20             for(int i=1;i<=n;i++){
    21                 fa[i]=i;
    22                 flag[i]=false;
    23             }
    24 
    25             for(int i=1;i<=m;i++){
    26                 int x,y;
    27                 scanf("%d%d",&x,&y);
    28                 int opx,opy;
    29                 opx=find_fa(x);
    30                 opy=find_fa(y);
    31                 if(opx<=opy)
    32                     fa[opy]=opx;
    33                 else
    34                     fa[opx]=opy;
    35             }
    36             int ans=0;
    37             for(int i=1;i<=n;i++){
    38                 int iop;
    39                 iop=find_fa(i);
    40                 if(!flag[iop]){
    41                     flag[iop]=true;
    42                     ans++;
    43                 }
    44             }
    45             printf("%d
    ",ans);
    46         }
    47     }
    48     return 0;
    49 }
  • 相关阅读:
    03 Spring框架 bean的属性以及bean前处理和bean后处理
    02 Spring框架 简单配置和三种bean的创建方式
    01 Spring框架 基本介绍
    Struts2学习---拦截器+struts的工作流程+struts声明式异常处理
    js 正则表达式
    HTTP中GET与POST的区别 (本质上是一样一样的TCP链接)
    微信商户平台的“企业付款到用户” 产品功能被隐藏起来了。。
    软件的安装及下载
    phpstorm 使用技巧
    Socket.io和Redis写Realtime App 之express初试
  • 原文地址:https://www.cnblogs.com/ZQUACM-875180305/p/9094197.html
Copyright © 2011-2022 走看看