• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            bon

              C++博客 :: 首頁 :: 聯系 :: 聚合  :: 管理
              46 Posts :: 0 Stories :: 12 Comments :: 0 Trackbacks

            常用鏈接

            留言簿(2)

            我參與的團隊

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

             

            The Perfect Stall
            Time Limit: 1000MS Memory Limit: 10000K
            Total Submissions: 2136 Accepted: 961

            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>

            using namespace std;

            int map[201][201];
            int match[201];
            int visit[201];
            int n,m;

            bool dfs(int p)
            {
                
            int x;
                
            for(x=0;x<m;x++)
                
            {
                    
            if(map[p][x]==1 && visit[x]==-1)
                    
            {
                        visit[x]
            =1;
                        
            int t=match[x];
                        match[x]
            =p;
                        
            if(t==-1 || dfs(t)) return true;
                        match[x]
            =t;
                    }

                }

                
            return false;
            }


            int find_match()
            {
                memset(match,
            -1,sizeof(match));
                
            int i,sum=0;
                
            for(i=0;i<n;i++)
                
            {
                    memset(visit,
            -1,sizeof(visit));
                    
            if(dfs(i)) sum++;
                }

                
            return sum;
            }


            int main()
            {
                
            //freopen("in.txt","r",stdin);
                while(scanf("%d%d",&n,&m)!=EOF)
                
            {
                    
            int i,j;
                    
            for(i=0;i<n;i++)
                        
            for(j=0;j<m;j++) map[i][j]=0;
                    
            for(i=0;i<n;i++)
                    
            {
                        
            int a,b;
                        scanf(
            "%d",&a);
                        
            for(j=0;j<a;j++)
                        
            {
                            scanf(
            "%d",&b);
                            map[i][b
            -1]=1;
                        }

                    }

                    
            int res=find_match();
                    printf(
            "%d\n",res);
                }

                
            return 1;
            }
            參考了郭嵩山的第三冊,用網上的代碼似乎有錯。
            posted on 2007-12-31 12:53 bon 閱讀(238) 評論(0)  編輯 收藏 引用
            Google PageRank 
Checker - Page Rank Calculator
            久久婷婷午色综合夜啪| 亚洲av日韩精品久久久久久a | 99精品久久精品一区二区| 久久久久亚洲av无码专区| 青青热久久综合网伊人| 亚洲国产成人久久精品99| 色综合久久久久无码专区 | 91久久成人免费| 久久强奷乱码老熟女网站| 亚洲综合伊人久久综合| 国产99久久久国产精免费| 久久久亚洲欧洲日产国码是AV | 日批日出水久久亚洲精品tv| 久久发布国产伦子伦精品| 久久综合精品国产一区二区三区 | 久久91精品久久91综合| 亚洲日韩欧美一区久久久久我| 久久精品人人做人人爽电影蜜月| 狠狠综合久久综合中文88| 久久国产免费观看精品3| 人妻无码αv中文字幕久久琪琪布| 人人狠狠综合久久亚洲88| 人妻精品久久无码专区精东影业| 人妻系列无码专区久久五月天| 久久久女人与动物群交毛片| 欧美日韩久久中文字幕| 亚洲精品无码久久久| 久久国产免费| 国内精品久久久久久久久| 亚洲国产天堂久久综合网站| 久久丫精品国产亚洲av不卡 | 国产精久久一区二区三区| AV无码久久久久不卡网站下载| 中文字幕精品久久| 久久综合亚洲色HEZYO国产| 久久久久久国产精品免费免费| 久久99国产精品二区不卡| 久久精品毛片免费观看| 精品国产一区二区三区久久久狼 | 久久91精品国产91久| 午夜精品久久久久久|