HDU 3277 Marriage Match III (最大流+拆点+并查集)

思路:其实这道题抄完之后,回想一下,和上一道题其实几乎完全一样.

不同的在于,这道题的女生可以选择k个和自己吵过架的男生.

所以在建图的时候,女生有一条容量为k的边,连向和自己吵过架的男生,并且中间一个节点来.

也就是将女生拆成两个点,一个点连接源点,容量依然是最大的配对数量mid

这个点与没吵过架的男生都有一条1的边.

另外一个点与吵过架的男生有1的边.与这一点有容量为k的边就可以了.

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define MAXN 1000
#define MAXM 100000
#define INF 0x7ffffff
int head[MAXN], dep[MAXN], gap[MAXN], cur[MAXN];
int f[MAXN];
int h[MAXN][MAXN];
int cnt;
int bit[11];
int n, m, ff;
struct edge
{
	int v;
	int cap;
	int flow;
	int next;
}edg[MAXM];

struct node
{
	int x, y;
}no[MAXM];
void init()
{
	cnt = 0;
	memset(head, -1, sizeof(head));
}

int find(int x)
{
	int r = x;
	while (f[r] != r)
		r = f[r];
	f[x] = r;
	return f[x];
}

void Union(int x, int y)
{
	int fx, fy;
	fx = find(x);
	fy = find(y);
	if (fx != fy)
		f[fx] = fy;
}


void addedge(int u, int v, int w, int rw = 0)
{
	edg[cnt].v = v;
	edg[cnt].cap = w;
	edg[cnt].flow = 0;
	edg[cnt].next = head[u];
	head[u] = cnt++;
	edg[cnt].v = u;
	edg[cnt].cap = rw;
	edg[cnt].flow = 0;
	edg[cnt].next = head[v];
	head[v] = cnt++;
}
void build(int k,int val)
{
	init();
	int E = 3 * n + 1;
	for (int i = 1; i <= n; i++)
	{
		addedge(0, i, val);
		addedge((n<<1) + i, E, val);
	}
	memset(h, 0, sizeof(h));
	for (int i = 0; i < m; i++)
	{
		int x = no[i].x;
		int y = no[i].y;
		//枚举和x女孩是朋友的女孩，则可以和他的男朋友连一条边
		for (int j = 1; j <= n; j++)
		if (f[x] == f[j] && !h[j][y])
		{
			//hash来避免建重边
			addedge(j, (n<<1) + y, 1);
			h[j][y] = 1;
		}
	}
	for (int j = 1; j <= n; j++)
	{
		addedge(j, n + j, k);
		for (int i = 1; i <= n; i++)
		if (!h[j][i])
		{
			addedge(n + j, (n<<1) + i, 1);
			h[j][i] = 1;
		}
	}
}

int Q[MAXN];
void BFS(int start, int end)
{
	memset(dep, -1, sizeof(dep));
	memset(gap, 0, sizeof(gap));
	gap[0] = 1;
	int front = 0, rear = 0;
	dep[end] = 0;
	Q[rear++] = end;
	while (front != rear)
	{
		int u = Q[front++];
		for (int i = head[u]; i != -1; i = edg[i].next)
		{
			int v = edg[i].v;
			if (dep[v] != -1)continue;
			Q[rear++] = v;
			dep[v] = dep[u] + 1;
			gap[dep[v]]++;
		}
	}

}

int S[MAXN];
int sap(int start, int end, int n)
{
	BFS(start, end);
	memcpy(cur, head, sizeof(head));
	int top = 0;
	int u = start;
	int ans = 0;
	while (dep[start] < n)
	{
		if (u == end)
		{
			int Min = INF;
			int inser;
			for (int i = 0; i < top; i++)
			if (Min>edg[S[i]].cap - edg[S[i]].flow)
			{
				Min = edg[S[i]].cap - edg[S[i]].flow;
				inser = i;
			}
			for (int i = 0; i < top; i++)
			{
				edg[S[i]].flow += Min;
				edg[S[i] ^ 1].flow -= Min;
			}
			ans += Min;
			top = inser;
			u = edg[S[top] ^ 1].v;
			continue;
		}
		bool flag = false;
		int v;
		for (int i = cur[u]; i != -1; i = edg[i].next)
		{
			v = edg[i].v;
			if (edg[i].cap - edg[i].flow&&dep[v] + 1 == dep[u])
			{
				flag = true;
				cur[u] = i;
				break;
			}
		}
		if (flag)
		{
			S[top++] = cur[u];
			u = v;
			continue;
		}
		int Min = n;
		for (int i = head[u]; i != -1; i = edg[i].next)
		if (edg[i].cap - edg[i].flow&&dep[edg[i].v] < Min)
		{
			Min = dep[edg[i].v];
			cur[u] = i;
		}
		gap[dep[u]]--;
		if (!gap[dep[u]])return ans;
		dep[u] = Min + 1;
		gap[dep[u]]++;
		if (u != start)u = edg[S[--top] ^ 1].v;
	}
	return ans;
}

int Scan()//读入外挂  
{
	int res = 0, ch, flag = 0;

	if ((ch = getchar()) == '-')                //判断正负  
		flag = 1;

	else if (ch >= '0' && ch <= '9')            //得到完整的数  
		res = ch - '0';
	while ((ch = getchar()) >= '0' && ch <= '9')
		res = res * 10 + ch - '0';

	return flag ? -res : res;
}

int main()
{
	int t;
	cin >> t;
	int k;
	while (t--)
	{
		n = Scan();
		m = Scan();
		k = Scan();
		ff = Scan();
		for (int i = 1; i <= n; i++)
			f[i] = i;
		for (int i = 0; i < m; i++)
		{
			no[i].x = Scan();
			no[i].y = Scan();
		}
		int x, y;
		for (int i = 0; i < ff; i++)
		{
			x = Scan();
			y = Scan();
			Union(x, y);
		}
		int l = 0;
		int r = n;
		int ans = 0;
		for (int i = 1; i <= n; i++)
			f[i] = find(i);
		while (l <= r)
		{
			int mid = (l + r) >> 1;
			build(k,mid);
			if (sap(0, 3 * n + 1, 3 * n + 1) == mid*n)
			{
				ans = mid;
				l = mid + 1;
			}
			else
				r = mid - 1;
		}
		printf("%d\n", ans);
	}
}