zoukankan      html  css  js  c++  java
  • POJ 2239 二分图匹配/Hungary

    Selecting Courses
    Time Limit: 1000MS Memory Limit: 65536K
    Total Submissions: 8667 Accepted: 3863

    Description

    It is well known that it is not easy to select courses in the college, for there is usually conflict among the time of the courses. Li Ming is a student who loves study every much, and at the beginning of each term, he always wants to select courses as more as possible. Of course there should be no conflict among the courses he selects.

    There are 12 classes every day, and 7 days every week. There are hundreds of courses in the college, and teaching a course needs one class each week. To give students more convenience, though teaching a course needs only one class, a course will be taught several times in a week. For example, a course may be taught both at the 7-th class on Tuesday and 12-th class on Wednesday, you should assume that there is no difference between the two classes, and that students can select any class to go. At the different weeks, a student can even go to different class as his wish. Because there are so many courses in the college, selecting courses is not an easy job for Li Ming. As his good friends, can you help him?

    Input

    The input contains several cases. For each case, the first line contains an integer n (1 <= n <= 300), the number of courses in Li Ming's college. The following n lines represent n different courses. In each line, the first number is an integer t (1 <= t <= 7*12), the different time when students can go to study the course. Then come t pairs of integers p (1 <= p <= 7) and q (1 <= q <= 12), which mean that the course will be taught at the q-th class on the p-th day of a week.
    Output

    For each test case, output one integer, which is the maximum number of courses Li Ming can select.
    Sample Input

    5
    1 1 1
    2 1 1 2 2
    1 2 2
    2 3 2 3 3
    1 3 3

    Sample Output

    4
    Source

    POJ Monthly,Li Haoyuan

    <span style="color:#3333ff;">/**********************************************
            author    : Grant Yuan
            time      : 2014/9/20 16:32
            source    : POJ 2239
            algorithm : Hungary
    ***********************************************/
    
    #include<iostream>
    #include<cstdio>
    #include<algorithm>
    #include<cstring>
    #include<cstdlib>
    #include<cmath>
    #define MAX 310
    using namespace std;
    int match[MAX],mat[MAX][MAX];
    bool used[MAX];
    int n;
    
    bool dfs(int k)
    {
        for(int i=1;i<150;i++)
        {
           if(mat[k][i]&&!used[i])
          {
            used[i]=1;
            if(match[i]==-1||dfs(match[i]))
               {
                   match[i]=k;
                   return true;
               }
           }
        }
        return false;
    }
    
    int Hungary()
    {
        int res=0;
         for(int i=1;i<=n;i++)
         {
             memset(used,0,sizeof(used));
             if(dfs(i)) {res++;}
         }
         return res;
    }
    
    int main()
    {
        while(~scanf("%d",&n)){
            memset(match,-1,sizeof(match));
            memset(used,0,sizeof(used));
            memset(mat,0,sizeof(mat));
            for(int i=1;i<=n;i++)
            {
                int m;
                scanf("%d",&m);
                for(int j=1;j<=m;j++)
                {
                    int k1,k2;
                    scanf("%d%d",&k1,&k2);
                    mat[i][12*(k1-1)+k2]=1;
                }
            }
            int ans=Hungary();
            printf("%d
    ",ans);
        }
        return 0;
    }
    </span>


     

  • 相关阅读:
    3.17爸爸要回去了(之十一)
    爸爸丢了 (2013.3.10,确诊五天后,之十)
    Polyline转Polygon
    将一个应用程序添加做成windows服务
    找个输入IPoint在某个FeatureClass上距离最近的要素
    线程间操作无效: 从不是创建控件“label4”的线程访问它。
    删除文件夹下的文件和文件夹
    int组成时间值
    CRONTAB
    NFS
  • 原文地址:https://www.cnblogs.com/codeyuan/p/4254434.html
Copyright © 2011-2022 走看看