UVALive 5985 Robbing Gringotts（费用流 + 折半状压）

题目链接：https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3996

 

题意：有N个强盗要去抢M个房间，每个强盗有容量为Vi的背包，的每个房间有Xi个物品，每个物品容量为Wi，强盗进入房间后要么选取物品的子集合塞满背包要么一个不拿，且同一个房间不能被两个强盗抢，问所有强盗最终能抢到的最大重量和

 

思路：考虑复杂度问题，类似超大背包那样去折半枚举子集，并判断该子集的补集是否能被某强盗选取，如果能则记录下来，然后二部图建边跑费用流，注意左部点（强盗集合）可以直接连到汇点，容量为1费用为0代表此人不去房间抢东西

 

 

#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>
#include <string>

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

using namespace std;

const int MAXN = 1000;
const int MAXM = 1000000;
const int INF = 0x3f3f3f3f;

typedef long long ll;

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

int head[MAXN], tol;
int pre[MAXN], dis[MAXN];
bool vis[MAXN];
int N;//节点总个数，节点编号从0~N-1

void init(int n)
{
	N = n;
	tol = 0;
	memset(head, -1, sizeof(head));
}

void addedge(int u, int v, int cap, int cost)
{
	edge[tol].to = v;
	edge[tol].cap = cap;
	edge[tol].cost = cost;
	edge[tol].flow = 0;
	edge[tol].next = head[u];
	head[u] = tol++;
	edge[tol].to = u;
	edge[tol].cap = 0;
	edge[tol].cost = -cost;
	edge[tol].flow = 0;
	edge[tol].next = head[v];
	head[v] = tol++;
}

bool spfa(int s, int t)
{
	queue<int>q;
	for (int i = 0; i < N; i++)
	{
		dis[i] = INF;
		vis[i] = false;
		pre[i] = -1;
	}
	dis[s] = 0;
	vis[s] = true;
	q.push(s);
	while (!q.empty())
	{
		int u = q.front();
		q.pop();
		vis[u] = false;
		for (int i = head[u]; i != -1; i = edge[i].next)
		{
			int v = edge[i].to;
			if (edge[i].cap > edge[i].flow &&
			        dis[v] > dis[u] + edge[i].cost )
			{
				dis[v] = dis[u] + edge[i].cost;
				pre[v] = i;
				if (!vis[v])
				{
					vis[v] = true;
					q.push(v);
				}
			}
		}
	}
	if (pre[t] == -1) return false;
	else return true;
}

//返回的是最大流，cost存的是最小费用
int minCostMaxflow(int s, int t, int &cost)
{
	int flow = 0;
	cost = 0;
	while (spfa(s, t))
	{
		int Min = INF;
		for (int i = pre[t]; i != -1; i = pre[edge[i ^ 1].to])
		{
			if (Min > edge[i].cap - edge[i].flow)
				Min = edge[i].cap - edge[i].flow;
		}
		for (int i = pre[t]; i != -1; i = pre[edge[i ^ 1].to])
		{
			edge[i].flow += Min;
			edge[i ^ 1].flow -= Min;
			cost += edge[i].cost * Min;
		}
		flow += Min;
	}
	return flow;
}

int gra[MAXN][MAXN], g[MAXN][MAXN];
int x[MAXN], val[MAXN];

map <int, int> mp;
int n, m;

void solve()
{
	for (int i = 1; i <= m; i++)
	{
		mp.clear();
		int mid = x[i] / 2;

		for (int j = 0; j < (1 << mid); j++)
		{
			int s = 0;
			for (int k = 0; k < mid; k++)
			{
				if (j & (1 << k))
					s += g[i][k];
			}
			mp[s] = 1;
		}

		int res = x[i] - mid;
		for (int j = 0; j < (1 << res); j++)
		{
			int s = 0;
			for (int k = 0; k < res; k++)
			{
				if (j & (1 << k))
					s += g[i][mid + k];
			}

			for (int l = 1; l <= n; l++)
				if (mp.find(val[l] - s) != mp.end())
					gra[l][i] = val[l];
		}
	}
}

int main()
{
	int tt;
	cin >> tt;
	while (tt--)
	{
		cin >> n >> m;
		for (int i = 1; i <= n; i++)
			scanf("%d", &val[i]);
		for (int i = 1; i <= m; i++)
		{
			scanf("%d", &x[i]);
			for (int j = 0; j < x[i]; j++)
				scanf("%d", &g[i][j]);
		}
		memset(gra, 0, sizeof(gra));
		solve();

		int s = 0, t = n + m + 1;
		init(t + 1);

		for (int i = 1; i <= n; i++)
		{
			addedge(s, i, 1, 0);
			addedge(i, t, 1, 0);
		}

		for (int i = 1; i <= n; i++)
		{
			for (int j = 1; j <= m; j++)
				addedge(i, j + n, 1, -gra[i][j]);
		}

		for (int i = 1; i <= m; i++)
			addedge(i + n, t, 1, 0);

		int ans;
		minCostMaxflow(s, t, ans);
		cout << -ans << endl;
	}
	return 0;
}