zoukankan      html  css  js  c++  java
  • HDU1068 二分匹配 独立集

                                    前边和后边性别不同!!!不然NP了


                                   Girls and Boys

    Problem Description

    the second year of the university somebody started a study on the romantic relations between the students. The relation “romantically involved” is defined between one girl and one boy. For the study reasons it is necessary to find out the maximum set satisfying the condition: there are no two students in the set who have been “romantically involved”. The result of the program is the number of students in such a set.

    The input contains several data sets in text format. Each data set represents one set of subjects of the study, with the following description:

    the number of students
    the description of each student, in the following format
    student_identifier:(number_of_romantic_relations) student_identifier1 student_identifier2 student_identifier3 ...
    or
    student_identifier:(0)

    The student_identifier is an integer number between 0 and n-1, for n subjects.
    For each given data set, the program should write to standard output a line containing the result.

     
    Sample Input
    7 0: (3) 4 5 6 1: (2) 4 6 2: (0) 3: (0) 4: (2) 0 1 5: (1) 0 6: (2) 0 1 3 0: (2) 1 2 1: (1) 0 2: (1) 0
     
    Sample Output
    5 2
     
    Source

    
    
    #include<cstdio>
    #include<cstdlib>
    #include<cstring>
    #include<iostream>
    #include<string>
    #include<memory.h>
    #include<algorithm>
    #include<map>
    #include<queue>
    using namespace std;
    int Map[1010][1010];
    int used[1010],linke[1010];
    int s,t,n;
    int _S(){
        char c=getchar();
        while(c>'9'||c<'0') c=getchar();
        int num=0;
        while(c<='9'&&c>='0') {
            num=num*10+c-'0';
            c=getchar();
        }
        return num;
    }
    bool _find(int v)
    {
        for(int i=1;i<=n;i++){
            if(Map[v][i]&&!used[i])
             {
                  used[i]=1;
                  if((linke[i]==-1)||_find(linke[i])){
                    linke[i]=v;
                    return true;
                  }
             }
        }
        return false;
    }
    int main()
    {
        int m,i,j,ans=0,tmp;
        while(~scanf("%d",&n)){
            ans=0;
            memset(linke,-1,sizeof(linke));
            memset(Map,0,sizeof(Map));
            for(int d=1;d<=n;d++){
              s=_S();
              tmp=_S();
              for(i=1;i<=tmp;i++){
                t=_S();
                Map[s+1][t+1]=1;
              }
            }
            
            for(i=1;i<=n;i++){
                memset(used,0,sizeof(used));
                if(_find(i)) ans++;
            }
            
            cout<<n-ans/2<<endl;
        }
        return 0;
    }
     
    
    
    
     
    It is your time to fight!
  • 相关阅读:
    Linux配置——Linux服务器搭建Nexus-Maven私服(适合新手比较基础)
    maven配置——Maven3版本的超级POM位置及中央仓库位置
    CentOS7使用——使用命令连接网络配置
    H5页面开发流程
    在Sublime Text 3上集成JSHint检查
    如何快速开发符合规范的web页
    Talking about your future
    Healthy living
    谈论较受欢迎的电影类型
    谈论电视节目
  • 原文地址:https://www.cnblogs.com/hua-dong/p/7603922.html
Copyright © 2011-2022 走看看