Interesting Housing Problem HDU - 2426 （KM算法模板）

题目链接

题意：

给N 个学生分配宿舍，学生对一些宿舍进行评价，作为校方你想让每个学生都有房间并且住的总体满意度最高，不能将学生分到他好感度为负的宿舍

思路：

1）每个学生都有房间并且住的总体满意度最高，每个学生都带有房间，并且不能住满意度为负的房间,那就是求最大匹配

2）求满意度最高，那就是求最大权完备匹配

3）那就上KM算法啊

AC代码： 邻接表

/*
	邻接表 
*/
#include<iostream>
#include<cstring>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
const int maxn = 505;
const int INF = 0x3f3f3f3f;
vector< pair<int, int> > G[maxn];
int ex_X[maxn], ex_Y[maxn];
bool vis_X[maxn], vis_Y[maxn];
int Match[maxn];
int Slack[maxn];
int N, M, E;
void init(){
	for(int i = 0; i <= N; ++i){
		G[i].clear();
	}
}
bool Dfs(int x){
	vis_X[x] = 1;
	int v, c;
	for (int i = 0; i < G[x].size(); ++i) {
		v = G[x][i].first;
		c = G[x][i].second;
		if( vis_Y[v] ) continue;
		int Tmp = ex_X[x] + ex_Y[v] - c;
		if ( Tmp != 0) {
			Slack[v] = min(Tmp, Slack[v]);
		} else {
			vis_Y[v] = 1;
			if(Match[v] == -1 || Dfs(Match[v])){
				Match[v] = x;
				return true;
			}
		}
	}
	return false;

}
int KM(){
	memset (ex_X, 0, sizeof(ex_X));
	memset (ex_Y, 0, sizeof(ex_Y));
	memset (Match, -1, sizeof(Match));
	
	for(int i = 0; i < N; ++i){
		for(int j = 0; j < G[i].size(); ++j){
			ex_X[i] = max(ex_X[i], G[i][j].second);
		}
	}
	for (int i = 0; i < N; ++i) {
		memset (Slack, INF, sizeof(Slack));
		while(1){
			memset(vis_X, 0, sizeof(vis_X));
			memset(vis_Y, 0, sizeof(vis_Y));
			if (Dfs(i)) break;
			
			int Tmp = INF;
			
			for(int j = 0; j < M; ++j){
				if(!vis_Y[j])
					Tmp = min(Tmp, Slack[j]);
			}
			
			if(Tmp == INF) return -1;
			
			for (int j = 0; j < N; ++j) {
				if(vis_X[j]) ex_X[j] -= Tmp;
			}
			for (int j = 0; j < M; ++j){
				if(vis_Y[j]) ex_Y[j] += Tmp;
				else Slack[j] -= Tmp;
			}
		}
	}
	int Ans = 0;
	int Cnt = 0;
	for(int i = 0; i < M; ++i){
		if(Match[i] != -1){
			for(int j = 0; j < G[Match[i]].size(); ++j){
				if (G[Match[i]][j].first == i){
					Ans += G[Match[i]][j].second;
					Cnt ++;
				}
			}
		}
	}
	if(Cnt != N) Ans = -1;
	return Ans;
}
int main (){
	int Cas = 0;
	int u, v, c;
	while (~scanf("%d%d%d", &N, &M, &E)) {
		init();
		for (int i = 0; i < E; ++i) {
			scanf("%d%d%d", &u, &v, &c);
			if(c < 0) continue;
			G[u].push_back(make_pair(v, c));
		}
		printf("Case %d: %d\n", ++Cas, KM());
		
	}	
}

邻接矩阵AC代码：

#include<iostream>
#include<cstring>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
const int maxn = 505;
const int INF = 0x3f3f3f3f;
int G[maxn][maxn];
int ex_X[maxn], ex_Y[maxn];
bool vis_X[maxn], vis_Y[maxn];
int Match[maxn];
int Slack[maxn];
int N, M, E;
void init(){
	fill(G[0], G[0] + maxn * maxn, -INF);
}
bool Dfs(int x){
	vis_X[x] = 1;
	for (int i = 0; i < M; ++i) {
		if( vis_Y[i] ) continue;
		int Tmp = ex_X[x] + ex_Y[i] - G[x][i];
		if ( Tmp != 0) {
			Slack[i] = min(Tmp, Slack[i]);
		} else {
			vis_Y[i] = 1;
			if(Match[i] == -1 || Dfs(Match[i])){
				Match[i] = x;
				return true;
			}
		}
	}
	return false;

}
int KM(){
	memset (ex_X, 0, sizeof(ex_X));
	memset (ex_Y, 0, sizeof(ex_Y));
	memset (Match, -1, sizeof(Match));
	
	for(int i = 0; i < N; ++i){
		for(int j = 0; j < M; ++j){
			ex_X[i] = max(ex_X[i], G[i][j]);
		}
	}
	for (int i = 0; i < N; ++i) {
		memset (Slack, INF, sizeof(Slack));
		while(1){
			memset(vis_X, 0, sizeof(vis_X));
			memset(vis_Y, 0, sizeof(vis_Y));
			if (Dfs(i)) break;
			
			int Tmp = INF;
			
			for(int j = 0; j < M; ++j){
				if(vis_Y[j] == 0)
					Tmp = min(Tmp, Slack[j]);
			}
			
			if(Tmp == INF) return -1;
			
			for (int j = 0; j < N; ++j) {
				if(vis_X[j]) ex_X[j] -= Tmp;
			}
			for (int j = 0; j < M; ++j){
				if(vis_Y[j]) ex_Y[j] += Tmp;
				else Slack[j] -= Tmp;
			}
		}
	}
	int Ans = 0, Cnt = 0;
	for(int i = 0; i < M; ++i){
		if(Match[i] != -1){
			Ans += G[Match[i]][i];
			Cnt++;
		}
	}
	if(Cnt != N) Ans = -1;
	return Ans;
}
int main (){
	int Cas = 0;
	int u, v, c;
	while (~scanf("%d%d%d", &N, &M, &E)) {
		init();
		for (int i = 0; i < E; ++i) {
			scanf("%d%d%d", &u, &v, &c);
			if(c < 0) continue;
			G[u][v] = c;
		}
		printf("Case %d: %d\n", ++Cas, KM());
		
	}	
}