hdu 4971 - 最大带权闭合子图

题目链接:点击这里

 

解题思路:最大带权闭合子图入门题.按照题目意思建图,然后跑网络流即可.

 

#include<bits/stdc++.h>
#define inf 0x3f3f3f3f
typedef long long ll;
using namespace std;
const int mx = 1e2 + 10;
int n,m,S,T,dep[mx],tot;
int head[mx],cur[mx];
struct node
{
    int y,nxt;
    int c;
}edge[mx*mx];
void init()
{
    tot = 0;
    memset(head,-1,sizeof(head));
}
void AddEdge(int x,int y,int c)
{
    edge[tot] = {y,head[x],c};
    head[x] = tot++;
    edge[tot] = {x,head[y],0};
    head[y] = tot++;
}
bool bfs()
{
    memset(dep,0,sizeof(dep));
    queue <int> que;
    que.push(S);
    dep[S] = 1;
    while(!que.empty())
    {
        int no = que.front();
        que.pop();
        for(int i=head[no];~i;i=edge[i].nxt)
        {
            int u = edge[i].y;
            if(!dep[u]&&edge[i].c){
                dep[u] = dep[no] + 1;
                que.push(u);
            }    
        }    
    }
    return dep[T];
}
int dfs(int x,int flow)
{
    if(x==T||!flow) return flow;
    int used = 0;
    for(int& i=cur[x];~i;i=edge[i].nxt)
    {
        int u = edge[i].y;
        if(dep[x]+1==dep[u]){
            int w = dfs(u,min(edge[i].c,flow-used));
            edge[i].c -= w;
            edge[i^1].c += w;
            used += w;
            if(used==flow) return flow;
        }
    }
    return used;
}
int maxflow()
{
    int ans = 0;
    while(bfs()){
        copy(head,head+mx,cur);
        ans += dfs(S,inf);
    }
    return ans;
}
int main()
{
    int t,a,k,ca = 1;
    scanf("%d",&t);
    while(t--){
        scanf("%d%d",&n,&m);
        S = 0,T = n+m+1;
        int ret = 0;
        init();
        for(int i=1;i<=n;i++){
            scanf("%d",&a);
            ret += a;
            AddEdge(S,i,a);
        }
        for(int i=1;i<=m;i++){
            scanf("%d",&a);
            AddEdge(i+n,T,a);
        }
        for(int i=1;i<=n;i++){
            scanf("%d",&k);
            while(k--){
                scanf("%d",&a);
                AddEdge(i,a+n+1,inf);
            }
        }
        for(int i=1;i<=m;i++){
            for(int j=1;j<=m;j++){
                scanf("%d",&a);
                if(a) AddEdge(i+n,j+n,inf);
            }
        }
        printf("Case #%d: %d\n",ca++,ret-maxflow());
    }
    return 0;
}