zoukankan      html  css  js  c++  java
  • poj--2239--Selecting Courses(最大匹配)

    Selecting Courses
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 9782   Accepted: 4400

    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
    
    
    
    
    #include<stdio.h>
    #include<string.h>
    #include<algorithm>
    using namespace std;
    int map[400][10][20];
    int used[10][20],pipei[10][20];
    int find(int x)
    {
    	for(int i=1;i<=7;i++)
    	{
    		for(int j=1;j<=12;j++)
    		{
    			if(!used[i][j]&&map[x][i][j])
    			{
    				used[i][j]=1;
    				if(!pipei[i][j]||find(pipei[i][j]))
    				{
    					pipei[i][j]=x;
    					return 1;
    				}
    			}
    		}
    	}
    	return 0;
    }
    int main()
    {
    	int n;
    	while(scanf("%d",&n)!=EOF)
    	{
    		memset(map,0,sizeof(map));
    		memset(pipei,0,sizeof(pipei));
    		for(int i=1;i<=n;i++)
    		{
    			int t;
    			scanf("%d",&t);
    			while(t--)
    			{
    				int x,y;
    				scanf("%d%d",&x,&y);
    				map[i][x][y]=1;
    			}
    		}
    		int sum=0;
    		for(int i=1;i<=n;i++)
    		{
    			memset(used,0,sizeof(used));
    			sum+=find(i);
    		}
    		printf("%d
    ",sum);
    	}
    	return 0;
    }


  • 相关阅读:
    IOS中延迟执行的几种方法
    Xcode6中如何去掉默认的Main.storyboard
    IOS7.0 UILabel实现自适应高度的新方法
    UITabBarController常见代理方法的使用
    Infopath 2010 接收SQL Server数据
    olsr学习之一:Ubuntu10.04下ns2-allinone-2.34安装方法
    常用工具遇到的错误以及解决方法
    笔记本电脑选购个人的一些浅见
    嵌入式题目集锦
    关于网络传输字节顺序的问题: hton? or ntoh?
  • 原文地址:https://www.cnblogs.com/playboy307/p/5273495.html
Copyright © 2011-2022 走看看