题目链接:http://acm.fzu.edu.cn/problem.php?pid=2295
题意:有n种技能,技能有前置技能,学技能要花钱,有m种工作,工作有前置技能(需要学了这个技能才能做这份工作),工作可以挣钱,然后给出k,有k组工作冲突(即不能同时选)。
思路:这种有前置要求的,有价值和消耗的一般都是最大权闭合子图。这个题直接按最大权闭合子图建图,但是这里有一个条件k,这里k很小,只有<=5,所以暴力枚举每种情况(状压的思想)。
代码:
#include <cstdio>
#include <cmath>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <string>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define fuck(x) cout<<"<"<<x<<">"<<endl
#define fi first
#define se second
#define pb push_back
#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
using namespace std;
typedef long long LL;
typedef unsigned long long uLL;
typedef pair<int, int> pii;
const double PI = acos(-1.0);
const LL INFLL = 0x3f3f3f3f3f3f3f3fll;
const int maxn = 2e5 + 5;
const int mod = 1e9 + 7;
int T;
int n,m,k,s,t;
int c[205],v[205],vis[205];
vector<int>sk[205],jb[205];
pii p[6];
struct edge {
int to , cap , rev ;
};
vector<edge> G[205];
int level[205];
int iter[205];
void addedge(int from, int to, int cap) {
G[from].push_back( (edge) {
to, cap, G[to].size()
} );
G[to].push_back( (edge) {
from, 0, G[from].size() - 1
} );
}
void bfs(int s) {
memset(level, -1, sizeof(level));
queue<int>que;
level[s] = 0;
que.push(s);
while (!que.empty()) {
int v = que.front();
que.pop();
for (int i = 0; i < G[v].size(); i++) {
edge &e = G[v][i];
if (e.cap > 0 && level[e.to] < 0) {
level[e.to] = level[v] + 1;
que.push(e.to);
}
}
}
}
int dfs(int v, int t, int f) {
if (v == t) return f;
for (int &i = iter[v]; i < G[v].size(); i++) {
edge &e = G[v][i];
if (e.cap > 0 && level[v] < level[e.to]) {
int d = dfs(e.to, t, min(f, e.cap));
if (d > 0) {
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
int Maxflow(int s, int t) {
int flow = 0;
for (;;) {
bfs(s);
if (level[t] < 0) return flow;
memset(iter, 0 , sizeof(iter));
int f;
while ( (f = dfs( s , t , INF ) ) > 0) {
flow += f;
}
}
}
int main() {
scanf ("%d",&T);
while (T--){
for (int i=0;i<204;i++) sk[i].clear(),jb[i].clear(),G[i].clear();
scanf ("%d%d%d",&n,&m,&k);
for (int i=1;i<=n;i++){
int num;
scanf ("%d%d",&c[i],&num);
for (int j=0;j<num;j++) {
int x;
scanf ("%d",&x);
sk[i].pb(x);
}
}
for (int i=1;i<=m;i++){
int num;
scanf ("%d%d",&v[i],&num);
for (int j=0;j<num;j++){
int x;
scanf ("%d",&x);
jb[i].pb(x);
}
}
for (int i=0;i<k;i++) scanf ("%d%d",&p[i].fi,&p[i].se);
int ans=0;
for (int sta=0;sta<(1<<k);sta++){
memset(vis,0,sizeof(vis));
int s=sta;
for (int i=k-1;i>=0;i--){
int tmp=(s&1);
if (tmp==0) vis[p[i].se]=1;
else vis[p[i].fi]=1;
s>>=1;
}
s=0,t=201;
int sum=0;
for (int i=1;i<=m;i++){
if (vis[i]) continue;
addedge(s,i,v[i]);
sum+=v[i];
for (int j=0;j<jb[i].size();j++){
addedge(i,100+jb[i][j],INF);
}
}
for (int i=1;i<=n;i++){
addedge(i+100,t,c[i]);
for (int j=0;j<sk[i].size();j++){
addedge(i+100,sk[i][j]+100,INF);
}
}
int qq=sum-Maxflow(s,t);
ans=max(ans,qq);
}
printf ("%d\n",ans);
}
return 0;
}