hdu 1068 Girls and Boys(最大独立集模板)
来源:互联网 发布:sqlserver添加数据 编辑:程序博客网 时间:2024/06/05 03:40
Girls and Boys
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10501 Accepted Submission(s): 4850
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>#include <algorithm>#include <cmath>using namespace std;#define N 510#define INF 999999999int ma[N][N];int n,line[N],vis[N];struct Node{ char c,d; int x,y;} p[N];int can(int t){ for(int i=1; i<=n; i++) { if(i==t)continue; if(!vis[i]&&ma[t][i]) { vis[i]=1; if(line[i]==-1||can(line[i])) { line[i]=t; return 1; } } } return 0;}int main(){ int T,s,num; while(~scanf("%d",&n)) { memset(ma,0,sizeof(ma)); memset(line,-1,sizeof(line)); for(int i=1;i<=n;i++) { scanf("%d: (%d)",&s,&num); while(num--) { scanf("%d",&s); ma[i][s+1]=1; } } int ans=0; for(int i=1; i<=n; i++) { memset(vis,0,sizeof(vis)); if(can(i)) ans++; } printf("%d\n",n-ans/2); } return 0;}
0 0
- hdu 1068 Girls and Boys(最大独立集模板)
- HDU 1068 Girls and Boys(最大独立集)
- hdu 1068 Girls and Boys (最大独立集)
- hdu 1068 Girls and Boys(最大独立集)
- HDU 1068 boys and girls(最大独立集)
- 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 二分最大独立集
- HDU 1068 Girls and Boys 最大独立集
- hdu 1068 Girls and Boys 【最大独立集】
- HDU 1068 — Girls and Boys 最大独立集
- HDU 1068 Girls and Boys【最大独立集】
- poj 1466 && hdu 1068Girls and Boys(最大独立集)
- HDU 1068 Girls and Boys (二分最大独立集)
- HDU 1068 Girls and Boys 最大独立集
- HDU 1068 Girls and Boys 最大独立集
- 实习笔记(三)
- 前端使用FormData实现上传文件
- 图片转化成base64字符串
- UVALive 6442 Coins on a Ring (思维题)
- mysql在linux上出现Access denied for user 'root'@'localhost' (using password: NO)解决方案
- hdu 1068 Girls and Boys(最大独立集模板)
- 数据结构之线段树
- java wait()和sleep()区别
- 存储引擎和索引
- Zookeeper.NET Client(二)【官方驱动 开发入门】
- Apache Mesos 底层网络通信库 libprocess 分析
- Linux 系统 /usr 介绍
- Hadoop-HDFS(一)读流程
- CODEVS1000 A+B