HDU 1068.Girls and Boys【二分图匹配(最大独立集)】【5月6日】
来源:互联网 发布:为知笔记登陆 编辑:程序博客网 时间:2024/06/15 19:13
Girls and Boys
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9926 Accepted Submission(s): 4554
Problem 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
#include<iostream>#include<cstdio>#include<cstring>using namespace std;const int MAX = 1005;int Map[MAX][MAX], vis[MAX], link[MAX];int n, a, m, b, sum;bool PP(int node){ for(int i = 0;i < n; ++i) { if(!vis[i] && Map[node][i]) { vis[i] = 1; if(link[i] == -1 || PP(link[i])) { link[i] = node; return true; } } } return false;}int main(){ while(scanf("%d", &n) != EOF) { sum = 0; memset(Map, 0, sizeof(Map)); for(int i = 0;i < n; ++i) link[i] = -1; for(int i = 0;i < n; ++i) { scanf("%d: (%d)", &a, &m); while(m--) { scanf("%d", &b); Map[a][b] = 1; } } for(int i = 0;i < n; ++i) { memset(vis, 0, sizeof(vis)); if(PP(i)) sum ++; } cout << n-sum/2 << endl; } return 0;}
0 0
- HDU 1068.Girls and Boys【二分图匹配(最大独立集)】【5月6日】
- hdu 1068 Girls and Boys(最大独立集,二分匹配)
- 【二分图匹配(最大独立集)】hdu 1068 Girls and Boys
- HDU 1068 Girls and Boys(二分图匹配+最大独立集+匈牙利算法)
- poj1466 Girls and Boys (最大独立集 二分图匹配)
- hdu Girls and Boys(二分图的最大独立集)
- HDU 1068 Girls and Boys (二分图匹配---最大独立集)
- HDU 1068 Girls and Boys 最大独立集 二分图匹配
- hdu 1068 Girls and Boys(二分图匹配---最大独立点集)
- hdu 1068 Girls and Boys 二分图匹配 最大独立集
- hdu 1068 zoj 1137 poj 1466 Girls and Boys(二分图匹配 匈牙利算法 最大独立集)
- HDU 1068 Girls and Boys(二分图最大匹配)
- POJ 1466 Girls and Boys(二分图匹配+拆点+最大独立集)
- hdu 1068 Girls and Boys 最大独立集(最大匹配)
- hdu 1068 Girls and Boys(二分图求最大独立点集)
- hdu 1068 Girls and Boys(二分图+最大独立集)
- hdu 1068 girls and boys(二分图求最大独立集)
- HDU【1068】Girls And Boys(二分图+模板+最大独立集)
- Implement strStr()
- 读取磁盘文件
- java的collections的sort的API
- 基础算法题----兔子问题(斐波那契数列)
- nyoj 153 BOBSLEDDING
- HDU 1068.Girls and Boys【二分图匹配(最大独立集)】【5月6日】
- PMP备考总结
- google protobuf的编译成jar包
- Oracle回收站的那些事儿
- ubuntu 下安装git 并上传代码至github
- Android关闭软键盘
- 7、jQuery的Ajax与Java交互带加载图片
- Java---实现运行任意目录下class中加了@MyTest的空参方法(实现图形界面)
- 多线程下静态方法的使用及安全性