神马作文网hdu acm 1083 看不懂题意
来源：学生作业帮 编辑：神马作文网作业帮 分类：英语作业 时间：2024/11/15 18:01:10
hdu acm 1083 看不懂题意
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
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
Consider a group of N students and P courses.
有N个学生,P门课
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:
你的任务是判断是否能可能P个学习符合下面的情况.
. 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
每一个课程都有学生参加.
解题报告：因为课程有P个,而且只选择P个学生,每一个学生加参的课程不同,而且每一门课都
有学生参加,这就是说有P个学生和这P门课一一对应,也就是最大二分匹配问题.
#include
#include
int cours[101];
int stu[301];
int adj[101][301];
int m[301];
int p,n;
int DFS(int from)
{
int i;
for(i=1;i
有N个学生,P门课
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:
你的任务是判断是否能可能P个学习符合下面的情况.
. 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
每一个课程都有学生参加.
解题报告：因为课程有P个,而且只选择P个学生,每一个学生加参的课程不同,而且每一门课都
有学生参加,这就是说有P个学生和这P门课一一对应,也就是最大二分匹配问题.
#include
#include
int cours[101];
int stu[301];
int adj[101][301];
int m[301];
int p,n;
int DFS(int from)
{
int i;
for(i=1;i