http://acm.hdu.edu.cn/showproblem.php?pid=3829
题解:将学生复制一份,然后求最大匹配除以二
代码:
#include<cstdio>
#include<iostream>
#include<cstring>
#define maxn 505
using namespace std;
int n,m,p;
int like[maxn],dislike[maxn];
int g[maxn][maxn];
int linker[maxn];
bool used[maxn];
bool dfs(int u){
int v;
for(v=0;v<p;v++){
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<p;u++){
memset(used,false,sizeof(used));
if(dfs(u))res++;
}
return p-res/2;
}
int getid(char ch,int x){
x+= ch=='D'?n:0;
return x;
}
int main(){
int i,j,tmp1,tmp2;
char ch1,ch2;
while(~scanf("%d%d%d",&n,&m,&p)){
memset(g,0,sizeof(g));
for(i=0;i<p;i++){
cin>>ch1>>tmp1>>ch2>>tmp2;
like[i]=getid(ch1,tmp1);
dislike[i]=getid(ch2,tmp2);
}
for(i=0;i<p;i++){
for(j=0;j<p;j++){
if(like[i]==dislike[j]||dislike[i]==like[j]){
g[i][j]=g[j][i]=1;
}
}
}
printf("%d\n",hungary());
}
return 0;
}