zoukankan      html  css  js  c++  java
  • POJ1469_COURSES(二部图最大匹配)

    解决报告

    http://blog.csdn.net/juncoder/article/details/38136065

    题目传送门

    题意:

    n个学生p门课程,每一个学生学习0或1以上的课程。

    问:能否够组成委员会。满足

    每一个学生代表一门不同的课程

    一门课程在委员会中有一名代表

    思路:

    非常明显的二分图的完备匹配。

    #include <map>
    #include <queue>
    #include <vector>
    #include <cstdio>
    #include <cstring>
    #include <iostream>
    #define N 330
    #define P 110
    using namespace std;
    int mmap[N+P][N+P],n,p,pre[N+P],vis[N+P],m,k;
    int dfs(int x)
    {
        for(int i=p+1;i<=p+n;i++)
        {
            if(!vis[i]&&mmap[x][i])
            {
                vis[i]=1;
                if(pre[i]==-1||dfs(pre[i]))
                {
                    pre[i]=x;
                    return 1;
                }
            }
        }
        return 0;
    }
    int main()
    {
        int i,j,t;
        while(~scanf("%d",&t))
        {
            while(t--)
            {
                memset(mmap,0,sizeof(mmap));
                memset(pre,-1,sizeof(pre));
                scanf("%d%d",&p,&n);
                for(i=1;i<=p;i++)
                {
                    scanf("%d",&m);
                    for(j=1;j<=m;j++)
                    {
                        scanf("%d",&k);
                        mmap[i][k+p]=1;
                    }
                }
                int ans=0;
                for(i=1;i<=p;i++)
                {
                    memset(vis,0,sizeof(vis));
                    ans+=dfs(i);
                }
                if(ans==p)
                printf("YES
    ");
                else printf("NO
    ");
            }
        }
        return 0;
    }
    

    COURSES
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 17166   Accepted: 6748

    Description

    Consider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a committee of exactly P students that satisfies simultaneously the conditions: 

    • every student in the committee represents a different course (a student can represent a course if he/she visits that course) 
    • each course has a representative in the committee 

    Input

    Your program should read sets of data from the std input. The first line of the input contains the number of the data sets. Each data set is presented in the following format: 

    P N 
    Count1 Student1 1 Student1 2 ... Student1 Count1 
    Count2 Student2 1 Student2 2 ... Student2 Count2 
    ... 
    CountP StudentP 1 StudentP 2 ... StudentP CountP 

    The first line in each data set contains two positive integers separated by one blank: P (1 <= P <= 100) - the number of courses and N (1 <= N <= 300) - the number of students. The next P lines describe in sequence of the courses �from course 1 to course P, each line describing a course. The description of course i is a line that starts with an integer Count i (0 <= Count i <= N) representing the number of students visiting course i. Next, after a blank, you抣l find the Count i students, visiting the course, each two consecutive separated by one blank. Students are numbered with the positive integers from 1 to N. 
    There are no blank lines between consecutive sets of data. Input data are correct. 

    Output

    The result of the program is on the standard output. For each input data set the program prints on a single line "YES" if it is possible to form a committee and "NO" otherwise. There should not be any leading blanks at the start of the line.

    Sample Input

    2
    3 3
    3 1 2 3
    2 1 2
    1 1
    3 3
    2 1 3
    2 1 3
    1 1

    Sample Output

    YES
    NO

    Source



    版权声明:本文博主原创文章,博客,未经同意不得转载。

  • 相关阅读:
    perl 获取铜板街页码
    $response->decoded_content 和$response->content
    基于Netty5.0高级案例之请求响应同步通信
    [Err] 1091
    [Err] 23000
    [Err] 42000
    perl 爬取 find_by_tag_name
    perl 爬取html findvalues 方法
    perl 安装DBI和DBD
    js setTimeout 参数传递使用介绍
  • 原文地址:https://www.cnblogs.com/yxwkf/p/4853546.html
Copyright © 2011-2022 走看看