【二分图完美匹配】【KM算法】hdu2255 奔小康赚大钱 && hdu1853 Cyclic Tour

找了10道题打算刷 结果写了两道不想写了。。。。

因为题都比较水 = =然后英文题看着实在是跪。。。英文渣怎么办嘛。。。

hdu2255 奔小康赚大钱

练代码的水题= =10分钟秒

#include <cstdio>
#include <iostream>
#include <cstring>

using namespace std;

int read()
{
	int sign = 1, n = 0; char c = getchar();
	while(c < '0' || c > '9'){ if(c == '-') sign = -1; c = getchar(); }
	while(c >= '0' && c <= '9') { n = n*10 + c-'0'; c = getchar(); }
	return sign*n;
}

const int M = 305;
const int inf = 0x3f3f3f3f;

int N;
int w[M][M];
int lx[M], ly[M], match[M], slack[M];
bool visx[M], visy[M]; 

bool dfs(int u)
{
	visx[u] = 1;
	for(int v = 1; v <= N; ++v)
	{
		if(visy[v]) continue;
		int t = lx[u] + ly[v] - w[u][v];
		if(t == 0)
		{
			visy[v] = 1;
			if(match[v] == -1 || dfs(match[v]))
			{
				match[v] = u;
				return true;
			}
		}
		else if(slack[v] > t) slack[v] = t;
	}
	return false;
}

inline void adjust()
{
	int d = inf;
	for(int i = 1; i <= N; ++i) if(!visy[i] && slack[i] < d) d = slack[i];
	for(int i = 1; i <= N; ++i) if(visx[i]) lx[i] -= d;
	for(int i = 1; i <= N; ++i) if(visy[i]) ly[i] += d; else slack[i] -= d;
}

int KM()
{	
	memset(match, -1, sizeof(match));
	memset(ly, 0, sizeof(ly));
	for(int i = 1; i <= N; ++i)
	{
		lx[i] = -inf; 
		for(int j = 1; j <= N; ++j) if(w[i][j] > lx[i]) 
			lx[i] = w[i][j]; 
	}
	
	for(int i = 1; i <= N; ++i)
	{
		for(int j = 1; j <= N; ++j) slack[j] = inf;
		for( ; ; )
		{
			memset(visx, 0, sizeof(visx));
			memset(visy, 0, sizeof(visy));
			if(dfs(i)) break;
			else adjust();
		}
	}
	
	int ans = 0;
	for(int i = 1; i <= N; ++i) ans += w[match[i]][i];
	return ans;
}

int main()
{
	while(~scanf("%d", &N))
	{
		for(int i = 1; i <= N; ++i)
		for(int j = 1; j <= N; ++j)
			w[i][j] = read();
		
		printf("%d\n", KM());
	}
	
	return 0;
}

hdu1853 Cyclic Tour

最小费用覆盖圈 = = 可以看出来合法情况每个点的出度和入度均为一 所以拆成两个点最大匹配orz 

网上好多题解是费用流← ← 感觉跑费用流会很慢的吧

#include <cstdio>
#include <iostream>
#include <cstring>

using namespace std;

int read()
{
	int sign = 1, n = 0; char c = getchar();
	while(c < '0' || c > '9'){ if(c == '-') sign = -1; c = getchar(); }
	while(c >= '0' && c <= '9') { n = n*10 + c-'0'; c = getchar(); }
	return sign*n;
}

const int inf = 0x3f3f3f3f;

int N, M;
int map[105][105];
int lx[105], ly[105], match[105], slack[105];
bool visx[105], visy[105];

bool dfs(int u)
{
	visx[u] = 1;
	for(int v = 1; v <= N; ++v)
	{
		if(visy[v]) continue;
		int t = lx[u] + ly[v] - map[u][v];
		if(t == 0)
		{
			visy[v] = 1;
			if(match[v] == -1 || dfs(match[v]))
			{
				match[v] = u;
				return 1;
			}
		}
		else if(t < slack[v]) slack[v] = t;
	}
	return false;
}

inline void adjust()
{
	int d = inf;
	for(int i = 1; i <= N; ++i) if(!visy[i] && slack[i] < d) d = slack[i];
	for(int i = 1; i <= N; ++i) if(visx[i]) lx[i] -= d;
	for(int i = 1; i <= N; ++i) if(visy[i]) ly[i] += d; else slack[i] -= d;
}

int KM()
{
	memset(ly, 0, sizeof(ly));
	memset(match, -1, sizeof(match));
	for(int i = 1; i <= N; ++i)
	{
		lx[i] = -inf;
		for(int j = 1; j <= N; ++j) if(map[i][j] > lx[i])
			lx[i] = map[i][j];
	}
	
	for(int i = 1; i <= N; ++i)
	{
		for(int j = 1; j <= N; ++j) slack[j] = inf;
		for( ; ; )
		{
			memset(visx, 0, sizeof(visx));
			memset(visy, 0, sizeof(visy));
			if(dfs(i)) break;
			else adjust();
		}
	}
	
	int ans = 0;
	for(int i = 1; i <= N; ++i)
	{
		if(map[match[i]][i] < -0x3f3f) return -1;
		else ans -= map[match[i]][i];
	} 
	return ans;
}

int main()
{
	while(~scanf("%d%d", &N, &M))
	{
		memset(map, -inf, sizeof(map));
		for(int i = 1; i <= M; ++i)
		{
			int u = read(), v = read(), w = read();
			if(map[u][v] < -w) map[u][v] = -w;
		}
		printf("%d\n", KM());
	}
	return 0;
}