• poj 1469 COURSES (二分匹配)


    COURSES
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 15975   Accepted: 6293

    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

     1 //288K    438MS    C++    936B    2013-11-10 20:34:48
     2 /*
     3     
     4     题意:
     5         有p门课和n个学生,每个学生只能选一门课,求每门课至少有一个学生的最大匹配 
     6     
     7     二分匹配:
     8         赤裸裸的二分图最大匹配,直接匈牙利模板 
     9          
    10 */
    11 #include<stdio.h>
    12 #include<string.h>
    13 int g[105][305];
    14 int match[305];
    15 int vis[305];
    16 int p,n;
    17 int dfs(int x)
    18 {
    19     for(int i=1;i<=n;i++){
    20         if(!vis[i] && g[x][i]){
    21             vis[i]=1;
    22             if(match[i]==-1 || dfs(match[i])){
    23                 match[i]=x;
    24                 return 1;
    25             }
    26         }
    27     }
    28     return 0;
    29 }
    30 void hungary()
    31 {
    32     memset(match,-1,sizeof(match));
    33     int ret=0;
    34     for(int i=1;i<=p;i++){
    35         memset(vis,0,sizeof(vis));
    36         ret+=dfs(i);
    37     }
    38     if(ret==p) puts("YES");
    39     else puts("NO");
    40 }
    41 int main(void)
    42 {
    43     int t,m,a;
    44     scanf("%d",&t);
    45     while(t--)
    46     {
    47         memset(g,0,sizeof(g));
    48         scanf("%d%d",&p,&n);
    49         for(int i=1;i<=p;i++){
    50             scanf("%d",&m);
    51             while(m--){
    52                 scanf("%d",&a);
    53                 g[i][a]=1;
    54             }
    55         }
    56         hungary();
    57     }
    58     return 0;
    59 } 
  • 相关阅读:
    springMVC入门
    【终极指南】图文详解Chrome插件离线安装方法
    IDM下载器使用方法详解:百度网盘下载,视频会员一网打尽!
    Mac下复制粘贴的快捷键是什么?随记
    华为手机维修点查询终于上线了
    如何将已经安装从chrome扩展程序导出备份为.CRX文件?
    Chrome浏览器 v68.0.3440.106 正式版怎么样?
    Postman插件如何安装
    分享一款非常好用的Fatkun图片批量下载工具
    上海苹果维修点分享苹果电脑MACBOOK故障维修常见案例
  • 原文地址:https://www.cnblogs.com/GO-NO-1/p/3417038.html
Copyright © 2020-2023  润新知