zoukankan      html  css  js  c++  java
  • POJ2239_Selecting Courses(二分图最大匹配)

    解题报告

    http://blog.csdn.net/juncoder/article/details/38154699

    题目传送门

    题意:

    每天有12节课。一周上7天,一门课在一周有多天上课。

    求一周最多上几节课。

    思路:

    把课程看成一个集合,上课的时间看成一个集合,二分图就出来了。

    #include <cstdio>
    #include <cstring>
    #include <iostream>
    
    using namespace std;
    int n,day[10][15],mmap[500][500],vis[500],cnt,pre[500];
    int dfs(int x)
    {
        for(int i=n+1;i<cnt;i++){
            if(!vis[i]&&mmap[x][i]){
                vis[i]=1;
                if(pre[i]==-1||dfs(pre[i])){
                    pre[i]=x;
                    return 1;
                }
            }
        }
        return 0;
    }
    int main()
    {
        int i,j,a,b,t;
        while(cin>>n){
            cnt=n+1;
            memset(mmap,0,sizeof(mmap));
            memset(day,0,sizeof(day));
            memset(pre,-1,sizeof(pre));
            for(i=1;i<=n;i++){
                cin>>t;
                for(j=1;j<=t;j++){
                    cin>>a>>b;
                    if(!day[a][b])
                    {
                        day[a][b]=cnt++;
                    }
                    mmap[i][day[a][b]]=1;
                }
            }
            int ans=0;
            for(i=1;i<=n;i++){
                memset(vis,0,sizeof(vis));
                ans+=dfs(i);
            }
            cout<<ans<<endl;
        }
        return 0;
    }
    

    Selecting Courses
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 8466   Accepted: 3769

    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

  • 相关阅读:
    矩阵乘法运算test
    c字符数组转整型【c语言复习1】
    (转载)JavaScript的那些书
    数据结构 排序算法
    (转载)给自己降降级你会发现一片广阔的天空
    Cocos2D简介
    JRE not compatible with workspace .class file compatibility: 1.7
    水晶报表问题,请高手指教。
    控件开发该如何入门?
    cnblogsDottext的FTB不生效,只是显示一个textarea标记,为什么呢?
  • 原文地址:https://www.cnblogs.com/bhlsheji/p/5113807.html
Copyright © 2011-2022 走看看