zoukankan      html  css  js  c++  java
  • Girls and Boys-hdu 1068

    Girls and Boys

    Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 3260    Accepted Submission(s): 1405

    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
     
    题意:求最大独立集
    思路:二分图匹配
    #include<cstdio>
    #include<iostream>
    #include<algorithm>
    #include<cstring>
    #include<sstream>
    #include<cmath>
    #include<stack>
    #include<cstdlib>
    #include <vector>
    #include<queue>
    using namespace std;
    const int INF = 0x3f3f3f3f;
    const int maxn = 1e3+5;
    
    int pre[maxn];
    bool map[maxn][maxn],used[maxn];
    int n;
    
    int dfs(int u)
    {
        for(int v = 0;v < n; v++)
        {
            if(map[u][v] && used[v] == false)
            {
                used[v] = true;
                if(pre[v] == -1 || dfs(pre[v]))
                {
                    pre[v] = u;
                    return true;
                }
            }
        }
        return false;
    }
    int main()
    {
        while(~scanf("%d", &n))
        {
            memset(map,false,sizeof map);
            memset(pre,-1,sizeof pre);
            for(int i=0;i<n;i++)
            {
                int k,num;
                scanf("%d: (%d)",&k,&num);
                for(int j=0;j<num;j++)
                {
                    int r;
                    scanf("%d",&r);
                    map[k][r] = true;
                }
            }
            int sum = 0;
            for(int i = 0; i < n; i++)
            {
                memset(used,false,sizeof used);
                if(dfs(i))
                    sum++;
            }
            sum /= 2;
            printf("%d
    ",n-sum);
        }
    }
    View Code
     
  • 相关阅读:
    数据库三大范式
    sql 外键 on update cascade 和 on delete cascade 作用区别?
    Mybatis入门简版(二)
    Mybatis入门简版(一)
    Mybatis入门简版(补充)
    SQL中ON和WHERE的区别
    MySQL基础(五)常见运算符
    MySQL基础(四)常用函数
    MySQL基础(三)多表查询(各种join连接详解)
    MySQL基础(二)
  • 原文地址:https://www.cnblogs.com/smallhester/p/10313013.html
Copyright © 2011-2022 走看看