hdoj 2444 The Accomodation of Students(二分图判定+匈牙利裸题)
来源:互联网 发布:软件开发认证 编辑:程序博客网 时间:2024/06/09 14:21
The Accomodation of Students
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6492 Accepted Submission(s): 2904
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
Source
2008 Asia Harbin Regional Contest Online
Recommend
gaojie
题意:
一些学生之间是朋友关系(关系不能传递),现在要将一堆学生分成两堆,使得在同一堆的学生之间没有朋友关系。如果不可以输出“No”,可以的话输出最多可以分出几对小盆友(最大匹配)。
思路:bfs判断二分图, 然后匈牙利。。。最后答案/2,因为是双向二分图
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>using namespace std;const int maxn = 2e3 + 5;vector<int> v[maxn];int n, m, match[maxn], book[maxn];int judge(){ queue<int> q; memset(book, -1, sizeof(book)); q.push(1); book[1] = 0; while(!q.empty()) { int u = q.front(); q.pop(); for(int i = 0; i < v[u].size(); i++) { int to = v[u][i]; if(book[to] == -1) { book[to] = !book[u]; q.push(to); } else if(book[to] == book[u]) return 0; } } return 1;}int Find(int x){ for(int i = 0; i < v[x].size(); i++) { int to = v[x][i]; if(book[to]) continue; book[to] = 1; if(match[to] == 0 || Find(match[to])) { match[to] = x; return 1; } } return 0;}int main(){ while(~scanf("%d%d", &n, &m)) { int x, y; for(int i = 0; i <= n; i++) v[i].clear(); memset(match, 0, sizeof(match)); for(int i = 1; i <= m; i++) { scanf("%d%d", &x, &y); v[x].push_back(y); v[y].push_back(x); } if(!judge()) { printf("No\n"); continue; } int ans = 0; for(int i = 1; i <= n; i++) { memset(book, 0, sizeof(book)); ans += Find(i); } printf("%d\n", ans/2); } return 0;}
The Accomodation of Students
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6492 Accepted Submission(s): 2904
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
Source
2008 Asia Harbin Regional Contest Online
Recommend
gaojie
阅读全文
0 0
- hdoj 2444 The Accomodation of Students(二分图判定+匈牙利裸题)
- hdoj 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(判断二分图+匈牙利算法)
- The Accomodation of Students(HDU-2444)(二分图判定与最大匹配)
- HDU 2444 The Accomodation of Students(二分图判定+最大匹配)
- HDU 2444 The Accomodation of Students (二分图判定、求最大匹配)
- 二分图 匈牙利算法 HDU2444 The Accomodation of Students
- The Accomodation of Students 二分图判定+匹配
- HDOJ 题目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(二分图判断)
- hdu 2444 The Accomodation of Students(二分图判断+匈牙利算法)
- 二维数组的生成-【leetcode118- Pascal's Triangle 】
- C/C++动态内存管理
- GAN快速实现
- 不用淘宝镜像解决NPM下载错误或失败的方法
- [DP] [2D2D优化] [二维树状数组] [SCOI2014] 方伯伯的玉米田
- hdoj 2444 The Accomodation of Students(二分图判定+匈牙利裸题)
- コンピュターグラフィックス COMPUTER GRAPHICS[FOR CG ENGINEERS]-Chapter2-0706
- 算法学习(动态规划 一)钢条切割
- hadoop datanode节点超时时间设置
- Cameras
- Jquery validate 表单验证插件的使用(转自菜鸟)
- 聊聊你不知道的建造者设计模式
- C# 委托 事件 观察者模式 总结
- 缓存无关算法