zoukankan      html  css  js  c++  java
  • poj 3692 Kindergarten (最大独立集之逆匹配)

    Description

    In a kindergarten, there are a lot of kids. All girls of the kids know each other and all boys also know each other. In addition to that, some girls and boys know each other. Now the teachers want to pick some kids to play a game, which need that all players know each other. You are to help to find maximum number of kids the teacher can pick.

    Input

    The input consists of multiple test cases. Each test case starts with a line containing three integers
    G, B (1 ≤ G, B ≤ 200) and M (0 ≤ M ≤ G × B), which is the number of girls, the number of boys and
    the number of pairs of girl and boy who know each other, respectively.
    Each of the following M lines contains two integers X and Y (1 ≤ X≤ G,1 ≤ Y ≤ B), which indicates that girl X and boy Y know each other.
    The girls are numbered from 1 to G and the boys are numbered from 1 to B.
    
    The last test case is followed by a line containing three zeros.

    Output

    For each test case, print a line containing the test case number( beginning with 1) followed by a integer which is the maximum number of kids the teacher can pick.

    Sample Input

    2 3 3
    1 1
    1 2
    2 3
    2 3 5
    1 1
    1 2
    2 1
    2 2
    2 3
    0 0 0

    Sample Output

    Case 1: 3
    Case 2: 4

    Source

     
    求的是最大独立集,但是这里要用mp[][]==0来匹配,真是太妙了,用到了逆思维,说明自己想问题还不够深刻啊,还需要继续努力!!!
     
     1 #include<iostream>
     2 #include<cstdio>
     3 #include<cstring>
     4 using namespace std;
     5 #define N 206
     6 int G,B,M;
     7 int mp[N][N];
     8 int match[N];
     9 int vis[N];
    10 bool dfs(int x){
    11     for(int i=1;i<=B;i++){
    12         if(!vis[i] && !mp[x][i]){//注意这里要取mp[x][i]==0!!!
    13             vis[i]=1;
    14             if(match[i]==-1 || dfs(match[i])){
    15                 match[i]=x;
    16                 return true;
    17             }
    18         }
    19     }
    20     return false;
    21 }
    22 int solve(){
    23     int ans=0;
    24     memset(match,-1,sizeof(match));
    25 
    26     for(int i=1;i<=G;i++){
    27         memset(vis,0,sizeof(vis));
    28         if(dfs(i)){
    29             ans++;
    30         }
    31     }
    32     return ans;
    33 }
    34 int main()
    35 {
    36     int ac=0;
    37     while(scanf("%d%d%d",&G,&B,&M)==3){
    38         if(G==0 && B==0 && M==0)
    39             break;
    40         printf("Case %d: ",++ac);
    41         memset(mp,0,sizeof(mp));
    42         for(int i=0;i<M;i++){
    43             int x,y;
    44             scanf("%d%d",&x,&y);
    45             mp[x][y]=1;
    46         }
    47         int ans=solve();
    48         
    49         printf("%d
    ",G+B-ans);
    50 
    51 
    52     }
    53     return 0;
    54 }
    View Code
  • 相关阅读:
    myeclipse启动后,卡在loading workbench界面
    oracle数据库导入dmp文件
    ORA-28009: 应当以 SYSDBA 身份或 SYSOPER 身份建立 SYS 连接
    debug启动项目很慢
    CSS利用border绘制图形
    HTML创建链接框
    CSS实现单行文本溢出显示省略号
    HTML5中的Web Worker
    HTML拖放元素
    Canvas和SVG的比较
  • 原文地址:https://www.cnblogs.com/UniqueColor/p/4773865.html
Copyright © 2011-2022 走看看