zoukankan      html  css  js  c++  java
  • TZOJ 1321 Girls and Boys(匈牙利最大独立集)

    描述

    the second year of the university somebody started a study on the romantic relations between the students. The relation “romantically involved” is defined between one girl and one boy. For the study reasons it is necessary to find out the maximum set satisfying the condition: there are no two students in the set who have been “romantically involved”. The result of the program is the number of students in such a set.

    输入

    The input contains several data sets in text format. Each data set represents one set of subjects of the study, with the following description:

    the number of students
    the description of each student, in the following format
    student_identifier:(number_of_romantic_relations) student_identifier1 student_identifier2 student_identifier3 ...
    or
    student_identifier:(0)

    The student_identifier is an integer number between 0 and n-1, for n students.

    输出

    For each given data set, the program should write to standard output a line containing the result.

    样例输入

    7
    0: (3) 4 5 6
    1: (2) 4 6
    2: (0)
    3: (0)
    4: (2) 0 1
    5: (1) 0
    6: (2) 0 1
    3
    0: (2) 1 2
    1: (1) 0
    2: (1) 0

    样例输出

    5
    2

    题意

    N个人,求最大子集使得任何两个人都没有亲密关系

    题解

    先把亲密关系连图,跑匈牙利得到最大匹配,这里不知道男女,所以最大匹配得/2

    答案就是N-最大匹配/2

    代码

     1 #include<bits/stdc++.h>
     2 #define pb push_back
     3 using namespace std;
     4 
     5 const int N=1005;
     6 
     7 vector<int> G[N];
     8 int n,match[N],vis[N];
     9 bool dfs(int u)
    10 {
    11     for(int i=0;i<(int)G[u].size();i++)
    12     {
    13         int v=G[u][i];
    14         if(!vis[v])
    15         {
    16             vis[v]=1;
    17             if(match[v]==-1||dfs(match[v]))
    18             {
    19                 match[v]=u;
    20                 return true;
    21             }
    22         }
    23     }
    24     return false;
    25 }
    26 int hungary()
    27 {
    28     int ans=0;
    29     memset(match,-1,sizeof match);
    30      for(int i=0;i<n;i++)
    31      {
    32         memset(vis,0,sizeof vis);
    33         ans+=dfs(i);
    34     }
    35     return ans;
    36 }
    37 int main()
    38 {
    39     while(~scanf("%d",&n))
    40     {
    41         for(int i=0;i<n;i++)G[i].clear();
    42         for(int i=0,x,y,k;i<n;i++)
    43         {
    44             scanf("%d: (%d)",&x,&k);
    45             while(k--)scanf("%d",&y),G[x].pb(y);
    46         }
    47         printf("%d
    ",n-hungary()/2);
    48     }
    49     return 0;
    50 }
  • 相关阅读:
    洛谷P1020/CODEVS1044 导弹拦截(拦截导弹)
    洛谷P1541/CODEVS1068 乌龟棋
    洛谷1791/CODEVS1214线段覆盖
    NOIP2002提高组/洛谷P1031均分纸牌
    【USACO2009Decsilver T1 自私的食草者
    洛谷P1024/NOI题库7891(2.3)/NOIP2001提高组T1 一元三次方程求解
    洛谷1086/NOI题库1.13.38/NOIP2004普及组第2题 花生采摘
    NOIP2010/洛谷P1525关押罪犯
    洛谷P1115最大子段和
    1244-作为一个java开发者的知识储备
  • 原文地址:https://www.cnblogs.com/taozi1115402474/p/9526675.html
Copyright © 2011-2022 走看看