The Accomodation of Students
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5218 Accepted Submission(s): 2372
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 4 1 2 1 3 1 4 2 3 6 5 1 2 1 3 1 4 2 5 3 6
Sample Output
No 3
思路:判断是否是二分图很好判断,所有的条件必须能分成两个集合且互不矛盾,所以我们用染色法一个个染过去即可,如果出现一条边两个点都是同一个颜色就说明不是二分图,DFS或者BFS都可以
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
#define N 220
int n,m;
int ma[N][N],color[N];
int line[N],vis[N];
int bfs(int s)
{
color[s]=0;
queue<int>que;
que.push(s);
while(!que.empty())
{
int u=que.front();
que.pop();
for(int i=1; i<=n; i++)
{
if(i==u||!ma[u][i]) continue;
if(color[i]==-1)
{
color[i]=!color[u];
que.push(i);
}
else if(color[i]==color[u])
return 0;
}
}
return 1;
}
int can(int t)
{
for(int i=1; i<=n; i++)
{
if(!vis[i]&&ma[t][i])
{
vis[i]=1;
if(line[i]==-1||can(line[i]))
{
line[i]=t;
return 1;
}
}
}
return 0;
}
int Maxmatch()
{
int ans=0;
for(int i=1; i<=n; i++)
{
memset(vis,0,sizeof(vis));
if(can(i)) ans++;
}
return ans/2;
}
int main()
{
int s,t;
while(~scanf("%d %d",&n,&m))
{
memset(ma,0,sizeof(ma));
for(int i=1; i<=m; i++)
{
scanf("%d %d",&s,&t);
ma[s][t]=ma[t][s]=1;
}
memset(color,-1,sizeof(color));
int flag=0;
for(int i=1; i<=n; i++)
{
if(color[i]!=-1) continue;
if(!bfs(i))
{
flag=1;
break;
}
}
if(flag) printf("No\n");
else
{
memset(line,-1,sizeof(line));
int ans=Maxmatch();
printf("%d\n",ans);
}
}
return 0;
}