杭电1068--Girls and Boys（二分图最大独立集）

Girls and Boys

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

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

Southeastern Europe 2000

 

 

Recommend

JGShining   |   We have carefully selected several similar problems for you:  1150 1151 1281 1507 1528 

二分图最大独立集 = 顶点数 - 最大匹配数。 

本题从整个点集搜索 、并没有将点集分开，相当于搜索了两遍。 所以最大匹配数要除以二。

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int map[1010][1010], dis[1010], vis[1010];
int n;
bool Dfs(int a)
{
    for(int i = 0; i < n; i++)
    {
        if(map[a][i] && !vis[i])
        {
            vis[i] = 1;
            if(!dis[i] || Dfs(dis[i]))
            {
                dis[i] = a;
                return true;
            }
        }
    }
    return false;
}
int main()
{
    int q, m, GG; 
    while(~scanf("%d", &n)) 
    {
        memset(map, 0, sizeof(map));
        memset(dis, 0, sizeof(dis));
        for(int i = 0; i < n; i++)
        {
            scanf("%d: (%d)", &q, &m);
            for(int i = 1; i <= m; i++)
            {
                scanf("%d", &GG);
                map[q][GG] = 1;
            }
        }
        int sum = 0;
        for(int i = 0; i < n; i++)
        {
            memset(vis, 0, sizeof(vis));
            if(Dfs(i))
                sum++;
        }
        printf("%d
", n - sum/2);
    }
    return 0;
}

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int map[1010][1010], dis[1010], vis[1010];
int n;
bool Dfs(int a)
{
    for(int i = 0; i < n; i++)
    {
        if(map[a][i] && !vis[i])
        {
            vis[i] = 1;
            if(!dis[i] || Dfs(dis[i]))
            {
                dis[i] = a;
                return true;
            }
        }
    }
    return false;
}
int main()
{
    int q, m, GG; 
    while(~scanf("%d", &n)) 
    {
        memset(map, 0, sizeof(map));
        memset(dis, 0, sizeof(dis));
        for(int i = 0; i < n; i++)
        {
            scanf("%d: (%d)", &q, &m);
            for(int i = 1; i <= m; i++)
            {
                scanf("%d", &GG);
                map[q][GG] = 1;
            }
        }
        int sum = 0;
        for(int i = 0; i < n; i++)
        {
            memset(vis, 0, sizeof(vis));
            if(Dfs(i))
                sum++;
        }
        printf("%d
", n - sum/2);
    }
    return 0;
}