zoukankan      html  css  js  c++  java
  • poj-2239-Selecting Courses

    poj-2239-Selecting Courses

    Selecting Courses
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 10965   Accepted: 4931

    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
    17922277   2239 Accepted 752K 16MS G++ 768B 2017-12-05 19:06:53

    经典的二分图匹配问题。

    使用匈牙利算法。

    // poj-2239  
    #include <cstdio> 
    #include <cstring> 
    const int MAXN = 300 + 10; 
    
    int n, num[MAXN], course[MAXN][MAXN], vis[MAXN], match[MAXN]; 
    
    bool dfs(int x){
    	for(int i=0; i<num[x]; ++i){
    		int y = course[x][i]; 
    		if(vis[y] == 0){
    			vis[y] = 1; 
    			if(match[y] < 0 || dfs(match[y])){
    				match[y] = x; 
    				return true; 
    			}
    		}
    	}
    	return false; 
    }
    
    int main(){
    	freopen("in.txt", "r", stdin); 
    
    	int ans, p, q;  
    	while(scanf("%d", &n) != EOF){
    		for(int i=0; i<n; ++i){
    			scanf("%d", &num[i]); 
    			for(int j=0; j<num[i]; ++j){
    				scanf("%d %d", &p, &q); 
    				course[i][j] = (p - 1)*13 + q; 
    			} 
    		}
    		ans = 0; 
    		memset(match, -1, sizeof(match)); 
    
    		for(int i=0; i<n; ++i){
    			memset(vis, 0, sizeof(vis)); 
    			if(dfs(i)){
    				++ans; 
    			}
    		}
    		printf("%d
    ", ans );
    	}
    	return 0; 
    }
    

      

  • 相关阅读:
    Django基于form组件实现注册校验
    Django 框架概况
    【ARM】S5PV210芯片的启动流程
    【ARM】S3C6410芯片的启动流程
    Go's Declaration Syntax
    挺经
    软件系统最重要的一点
    Laravel 服务容器实例教程 —— 深入理解控制反转(IoC)和依赖注入(DI)
    你大概走了假敏捷:认真说说敏捷的实现和问题(手绘版)
    我的书单
  • 原文地址:https://www.cnblogs.com/zhang-yd/p/7988870.html
Copyright © 2011-2022 走看看