POJ 2771 Guardian of Decency(二分匹配,最大独立集)
2012-08-20 11:48
369 查看
Guardian of Decency
Description
Frank N. Stein is a very conservative high-school teacher. He wants to take some of his students on an excursion, but he is afraid that some of them might become couples. While you can never exclude this possibility, he has made some rules that he thinks indicates a low probability two persons will become a couple:
Their height differs by more than 40 cm.
They are of the same sex.
Their preferred music style is different.
Their favourite sport is the same (they are likely to be fans of different teams and that would result in fighting).
So, for any two persons that he brings on the excursion, they must satisfy at least one of the requirements above. Help him find the maximum number of persons he can take, given their vital information.
Input
The first line of the input consists of an integer T ≤ 100 giving the number of test cases. The first line of each test case consists of an integer N ≤ 500 giving the number of pupils. Next there will be one line for each pupil consisting of four space-separated data items:
an integer h giving the height in cm;
a character 'F' for female or 'M' for male;
a string describing the preferred music style;
a string with the name of the favourite sport.
No string in the input will contain more than 100 characters, nor will any string contain any whitespace.
Output
For each test case in the input there should be one line with an integer giving the maximum number of eligible pupils.
Sample Input
Sample Output
Source
Northwestern Europe 2005
二分匹配。
主要是建图方法。
题目要求是选出两两之间满足四个条件之一的人。
我们建图应该反过来建。
给不满足四个条件的人一条边。就转换成求最大独立集的问题。
二分图最大独立集=顶点数-二分图最大匹配
独立集:图中任意两个顶点都不相连的顶点集合。
Time Limit: 3000MS | Memory Limit: 65536K | |
Total Submissions: 4071 | Accepted: 1702 |
Frank N. Stein is a very conservative high-school teacher. He wants to take some of his students on an excursion, but he is afraid that some of them might become couples. While you can never exclude this possibility, he has made some rules that he thinks indicates a low probability two persons will become a couple:
Their height differs by more than 40 cm.
They are of the same sex.
Their preferred music style is different.
Their favourite sport is the same (they are likely to be fans of different teams and that would result in fighting).
So, for any two persons that he brings on the excursion, they must satisfy at least one of the requirements above. Help him find the maximum number of persons he can take, given their vital information.
Input
The first line of the input consists of an integer T ≤ 100 giving the number of test cases. The first line of each test case consists of an integer N ≤ 500 giving the number of pupils. Next there will be one line for each pupil consisting of four space-separated data items:
an integer h giving the height in cm;
a character 'F' for female or 'M' for male;
a string describing the preferred music style;
a string with the name of the favourite sport.
No string in the input will contain more than 100 characters, nor will any string contain any whitespace.
Output
For each test case in the input there should be one line with an integer giving the maximum number of eligible pupils.
Sample Input
2 4 35 M classicism programming 0 M baroque skiing 43 M baroque chess 30 F baroque soccer 8 27 M romance programming 194 F baroque programming 67 M baroque ping-pong 51 M classicism programming 80 M classicism Paintball 35 M baroque ping-pong 39 F romance ping-pong 110 M romance Paintball
Sample Output
3 7
Source
Northwestern Europe 2005
二分匹配。
主要是建图方法。
题目要求是选出两两之间满足四个条件之一的人。
我们建图应该反过来建。
给不满足四个条件的人一条边。就转换成求最大独立集的问题。
二分图最大独立集=顶点数-二分图最大匹配
独立集:图中任意两个顶点都不相连的顶点集合。
#include<stdio.h> #include<iostream> #include<string.h> #include<algorithm> #include<math.h> using namespace std; /* ************************************************************************** //二分图匹配(匈牙利算法的DFS实现) //初始化:g[][]两边顶点的划分情况 //建立g[i][j]表示i->j的有向边就可以了,是左边向右边的匹配 //g没有边相连则初始化为0 //uN是匹配左边的顶点数,vN是匹配右边的顶点数 //调用:res=hungary();输出最大匹配数 //优点:适用于稠密图,DFS找增广路,实现简洁易于理解 //时间复杂度:O(VE) //***************************************************************************/ //顶点编号从0开始的 const int MAXN=510; int uN,vN;//u,v数目 int g[MAXN][MAXN]; int linker[MAXN]; bool used[MAXN]; bool dfs(int u)//从左边开始找增广路径 { int v; for(v=0;v<vN;v++)//这个顶点编号从0开始,若要从1开始需要修改 if(g[u][v]&&!used[v]) { used[v]=true; if(linker[v]==-1||dfs(linker[v])) {//找增广路,反向 linker[v]=u; return true; } } return false;//这个不要忘了,经常忘记这句 } int hungary() { int res=0; int u; memset(linker,-1,sizeof(linker)); for(u=0;u<uN;u++) { memset(used,0,sizeof(used)); if(dfs(u)) res++; } return res; } //******************************************************************************/ struct Node { int h;//身高 char str1[4];//性别 char str2[110];//喜欢的音乐风格 char str3[110];//喜欢的运动 }node[MAXN]; int main() { int T; int n; scanf("%d",&T); while(T--) { scanf("%d",&n); uN=vN=n; memset(g,0,sizeof(g)); for(int i=0;i<n;i++) scanf("%d%s%s%s",&node[i].h,&node[i].str1,&node[i].str2,&node[i].str3); for(int i=0;i<n;i++) for(int j=0;j<n;j++) { if(abs(node[i].h-node[j].h)<=40&&node[i].str1[0]!=node[j].str1[0] &&strcmp(node[i].str2,node[j].str2)==0&&strcmp(node[i].str3,node[j].str3)!=0) { g[i][j]=g[j][i]=1; } } printf("%d\n",(n-hungary())/2); } return 0; }
相关文章推荐
- POJ 1466 Girls and Boys 黑白染色 + 二分匹配 (最大独立集) 好题
- poj2771——Guardian of Decency——————【最大独立集、最大匹配扩展】
- poj2771 Guardian of Decency 二分匹配之最大独立集
- poj 1466 Girls and Boys(二分匹配之最大独立集)
- POJ 1466 二分匹配 最大独立集
- poj 3692 Kindergarten(二分匹配,最大独立集)
- LOJ 1201 - A Perfect Murder(二分匹配 最大独立集)
- poj 3189 Steady Cow Assignment(多重匹配or二分最大流)
- 【POJ】-3041-Asteroids(二分最大匹配)
- POJ 2771 Guardian of Decency(求最大点独立集)
- poj 2771 二分匹配 Guardian of Decency
- poj 1719最大二分匹配hungary算法
- 最大独立集,二分图最大匹配 poj 1466
- POJ 2112 Optimal Milking (二分+最短路+最大流or二分图多重匹配)
- poj3020 二分图 最大二分匹配
- hdu 4169 二分匹配最大独立集 ***
- POJ 2226 Muddy Fields(二分匹配【最大流】)
- POJ1034最大二分匹配
- POJ2771_Guardian of Decency(二分图/最大独立集=N-最大匹配)
- poj 1325 Machine Schedule 二分匹配,可以用最大流来做