2013金山西山居创意游戏程序挑战赛——复赛（1） 我是歌手

最大流、二分查找

由题意可推断出最大场数不超过M，假设分配给每个人x场，如果满足K值的限制，则最后歌曲的排列组合肯定能达到每场每个人演唱的歌曲类型不相同

如果x场能满足上述条件，则y(y<x)场也能满足，因此二分查找比顺序查找更好

套sap的模板

#include <stdio.h>
#include <string.h>
#include <math.h>
const int MAXN = 250;
const int INF = 0x3fffffff;
int n, m, l, k;
int data[MAXN][MAXN];
int G[MAXN], D[MAXN], pre[MAXN], cur[MAXN], val[MAXN][MAXN];
// sap算法模板：
// G: 标号为i的点的个数，如果G[i]为0，则出现断层，退出循环
// D: 第i个节点的标号，每次取D[i]==D[j]+1，作为下次的起点
// pre: 第i个节点的前驱
// cur: 对于第i个节点，下次寻找扩曾路径的起始点
// val: 原图的反向路径
inline int min(int a, int b)
{
	return a<b?a:b;
}
int SAP(int t, int cnt)
{
	memset(G, 0, sizeof G);
	memset(D, 0, sizeof D);
	memset(cur, 0, sizeof cur);
	memset(val, 0, sizeof val);
	int min_cur = INF, max_all = 0, now = 0, nxt;
	pre[0] = 0;
	G[0] = cnt;
	bool flag;
	while (D[0] < cnt)
	{
		flag = false;
		for (nxt = cur[now]; nxt< cnt; nxt++)
		{
			if (data[now][nxt]-val[now][nxt]>0 && D[now] == D[nxt]+1)
			{
				min_cur = min(min_cur, data[now][nxt]-val[now][nxt]);
				cur[now] = nxt;
				pre[nxt] = now;
				now = nxt;
				if (nxt == t)
				{
					max_all += min_cur;
					for (now = pre[nxt]; nxt != 0; nxt = now, now = pre[now])
					{
						val[now][nxt] += min_cur;
						val[nxt][now] -= min_cur;
					}
					min_cur = INF;
				}
				flag = true;
				break;
			}
		}
		if (flag) continue;
		int mincnt = cnt-1;
		for ( nxt = 0; nxt < cnt; nxt++)
		{
			if (data[now][nxt] - val[now][nxt]>0 && mincnt > D[nxt])
			{
				mincnt = D[nxt];
				cur[now] = nxt;
			}
		}
		if (--G[D[now]] == 0) break;
		G[D[now]=mincnt+1]++;
		now = pre[now];
	}
	return max_all;
}

int main()   
{
#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
#endif
	int t, cs = 0;
	int i, j;
	scanf("%d", &t);
	while (t--)
	{
		printf("Case %d: ", ++cs);
		scanf("%d%d%d%d", &n, &m, &l, &k);
		int a, b;
		memset(data, 0, sizeof data);
		for (i = 1; i<= m; i++)
			data[n+i][n+m+i] = k;
		for ( i = 0; i< l; i++)
		{
			scanf("%d%d", &a, &b);
			data[a][n+m+b] = 1;
		}
		for (i = 1; i<= n; i++)
		{
			for (j = n+1; j<= n+m; j++)
			{
				if (!data[i][j+m])
					data[i][j] = 1;
			}
		}
		int res = 0;
		// 二分查找
		for ( int bg = 0, ed = m; bg <= ed ;)
		{
			int mid = (bg+ed)/2;
			for (i = 1; i<= n; i++) data[0][i] = mid;
			for (i = n+m+1; i<= n+m+m; i++) data[i][n+m+m+1] = mid;
			if (SAP(n+m+m+1, n+m+m+2) == mid*n)
				res = mid, bg = mid+1;
			else
				ed = mid-1;
		}
		printf("%d\n", res);
	}
	return 0;
}