zoukankan      html  css  js  c++  java
  • POJ 1274 The Perfect Stall

    The Perfect Stall
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 26514   Accepted: 11765

    Description

    Farmer John completed his new barn just last week, complete with all the latest milking technology. Unfortunately, due to engineering problems, all the stalls in the new barn are different. For the first week, Farmer John randomly assigned cows to stalls, but it quickly became clear that any given cow was only willing to produce milk in certain stalls. For the last week, Farmer John has been collecting data on which cows are willing to produce milk in which stalls. A stall may be only assigned to one cow, and, of course, a cow may be only assigned to one stall. 
    Given the preferences of the cows, compute the maximum number of milk-producing assignments of cows to stalls that is possible. 

    Input

    The input includes several cases. For each case, the first line contains two integers, N (0 <= N <= 200) and M (0 <= M <= 200). N is the number of cows that Farmer John has and M is the number of stalls in the new barn. Each of the following N lines corresponds to a single cow. The first integer (Si) on the line is the number of stalls that the cow is willing to produce milk in (0 <= Si <= M). The subsequent Si integers on that line are the stalls in which that cow is willing to produce milk. The stall numbers will be integers in the range (1..M), and no stall will be listed twice for a given cow.

    Output

    For each case, output a single line with a single integer, the maximum number of milk-producing stall assignments that can be made.

    Sample Input

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

    Sample Output

    4

    思路:入门题,只要套下模板就行了,忘了多组输入心态爆炸;
    #include<iostream>
    #include<cstring>
    #include<cstdio>
    using namespace std;
    const int M = 210;
    int n,m,vis[M],pre[M],g[M][M],k;
    int dfs(int u){
        for(int i=1;i<=m;i++){
            if(vis[i]==0&&g[u][i]){
                vis[i] = 1;
                if(pre[i]==0||dfs(pre[i])){
                    pre[i] = u;
                    return 1;
                }
            }
        }
        return 0;
    }
    int main(){
        int j;
        while(scanf("%d%d",&n,&m)!=EOF){
        memset(pre,0,sizeof(pre));
        memset(g,0,sizeof(g));
        for(int i=1;i<=n;i++){
            scanf("%d",&k);
            while(k--){
                scanf("%d",&j);
                g[i][j] = 1;
            }
        }
        int ans = 0;
        for(int i=1;i<=n;i++){
            memset(vis,0,sizeof(vis));
           if(dfs(i)){
                ans++;
            }
        }
        /*memset(vis,0,sizeof(vis));
        cout<<dfs(5)<<endl;*/
        printf("%d
    ",ans);
        }
        return 0;
    }
  • 相关阅读:
    关键字驱动测试方法
    File文件操作
    问题处理:类没有复制构造函数
    QTP问题修改:This run was performed on Internet Explorer 7.x without the required 'Enable Tabbed Browsing
    QTP:.net中写文件
    bat垃圾清理
    Lua安装与使用
    QTP:Flight账号及密码
    如何在VS2010中运行控制台程序时停留在控制台显示窗口
    QTP中Screen Recorder无内容,no movie is associated with the results.
  • 原文地址:https://www.cnblogs.com/kls123/p/7774477.html
Copyright © 2011-2022 走看看