POJ1469 COURSES 【二分图最大匹配·HK算法】

最新推荐文章于 2023-02-26 12:07:16 发布

长风Qiu

最新推荐文章于 2023-02-26 12:07:16 发布

阅读量2k

点赞数

文章标签： POJ1469

本文链接：https://blog.csdn.net/chang_mu/article/details/39969261

版权

博客介绍了POJ1469问题，该问题涉及在P门课和N个学生间寻找最大匹配，每个学生可选多门课。文章提到了匈牙利算法作为解决方案，但重点推荐了HK算法，因其时间复杂度更低。作者在尝试HK算法时感受到了实现的复杂性。

摘要由CSDN通过智能技术生成

COURSES

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 17777		Accepted: 7007

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