最大权闭合图

// 最大权闭合图 
#include
   
   
    
    
#include
    
    
     
     
#include
     
     
      
      
#include
      
      
       
       
using namespace std;
const int inf = (int) 1e9;
const int maxn = 70 + 10;
struct Edge{
    int u ,v, cap, next;
    Edge(int u = 0, int v = 0 ,int cap = 0, int next = -1){
        this ->u = u, this ->v = v, this ->cap = cap, this ->next = next;
    }
};

Edge edge[maxn * maxn];

int dist[maxn], vis[maxn], head[maxn],cur[maxn],cnt_edge;

void init(){
    cnt_edge = 0;
    memset(head,-1,sizeof(head));
}

void add(int u ,int v,int cap){
    edge[cnt_edge] = Edge(u,v,cap,head[u]);
    head[u] = cnt_edge ++;
    edge[cnt_edge] = Edge(v,u,0,head[v]);
    head[v] = cnt_edge ++;
}

bool bfs(int s,int t ,int n){

    queue
       
       
         Q; while(!Q.empty()) Q.pop(); memset(vis,0,sizeof(vis)); for(int i = 0;i <= n; ++ i) dist[i] = inf; vis[s] = 1, dist[s] = 0, Q.push(s); while(!Q.empty()){ int now = Q.front(); Q.pop(); vis[now] = 0; for(int i = head[now]; i != -1;i = edge[i].next){ Edge & e = edge[i]; if(dist[e.v] > dist[now] + 1 && e.cap){ dist[e.v] = dist[now] + 1; if(!vis[e.v]){ vis[e.v] = 1; Q.push(e.v); } } } } return dist[t] < inf; } int dfs(int x, int t,int a){ if(x == t || !a) return a; int f, flow = 0; for(int & i = cur[x];- 1 != i;i = edge[i].next){ Edge & e = edge[i]; if(dist[e.v] == dist[x] + 1 && e.cap && (f = dfs(e.v,t,min(a,e.cap)))){ a -= f; flow += f; e.cap -= f; edge[i^1].cap +=f; if(!a) break; } } return flow; } int maxflow(int s,int t,int n){ int flow = 0; while(bfs(s,t,n)){ for(int i = 0;i <= n;++i){ cur[i] = head[i]; } flow += dfs(s,t,inf); } return flow; } int main(){ int cas, T = 1; scanf("%d",&cas); while(cas --){ int n ,m; int sum = 0; init(); scanf("%d%d",&n,&m); int s = 0, t = n + m + 1; for(int i = 1; i<= n; ++ i){ int val; scanf("%d",&val); add(s,i,val); sum += val; } for(int i = 1; i<= m; ++ i){ int val; scanf("%d",&val); add(i + n , t, val); } for(int i = 1; i<= n; ++ i){ int k; scanf("%d",&k); while(k --){ int a; scanf("%d",&a); add(i,a + n + 1,inf); } } for(int i = 1; i<= m; ++ i) for(int j = 1; j<= m; ++ j){ bool ok; scanf("%d",&ok); if(ok) add(i + n ,j + n ,inf); } int ans = sum - maxflow(s,t,t); printf("Case #%d: %d\n",T++,ans); } return 0; }