hdu 2444-The Accomodation of Students(二分匹配)
来源:互联网 发布:知乎 住范儿 编辑:程序博客网 时间:2024/05/08 18:56
The Accomodation of Students
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 609 Accepted Submission(s): 298
Problem Description
There are a group of students. Some of them may know each other, while others don't. For example, A and B know each other, B and C know each other. But this may not imply that A and C know each other.
Now you are given all pairs of students who know each other. Your task is to divide the students into two groups so that any two students in the same group don't know each other.If this goal can be achieved, then arrange them into double rooms. Remember, only paris appearing in the previous given set can live in the same room, which means only known students can live in the same room.
Calculate the maximum number of pairs that can be arranged into these double rooms.
Now you are given all pairs of students who know each other. Your task is to divide the students into two groups so that any two students in the same group don't know each other.If this goal can be achieved, then arrange them into double rooms. Remember, only paris appearing in the previous given set can live in the same room, which means only known students can live in the same room.
Calculate the maximum number of pairs that can be arranged into these double rooms.
Input
For each data set:
The first line gives two integers, n and m(1<n<=200), indicating there are n students and m pairs of students who know each other. The next m lines give such pairs.
Proceed to the end of file.
The first line gives two integers, n and m(1<n<=200), indicating there are n students and m pairs of students who know each other. The next m lines give such pairs.
Proceed to the end of file.
Output
If these students cannot be divided into two groups, print "No". Otherwise, print the maximum number of pairs that can be arranged in those rooms.
Sample Input
4 41 21 31 42 36 51 21 31 42 53 6
Sample Output
No3
这道题的根本目的就是:求一个图是不是二分图,如果是二分图,求最大匹配。否则输出NO。
求一个图是不是二分图可以用并查集的方法做。
具体做法可以参考下面
http://blog.csdn.net/zsc09_leaf/article/details/6693479
上面那步完成后就很简单了。
#include<iostream>using namespace std;int f[210];bool sex[210];//相对于父节点的性别const int MAXN = 210; int g[MAXN][MAXN], Mx[MAXN], My[MAXN], Nx, Ny; int chk[MAXN], Q[MAXN], prev[MAXN]; int MaxMatch(void) { int res = 0; int qs, qe; memset(Mx, -1, sizeof(Mx)); memset(My, -1, sizeof(My)); memset(chk, -1, sizeof(chk)); for (int i = 0; i < Nx; i++){ if (Mx[i] == -1){ qs = qe = 0; Q[qe++] = i; prev[i] = -1; bool flag = 0; while (qs < qe && !flag){ int u = Q[qs]; for (int v = 0; v < Ny && !flag; v++) if (g[u][v] && chk[v] != i) { chk[v] = i; Q[qe++] = My[v]; if (My[v] >= 0) prev[My[v]] = u; else { flag = 1; int d = u, e = v; while (d != -1) { int t = Mx[d]; Mx[d] = e; My[e] = d; d = prev[d]; e = t; } } } qs++; } if (Mx[i] != -1) res++; } } return res; } int find(int x,bool &se){ se=true; int r=x; while(x!=f[x]) { if(sex[x]==false) se=!se; x=f[x]; } f[r]=x; sex[r]=se; return x;}int main(){ int t,i,n,m,a,b,cnt=1; while(scanf("%d%d",&n,&m)!=EOF) { Nx=Ny=n; memset(g,0,sizeof(g)); for(i=1;i<=n;i++) f[i]=i,sex[i]=true; bool judge=true; while(m--) { scanf("%d%d",&a,&b); g[a-1][b-1]=true; if(judge)//未异常 { bool l1=0,l2=0; int fa=find(a,l1),fb=find(b,l2); if(fa==fb) { if(l1==l2) judge=false; } else { f[fa]=fb; sex[fa]=l1^l2; } } } if(!judge) { printf("No\n"); } else printf("%d\n",MaxMatch()); } return 0;}
- hdu 2444-The Accomodation of Students(二分匹配)
- hdu The Accomodation of Students(二分匹配)
- hdu 2444 The Accomodation of Students 二分匹配
- hdu 2444 The Accomodation of Students 二分匹配
- hdu 2444 The Accomodation of Students (交叉染色+二分匹配)
- 【HDU】2444 The Accomodation of Students 二分匹配
- hdu 2444The Accomodation of Students 二分匹配+dfs分组
- 【二分匹配】 HDU 2444 The Accomodation of Students
- hdu 2444 The Accomodation of Students(二分匹配)
- HDU 2444 The Accomodation of Students 二分匹配
- hdu 2444 The Accomodation of Students 【二分图匹配】
- The Accomodation of Students (二分匹配)
- HDU 2444 The Accomodation of Students (二分图最大匹配+二分图染色)
- HDU - 2444 The Accomodation of Students(判断二分图 + 二分图匹配)
- HDU 2444 The Accomodation of Students(二分图判断+最大二分匹配)
- hdu 2444 The Accomodation of Students(判断二分图,二分图最大匹配)
- hdu 2444 The Accomodation of Students(二分图判断,二分图最大匹配)
- The Accomodation of Students(HDU-2444)(二分图判定与最大匹配)
- 多对一(many-to-one) .
- 对于编程语言的分析
- 手工清除回滚段的几种方法
- bootstrap$核心对象数据不一致导致ORA-08102
- 黑马程序员-编辑工具
- hdu 2444-The Accomodation of Students(二分匹配)
- [Android]Android的常用adb命令
- 如何为VMware ESXi/ESX 4.x安装第三方驱动程序
- 正则表达式中的一个小细节
- 函数在lib和dll中的命名规则
- 转换关系DAO层
- 11g新特性之–Query Cache Result 研究(1)
- 什么是网络爬虫程序
- 如何写出高性能SQL语句