bzoj4177: Mike的农场

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define clr(x,c) memset(x,c,sizeof(x))
#define op() pt=edges;clr(head,0)
int read(){
	int x=0;char c=getchar();
	while(!isdigit(c)) c=getchar();
	while(isdigit(c)) x=x*10+c-‘0‘,c=getchar();
	return x;
}
const int nmax=11000;
const int maxn=10000000;
const int inf=0x7f7f7f7f;
struct edge{
	int to,cap;edge *next,*rev;
};
edge edges[maxn],*pt,*head[nmax],*p[nmax],*cur[nmax];
int cnt[nmax],h[nmax];
void add(int u,int v,int d){
	pt->to=v;pt->cap=d;pt->next=head[u];head[u]=pt++;
}
void adde(int u,int v,int d){
	add(u,v,d);add(v,u,0);head[u]->rev=head[v];head[v]->rev=head[u];
}
int maxflow(int s,int t,int n){
	clr(cnt,0);cnt[0]=n;clr(h,0);
	int flow=0,a=inf,x=s;edge *e;
	while(h[s]<n){
		for(e=cur[x];e;e=e->next) if(e->cap>0&&h[x]==h[e->to]+1) break;
		if(e){
			a=min(a,e->cap);p[e->to]=cur[x]=e;x=e->to;
			if(x==t){
				while(x!=s) p[x]->cap-=a,p[x]->rev->cap+=a,x=p[x]->rev->to;
				flow+=a,a=inf;
			}
		}else{
			if(!--cnt[h[x]]) break;
			h[x]=n;
			for(e=head[x];e;e=e->next) if(e->cap>0&&h[x]>h[e->to]+1) h[x]=h[e->to]+1,cur[x]=e;
			cnt[h[x]]++;
			if(x!=s) x=p[x]->rev->to;
		}
	}
	return flow;
}
int main(){
	op();//pt=edges;clr(head,0);
	int sum=0,n=read(),m=read(),k=read(),s=0,t=n+1,cur=t,tmp;
	rep(i,n) tmp=read(),sum+=tmp,adde(s,i,tmp);
	rep(i,n) tmp=read(),sum+=tmp,adde(i,t,tmp);
	rep(i,m){
		int u=read(),v=read(),w=read();
		adde(u,v,w);adde(v,u,w);
	}
	rep(i,k){
		int u=read(),v=read(),w=read();++cur;sum+=w;
		if(!v) rep(j,u) adde(cur,read(),inf);
		else rep(j,u) adde(read(),cur,inf);
		if(!v) adde(s,cur,w);else adde(cur,t,w);
	}
	printf("%d\n",sum-maxflow(s,t,cur+1));
	return 0;
}