hdu 1083 Courses

真·最大二分匹配写法。

跟着自己思路写的比标准写法复杂太多了。

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 
  
  
  
  

   
    
  
  
  
  

   
   //-------------------------------
  
  
  
  

   
   刚开始一直TLE，其实是有个关键地方没剪枝，看了陈先生的代码才知道。
  
  
  
  

   
   就是说找某个左点的增广路途中，如果扫描到某个右点无法增广，那接下去遇到这个点时就跳过。
  
  
  
  

   
   那有没有可能这个右点原来无法增广但到后来变得可以增广了呢？
  
  
  
  

   
   那可以这样想：怎么把一个右点从可以增广变得无法增广？把增广路的后面弄掉一段嘛，就是标记啊什么。
  
  
  
  

   
   后面那一段是能增广的，那把后面那一段标记掉这个过程中肯定找到了一条增广路，就不会再扫描下去更不会又遇到这个右点了。
  
  
  
  

   
   依旧拙劣的表达。。。。。。希望以后自己看时仍能理解。
  
  
  
  

   
   #include<iostream>
#include<vector>
using namespace std;
int P,N;
vector<int> link[100];
int mark[301];
bool nmark[301]={0};
void get_link(){
    int i,n,t;
    for(i=0;i<P;i++){
        scanf("%d",&n);
        while(n--){
            scanf("%d",&t);
            link[i].push_back(t);
        }
    }
}
bool broader(int x){
    int i,s=link[x].size();
    for(i=0;i<s;i++){
        if(nmark[link[x][i]])continue;//如果右点被扫描过就跳过
        nmark[link[x][i]]=1;//否则标记
        if(mark[link[x][i]]==-1||broader(mark[link[x][i]])){
            //如果右点没连的点或者右点能增广
            mark[link[x][i]]=x;//那就增广，也就是把右点跟左点相连
            return 1;
        }
    }
    return 0;
}
bool go(){
    int i,count=P;
    memset(mark,-1,sizeof(mark));
    for(i=0;i<P;i++){
        memset(nmark,0,sizeof(nmark));
        if(!broader(i))return 0;
    }
    return 1;
}
void clear(){
    int i;
    for(i=0;i<P;i++)
        link[i].clear();
}
int main(){
    int t;
    scanf("%d",&t);
    while(t--){
        scanf("%d%d",&P,&N);
        get_link();
        if(!go())printf("NO/n");
        else printf("YES/n");
        clear();
    }
    return 0;
}