杭电 hdu 1083 Courses （二分匹配）

最新推荐文章于 2021-08-24 21:39:03 发布

原创最新推荐文章于 2021-08-24 21:39:03 发布 · 555 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#杭电

二分匹配专栏收录该内容

8 篇文章

订阅专栏

本文探讨了一个班级如何通过二分匹配算法解决课代表选举问题，确保每门课程都有唯一代表，并且每位学生仅担任一门课程的代表。

杭电 hdu 1083 Courses （二分匹配）

Courses

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

Problem 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

Your program should read sets of data from a text file. The first line of the input file 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'll 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.

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.

An example of program input and output:

Sample Input

Sample Output

  
   YES
NO

Source

Southeastern Europe 2000

Recommend

We have carefully selected several similar problems for you: 2444 1281 1045 1054 1533

题意：一个班级要进行没门课的课代表选举，课代表有几个要求
1：参见了那门课的上课
2：只能有一个课代表职务，不能多选
输入的第一行是T，代表有多少案例
接着是n，m，分别表示有多少门课，和多少个学生
然后是n行，
n行的第一个数字为t，表示后面有多少学生来上课，
然后让你求是否能够凑出没门课都有一个专门的课代表

题解：这也是一个很基础的二分匹配求最大匹配数，就是令课程为x，令学生为y，进行二分匹配

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <algorithm>

using namespace std;

const int maxn = 505;

int map[maxn][maxn];            //记录是否能匹配， 0表示不能，1表示能
int vis[maxn];               
int pri[maxn];                  //pri[i] = x,表示i学生当x课课代表
int n, m;

bool Find (int x){
    int i;

    for (i = 1; i <= m; ++i){
        if (!vis[i] && map[x][i]){        //进行查找
            vis[i] = 1;
            if (pri[i] == -1 || Find(pri[i])){        //匹配，是匹配尽量多
                pri[i] = x;
                return true;
            }
        }
    }
    return false;
}

int main (){
    int T, i, j, t, a, b;

    while (scanf ("%d", &T) != EOF){
        while (T--){

            memset (pri, -1, sizeof (pri));
            memset (map, 0, sizeof (map));
            scanf ("%d%d", &n, &m);
            for (i = 1; i <= n; ++i){
                scanf ("%d", &t);
                for (j = 1; j <= t; ++j){
                    scanf ("%d", &a);
                    map[i][a] = 1;
                }
            }
            int ant = 0;
            for (i = 1; i <= n; ++i){
                memset (vis, 0, sizeof (vis));
                if (Find(i))                 //查询最大匹配
                    ant++;
            }
            if (ant == n)
                printf ("YES\n");
            else
                printf ("NO\n");
        }
    }

    return 0;
}