poj1149

破oj1149 （滑稽

膜板题

#include <cstdio>#include <cstring>#include <iostream>using namespace std;int n,m;int p[1010];int last[1010];bool con[110][110];int CON[110];struct edge {int v,f,next;}e[20010];int cnt = -1,head[110];int read_int () {char c = getchar();int re = 0;for(;c > '9' || c < '0';c = getchar());for(;c >= '0' && c <= '9';c = getchar())re = re * 10 + c - '0';return re;}void adde (int u,int v,int f) {e[++cnt].v = v;e[cnt].f = f;e[cnt].next = head[u];head[u] = cnt;e[++cnt].v = u;e[cnt].f = 0;e[cnt].next = head[v];head[v] = cnt;}int dis[110];int gap[110];int dfs(int u, int minf) {    if(u == n + 1)return minf;    int chan = n + 1;      int leftf = minf;    for(int i = head[u];i != -1;i = e[i].next) {          int v = e[i].v;        if(e[i].f > 0) {            if(dis[v] + 1 == dis[u]) {                int t = dfs(v,min(leftf,e[i].f));                e[i].f -= t;                  e[i ^ 1].f += t;                  leftf -= t;                  if(dis[0] >= n + 2)return minf - leftf;                if(leftf == 0)break;            }            if(dis[v] < chan)chan = dis[v];        }    }    if(leftf == minf) {        --gap[dis[u]];        if(gap[dis[u]] == 0)dis[0] = n + 2;        dis[u] = chan + 1;        ++gap[dis[u]];    }    return minf - leftf;}void sap() {    int ret = 0;    gap[0] = n + 2;    while(dis[0] < n + 2)ret += dfs(0,0x3f3f3f3f);    printf("%d\n",ret);}int main () {memset(head,-1,sizeof head);memset(CON,-1,sizeof CON);m = read_int();n = read_int();for(int i = 1;i <= m;++i)p[i] = read_int();for(int i = 1;i <= n;++i) {int t = read_int();for(int j = 1;j <= t;++j) {int T = read_int();if(last[T]) {if(!con[last[T]][i])adde(last[T],i,0x3f3f3f3f);con[last[T]][i] = 1;}else {if(p[T]) {if(CON[i] == -1) {adde(0,i,p[T]);CON[i] = cnt - 1;}else e[CON[i]].f += p[T];}}last[T] = i;}t = read_int();if(t)adde(i,n + 1,t);}sap();}