poj 1149 pigs

这个地方的建模不容易啊。。。

而且还有就是自己敲的时候凭自己想，，结果错了多次。。

还有就是人与人之间的连接不是随便连的，，，

而是要的才连过去。。我已开始以为是 k区间覆盖一样连。

#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<queue>
using namespace std;
#define mem(a,b) memset(a,b,sizeof(a));
#define sf scanf
#define pf printf
#define LL long long
#define bug1  cout<<"bug1"<<endl;
#define bug2  cout<<"bug2"<<endl;
#define bug3  cout<<"bug3"<<endl;

const int maxn=2205;
const int INF=1e9;

struct Edge {
  int from, to, cap, flow;
};

bool operator < (const Edge& a, const Edge& b) {
  return a.from < b.from || (a.from == b.from && a.to < b.to);
}

struct Dinic {
  int n, m, s, t;
  vector<Edge> edges;
  vector<int> G[maxn];
  bool vis[maxn];
  int d[maxn];
  int cur[maxn];

  void init(int n) {
    for(int i = 0; i < n; i++) G[i].clear();
    edges.clear();
  }

  void ClearFlow() {
    for(int i = 0; i < edges.size(); i++) edges[i].flow = 0;
  }

  void addedge(int from, int to, int cap) {
    edges.push_back((Edge){from, to, cap, 0});
    edges.push_back((Edge){to, from, 0, 0});
    m = edges.size();
    G[from].push_back(m-2);
    G[to].push_back(m-1);
  }

  bool BFS() {
    memset(vis, 0, sizeof(vis));
    queue<int> Q;
    Q.push(s);
    vis[s] = 1;
    d[s] = 0;
    while(!Q.empty()) {
      int x = Q.front(); Q.pop();
      for(int i = 0; i < G[x].size(); i++) {
        Edge& e = edges[G[x][i]];
        if(!vis[e.to] && e.cap > e.flow) {
          vis[e.to] = 1;
          d[e.to] = d[x] + 1;
          Q.push(e.to);
        }
      }
    }
    return vis[t];
  }

  int DFS(int x, int a) {
    if(x == t || a == 0) return a;
    int flow = 0, f;
    for(int& i = cur[x]; i < G[x].size(); i++) {
      Edge& e = edges[G[x][i]];
      if(d[x] + 1 == d[e.to] && (f = DFS(e.to, min(a, e.cap-e.flow))) > 0) {
        e.flow += f;
        edges[G[x][i]^1].flow -= f;
        flow += f;
        a -= f;
        if(a == 0) break;
      }
    }
    return flow;
  }

  int maxflow(int s, int t) {
    this->s = s; this->t = t;
    int flow = 0;
    while(BFS()) {
      memset(cur, 0, sizeof(cur));
      flow += DFS(s, INF);
    }
    return flow;
  }

  vector<int> Mincut() {
    vector<int> ans;
    for(int i = 0; i < edges.size(); i++) {
      Edge& e = edges[i];
      if(vis[e.from] && !vis[e.to] && e.cap > 0) ans.push_back(i);
    }
    return ans;
  }

  void Reduce() {
    for(int i = 0; i < edges.size(); i++) edges[i].cap -= edges[i].flow;
  }
};

Dinic g;

int m,n;
int pig[maxn];
int flag[maxn];
int main(){
    while(~sf("%d%d",&m,&n)){
        g.init(n+m+2);int s=0,t=n+m+1;
        int sum=0;
        for(int i=1;i<=m;++i){
            sf("%d",&pig[i]);
            flag[i]=0;
            sum+=pig[i];
        }
        for(int i=1;i<=n;++i){
            int cnt;
            sf("%d",&cnt);
            int tmpsum=0;
            while(cnt--){
                int tmp;
                sf("%d",&tmp);
                if(!flag[tmp]){
                    flag[tmp]=i+m;
                    tmpsum+=pig[tmp];
                }
                else{
                    g.addedge(flag[tmp],i+m,INF);
                    flag[tmp]=i+m;
                }
            }
            int tmp;sf("%d",&tmp);
            g.addedge(s,i+m,tmpsum);
            g.addedge(i+m,t,tmp);
        }
        int ans=g.maxflow(s,t);
        pf("%d\n",ans);

    }

}