标签:
解题报告
http://blog.csdn.net/juncoder/article/details/38160591
题意:
求满足条件的最大集合:集合内任何两个人都没有浪漫关系
思路:
跟POJ2771一样的题,变的简单多了。POJ2771解题报告
#include <cstdio> #include <cstring> #include <iostream> #include <algorithm> using namespace std; int n,mmap[550][550],pre[550],vis[550]; int dfs(int x) { for(int i=0; i<n; i++) { if(!vis[i]&&mmap[x][i]) { vis[i]=1; if(pre[i]==-1||dfs(pre[i])) { pre[i]=x; return 1; } } } return 0; } int main() { int i,j,a,b,k; while(~scanf("%d",&n)) { memset(mmap,0,sizeof(mmap)); memset(pre,-1,sizeof(pre)); for(i=1; i<=n; i++) { scanf("%d: (%d) ",&a,&k); for(j=1; j<=k; j++) { scanf("%d",&b); mmap[a][b]=1; } } int ans=0; for(i=0; i<n; i++) { memset(vis,0,sizeof(vis)); ans+=dfs(i); } printf("%d\n",n-ans/2); } return 0; }
Time Limit: 5000MS | Memory Limit: 10000K | |
Total Submissions: 10348 | Accepted: 4608 |
Description
Input
Output
Sample Input
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
Sample Output
5 2
POJ1466_Girls and Boys(二分图/最大独立集=N-最大匹配)
标签:
原文地址:http://blog.csdn.net/juncoder/article/details/38160591