zoukankan      html  css  js  c++  java
  • Hdu 1083 Courses

    Courses

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

    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

    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 

    #include<stdio.h>
    #include<string.h>
    #define M 301int P,N;
    bool course[M][M],used[M];
    int match[M];
    int dfs(int k)
    {
        int i,temp;
        for(i=1;i<=N;i++)
        {
            if(course[k][i]&&!used[i])
            {
                used[i]=1;
                temp=match[i];
                match[i]=k;
                if(temp==-1||dfs(temp))
                return 1;
                match[i]=temp;
            }
        }
        return 0;
    }
    int Match()
    {
        int i,matchnum=0;
        memset(match,-1,sizeof(match));
        for(i=1;i<=P;i++)
        {
            memset(used,0,sizeof(used));
            if(dfs(i))matchnum++;
            if(matchnum==P)break;
        }
        return matchnum;
    }
    int main()
    {
        int i,j,num,t,n;
        scanf("%d",&n);
        while(n--)
        {
            scanf("%d%d",&P,&N);
            memset(course,0,sizeof(course));
            for(i=1;i<=P;i++)
            {
                scanf("%d",&num);
                for(j=0;j<num;j++)
                {
                    scanf("%d",&t);
                    course[i][t]=1;
                }
            }
            if(Match()==P)printf("YES
    ");
            else printf("NO
    ");
        }
        return 0;
    }
    

      

  • 相关阅读:
    PHPExcel常用方法总结
    ThinkPHP多语言在分组下的用法!
    derby 的字符集
    最小化msn,skype到右下角(Win 7)
    用javascript控制 youtube动画,直接打开html会失败
    maven 的本地仓库
    excel读取csv的字符集问题
    在dos控制台显示utf8字符
    关于在php和mysql中日期型date,datetime,timestamp的使用
    用 java jar执行时的classpath的问题
  • 原文地址:https://www.cnblogs.com/zhangliu/p/7057849.html
Copyright © 2011-2022 走看看