ZOJ 3760 Treasure Hunting（最大流）

题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3760

 

题意：给出一些点，每个点的价值为xi & yi，要求选出点集任意两点满足gcd(xi ^ yi ^ xj ^ yj, p) > 1，求点集最大价值

 

思路：因为p是偶数，所以要求i, j两点必须(xi ^ yi)与(xj ^ yj)必须同奇或同偶，故而可以按xi ^ yi的奇偶性建出二分图，然后对于那些不满足gcd(xi ^ yi ^ xj ^ yj, p) > 1的点集连边，问题就变成了最大点权独立集问题，可以求最大流，总价值减去最大流即为最大点权独立集

 

 

 

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <climits>
#include <functional>
#include <deque>
#include <ctime>

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#pragma comment(linker, "/STACK:102400000,102400000")

using namespace std;

typedef long long Int;

const Int MAXN = 1000;
const Int MAXM = 500010;
const Int INF = 0x3f3f3f3f3f3f3f3f;

struct Edge
{
	Int to, next, cap, flow;
} edge[MAXM];

Int tol;
Int Head[MAXN];
Int gap[MAXN], dep[MAXN], cur[MAXN];

void init()
{
	tol = 0;
	memset(Head, -1, sizeof(Head));
}

void addedge(Int u, Int v, Int w, Int rw = 0)
{
	edge[tol].to = v;
	edge[tol].cap = w;
	edge[tol].flow = 0;
	edge[tol].next = Head[u];
	Head[u] = tol++;
	edge[tol].to = u;
	edge[tol].cap = rw;
	edge[tol].flow = 0;
	edge[tol].next = Head[v];
	Head[v] = tol++;
}

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 = edge[i].next)
		{
			Int v = edge[i].to;
			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 > edge[S[i]].cap - edge[S[i]].flow)
				{
					Min = edge[S[i]].cap - edge[S[i]].flow;
					inser = i;
				}
			for (Int i = 0; i < top; i++)
			{
				edge[S[i]].flow += Min;
				edge[S[i] ^ 1].flow -= Min;
			}
			ans += Min;
			top = inser;
			u = edge[S[top] ^ 1].to;
			continue;
		}
		bool flag = false;
		Int v;
		for (Int i = cur[u]; i != -1; i = edge[i].next)
		{
			v = edge[i].to;
			if (edge[i].cap - edge[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 = edge[i].next)
			if (edge[i].cap - edge[i].flow && dep[edge[i].to] < Min)
			{
				Min = dep[edge[i].to];
				cur[u] = i;
			}
		gap[dep[u]]--;
		if (!gap[dep[u]])return ans;
		dep[u] = Min + 1;
		gap[dep[u]]++;
		if (u != start)u = edge[S[--top] ^ 1].to;
	}
	return ans;
}

Int gcd(Int x, Int y)
{
	return y == 0 ? x : gcd(y, x % y);
}

Int x[MAXN], y[MAXN], l[MAXN], r[MAXN];

int main()
{
	Int n, p;
	while (~scanf("%lld%lld", &n, &p))
	{
		init();

		Int s = 0, t = n + 1;
		Int cnt1 = 0, cnt2 = 0, sum = 0;

		for (Int i = 1; i <= n; i++)
		{
			scanf("%lld%lld", &x[i], &y[i]);
			sum += x[i] & y[i];

			Int mx = x[i] % 2, my = y[i] % 2;
			if ((mx + my) % 2 == 0)
				l[++cnt1] = i;
			else
				r[++cnt2] = i;
		}

		for (Int i = 1; i <= cnt1; i++)
			addedge(s, l[i], x[l[i]] & y[l[i]]);
		for (Int i = 1; i <= cnt2; i++)
			addedge(r[i], t, x[r[i]] & y[r[i]]);

		for (Int i = 1; i <= cnt1; i++)
			for (Int j = 1; j <= cnt2; j++)
				if (gcd(x[l[i]] ^ y[l[i]] ^ x[r[j]] ^ y[r[j]], p) == 1)
					addedge(l[i], r[j], INF);

		Int ans = sum - sap(s, t, t + 1);
		cout << ans << endl;
	}
	return 0;
}