• poj 1469 COURSES(匈牙利算法模板)


    http://poj.org/problem?id=1469

    COURSES
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 19419   Accepted: 7642

    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


    题目大意:

    一共有N个学生跟P门课程,一个学生可以任意选一

    门或多门课,问是否达成:

      1.每个学生选的都是不同的课(即不能有两个学生选同一门课)

      2.每门课都有一个代表(即P门课都被成功选过)

    输入为:

    P N(课程数跟学生数)

    接着有P行,格式为Count studenti studenti+1 ……studentcount

    (Count表示对课程1感兴趣的学生数,接着有Count个学生)

    如第一行3 1 2 3表示学生1跟学生2跟学生3对课程1感兴趣

    输出为:

    若能满足上面两个要求这输出”YES”,否则为”NO”

    #include <stdio.h>
    #include <string.h>
    #include <math.h>
    #include <stdlib.h>
    #define INF 0x3f3f3f3f
    #define N 310
    
    int G[N][N], vis[N], used[N];
    int n, p;
    
    bool Find(int u)
    {
        int i;
        for(i = 1 ; i <= n ; i++)
        {
            if(!vis[i] && G[u][i])
            {
                vis[i] = 1;
                if(!used[i] || Find(used[i]))
                {
                    used[i] = u;
                    return true;
                }
            }
        }
        return false;
    }
    
    int main()
    {
        int a, b, i, ans, t;
        scanf("%d", &t);
        while(t--)
        {
            scanf("%d%d", &p, &n);
            memset(G, 0, sizeof(G));
            ans = 0;
            for(i = 1 ; i <= p ; i++)
            {
                scanf("%d", &a);
                while(a--)
                {
                    scanf("%d", &b);
                    G[i][b] = 1;
                }
            }
            memset(used, 0, sizeof(used));
            for(i = 1 ; i <= p ; i++)
            {
                memset(vis, 0, sizeof(vis));
                if(Find(i))
                    ans++;
            }
            if(ans == p)
                printf("YES
    ");
            else
                printf("NO
    ");
        }
        return 0;
    }
  • 相关阅读:
    如何检查项目的需求是否完整
    Linux环境 Java内存快速查看
    字符串拼接性能比较出乎意料的结果
    MySQL 查看表大小
    五大机器学习微信公众号推荐
    如何用PYTHON代码写出音乐
    【转载】机器学习如门概览
    机器学习PAI为你自动写歌词,妈妈再也不用担心我的freestyle了(提供数据、代码)
    【转载】程序猿转型AI必须知道的几件事!
    如何拿到阿里算法校招offer
  • 原文地址:https://www.cnblogs.com/qq2424260747/p/4713748.html
Copyright © 2020-2023  润新知