【杭电oj】1068 - Girls and Boys(最大独立集数,匈牙利算法)
来源:互联网 发布:阿里云ecs无法连接ftp 编辑:程序博客网 时间:2024/05/19 04:28
Girls and Boys
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 9775 Accepted Submission(s): 4475Problem Description
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 subjects.
For each given data set, the program should write to standard output a line containing the result.
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 subjects.
For each given data set, the program should write to standard output a line containing the result.
Sample Input
70: (3) 4 5 61: (2) 4 62: (0)3: (0)4: (2) 0 15: (1) 06: (2) 0 130: (2) 1 21: (1) 02: (1) 0
Sample Output
52
Source
Southeastern Europe 2000
找bug找了半个多小时,好无奈,脑子暂时不好用了,还是先组做别的题吧。
代码如下:
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int fr[511][511];//A和B是否有关系 int used[511];int F[511];//匹配情况 int n;bool find(int x){for (int i = 0 ; i < n ; i++){if (fr[x][i] && !used[i]){used[i] = 1;//这一步忘了加了,出死循环了,崩了俩电脑 if (F[i] == -1 || find(F[i])){F[i] = x;return true;}}}return false;}int main(){int ans;int a,m;//a有m个关系while (~scanf ("%d",&n)){memset (fr,0,sizeof (fr));memset (F,-1,sizeof (F));for (int i = 0 ; i < n ; i++){scanf ("%d: (%d)",&a,&m);while (m--){int t;scanf ("%d",&t);fr[a][t] = 1;fr[t][a] = 1;}}ans = 0;for (int i = 0 ; i < n ; i++){memset (used,0,sizeof (used));if (find (i))ans++;}ans = n - (ans / 2);//↑:顶点数 - 最大配对数 = 最大独立集数(因为是把集合扩大了1倍,所以除以2) printf ("%d\n",ans);}return 0;}
0 0
- 【杭电oj】1068 - Girls and Boys(最大独立集数,匈牙利算法)
- 【hdu 1068 Girls and Boys 最大独立集数 匈牙利算法 】
- 【HDU1068】Girls and Boys(最大独立集数,匈牙利算法)
- HDU 1068 Girls and Boys (匈牙利算法 二分图的最大独立集数 )
- HDOJ 1068 Girls And Boys (最大独立集数)
- hdu 1068 Girls and Boys(匈牙利算法求最大独立集)
- HDOJ题目1068Girls and Boys(二分图最大独立集,匈牙利算法模板)
- HDU 1068 Girls and Boys(二分图匹配+最大独立集+匈牙利算法)
- POJ 1466 Girls and Boys (匈牙利算法 最大独立集)
- hdu 1068 boys and girls(最大独立点集 ,匈牙利算法)
- hdu 1068 Girls and Boys 匈牙利算法求最大独立集
- hdu 1068 zoj 1137 poj 1466 Girls and Boys(二分图匹配 匈牙利算法 最大独立集)
- POJ 1466 Girls and Boys(匈牙利算法—最大独立集)
- hdoj 1068 Girls and Boys(匈牙利算法,答案为顶点数减去最大匹配数)
- HDOJ 1068 Girls and Boys (最大匹配数 匈牙利算法)
- HDU 1068 Girls and Boys(最大独立集)
- hdu 1068 Girls and Boys (最大独立集)
- hdu 1068 Girls and Boys(最大独立集)
- openwrt 下基于按键法的WPS功能实现
- h264 裸流打包成mp4 注意事项
- 如何通过maven官网查询相关依赖的具体代码和版本?
- nodejs篇(一)
- 兼容浏览器的js事件绑定函数
- 【杭电oj】1068 - Girls and Boys(最大独立集数,匈牙利算法)
- HDU 2836 Traversal(线段树+离散化+DP)
- docx的解析
- lightoj 1079 - Just another Robbery 01背包
- 160329集合
- Android官方开发文档Training系列课程中文版:数据存储之数据库存储
- IOS学习 info.plist 文件加两行代码 多线程NSThread/GCD 异步下载网络图片
- nginx_http_proxy_module,实现反向代理及缓存功能
- 浅谈Servlet的本质