描述

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",n-hungary()/2); 48 } 49 return 0; 50 }

轉載于:https://www.cnblogs.com/taozi1115402474/p/9526675.html

總結

以上是生活随笔為你收集整理的TZOJ 1321 Girls and Boys(匈牙利最大独立集)的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。