zoukankan      html  css  js  c++  java
  • Courses(最大匹配)

    Courses

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


    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
    题解:选课,每门课程至少有一个学生;
    代码:
     1 #include<cstdio>
     2 #include<iostream>
     3 #include<cmath>
     4 #include<cstring>
     5 #include<algorithm>
     6 #include<vector> 
     7 #define mem(x,y) memset(x,y,sizeof(x))
     8 using namespace std;
     9 const int INF=0x3f3f3f3f;
    10 const int MAXN=350;
    11 vector<int>vec[MAXN];
    12 int usd[MAXN],vis[MAXN];
    13 bool dfs(int x){
    14     for(int i=0;i<vec[x].size();i++){
    15         int v=vec[x][i];
    16             if(!vis[v]){
    17                 vis[v]=1;
    18             if(!usd[v]||dfs(usd[v])){
    19                 usd[v]=x;return true;
    20             }
    21         }
    22     }
    23     return false;
    24 }
    25 int main(){
    26     int T,P,N,t,a;
    27     scanf("%d",&T);
    28     while(T--){
    29         mem(usd,0);
    30         mem(vis,0);
    31         for(int i=0;i<MAXN;i++)vec[i].clear();
    32         scanf("%d%d",&P,&N);
    33         for(int i=1;i<=P;i++){
    34             scanf("%d",&t);
    35             while(t--){
    36                 scanf("%d",&a);
    37                 vec[i].push_back(a);
    38             }
    39         }
    40         int ans=0;
    41         for(int i=1;i<=P;i++){
    42             mem(vis,0);
    43             if(dfs(i))ans++;
    44         }
    45         if(ans==P)puts("YES");//应该是等于P的 
    46         else puts("NO");
    47     }
    48     return 0;
    49 }
  • 相关阅读:
    (待续)【转载】 Deep Reinforcement Learning Doesn't Work Yet(这里有一篇深度强化学习劝退文)
    【转载】 深度强化学习走入「死胡同」,继续死磕电子游戏还是另辟蹊径?
    【转载】 Docker-关于docker cpu的限制后,实际效果的研究
    个人常用的 matplotlib 绘图模板
    【转载】共轭梯度法(视频讲解) 数值分析6(3共轭梯度法) ——苏州大学
    【转载】 向量,标量对向量求导数
    【转载】 Linux Hang Task 简介
    AOC U2790PC对比上一代的AOC U2790PQU怎么样?
    屏幕ppi
    ubuntu杀死进程
  • 原文地址:https://www.cnblogs.com/handsomecui/p/4957404.html
Copyright © 2011-2022 走看看