hdoj 1068 Girls and Boys(匈牙利算法,答案为顶点数减去最大匹配数)
2014-07-29 17:45
465 查看
Girls and Boys
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7167 Accepted Submission(s): 3254
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.
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
Source
Southeastern Europe 2000
Recommend
JGShining | We have carefully selected several similar problems for you: 1150 1151 1281 1507 1528
刚学匈牙利算法,第一题AC
bool 寻找从k出发的对应项出的可增广路
{
while (从邻接表中列举k能关联到顶点j)
{
if (j不在增广路上)
{
把j加入增广路;
if (j是未盖点 或者 从j的对应项出发有可增广路)
{
修改j的对应项为k;
则从k的对应项出有可增广路,返回true;
}
}
}
则从k的对应项出没有可增广路,返回false;
}
void 匈牙利hungary()
{
for i->1 to n
{
if (则从i的对应项出有可增广路)
匹配数++;
}
输出 匹配数;
}
附上代码:
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include<sstream>
#include<set>
using namespace std;
const int N=1010;
int g
;
int vis
;
int flag
;
int n;
bool find(int u)
{
for(int j=0;j<n;j++)
{
if(g[u][j]&&!vis[j])
{
//cout<<u<<" "<<j<<endl;
vis[j]=1;
if(!flag[j]||find(flag[j]))
{
flag[j]=u;
return true;
}
}
}
return false;
}
int main()
{
int cnt,num;
while(~scanf("%d",&n))
{
memset(g,0,sizeof(g));
memset(flag,0,sizeof(flag));
for(int i=0;i<n;i++)
{
scanf("%d: (%d)",&num,&cnt);
//cout<<num<<" "<<cnt<<endl;
for(int j=0;j<cnt;j++)
{
int a;
scanf("%d",&a);
g[num][a]=1;
}
}
//cout<<g[1][0]<<" "<<g[2][0]<<endl;
int sum=0;
for(int i=0;i<n;i++)
{
memset(vis,0,sizeof(vis));
if(find(i)) sum++;
}
printf("%d\n",n-sum/2);
}
return 0;
}
相关文章推荐
- HDOJ题目1068Girls and Boys(二分图最大独立集,匈牙利算法模板)
- hdoj 1068 Girls and Boys【匈牙利算法+最大独立集】
- 【杭电oj】1068 - Girls and Boys(最大独立集数,匈牙利算法)
- HDU 1068 Girls and Boys(二分匹配--匈牙利算法)
- hdu 1068 Girls and Boys 匈牙利算法求最大独立集
- Pku acm 1466 Girls and Boys数据结构题目解题报告(十七)---- 匈牙利算法求二分图的最大匹配
- hdu 1068 Girls and Boys(匈牙利算法求最大独立集)
- HDU 1068 Girls and Boys (匈牙利算法 二分图的最大独立集数 )
- HDOJ---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 zoj 1137 poj 1466 Girls and Boys(二分图匹配 匈牙利算法 最大独立集)
- [HDOJ1068]Girls and Boys(二分图最大匹配,最大独立集)
- HDU 1068 Girls and Boys(二分图匹配+最大独立集+匈牙利算法)
- hdu 1068 boys and girls(最大独立点集 ,匈牙利算法)
- 杭电oj 1068 - Girls and Boys【最大独立集数,匈牙利算法】
- hdoj 1068 Girls and Boys 【匈牙利算法&&二分图匹配】
- HDOJ---1151 Air Raid[匈牙利算法:最小路径覆盖数=原图顶点数–二分图最大匹配数]