zoukankan      html  css  js  c++  java
  • poj1469

    COURSES
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 20672   Accepted: 8159

    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

    Source

    #include<cstdio>
    #include<cstring>
    #include<iostream>
    using namespace std;
    #define N 310
    int e[N][N],vis[N],match[N];
    int n,m,t,ans;
    int dfs(int u){
        for(int i=1;i<=m;i++){
            if(e[u][i]&&!vis[i]){
                vis[i]=1;
                if(!match[i]||dfs(match[i])){
                    match[i]=u;
                    return 1;
                }
            }
        }
        return 0;
    }
    int main(){
        scanf("%d",&t);
        while(t--){
            memset(e,0,sizeof e);
            memset(vis,0,sizeof vis);
            memset(match,0,sizeof match);
            ans=0;
            scanf("%d%d",&n,&m);
            for(int i=1;i<=n;i++){
                int x,y;
                scanf("%d",&x);
                for(int j=1;j<=x;j++){
                    scanf("%d",&y);
                    e[i][y]=1;
                }
            }
            for(int i=1;i<=n;i++){
                memset(vis,0,sizeof vis);
                if(dfs(i)) ans++;
            }
            printf("%s
    ",ans==n?"YES":"NO");
        }
        return 0;
    }
  • 相关阅读:
    Kprobes—insight into the Linux kernel—replace kernel function with module
    Go将统治下一个十年
    linux—网络仿真开源软件—network simulator—ns
    Serval Project——Android
    CentOS7—Firefox—截图工具—fireshot插件
    Wi-Fi Direct技术
    国产CPU迷局 龙芯该如何参与市场竞争
    《深入理解Android:Wi-Fi,NFC和GPS》—android源码下载
    wifi direct—深入理解Wi-Fi P2P
    c语言学习基础:[1]开发工具介绍
  • 原文地址:https://www.cnblogs.com/shenben/p/5633380.html
Copyright © 2011-2022 走看看