From Evernote:

uva 10330

Ed karp

[sourcecode language="cpp"]
//============================================================================
// Name : Power Transmission.cpp
// Date : 2013 2013/2/3 下午3:31:37
// Author : GCA
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
printf("%d ",dp[htx][hty]);}Pln();}
#define M 202
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
struct node{
int to,cap;
node(int to,int cap):to(to),cap(cap){};
node(){};
};
int q[900000];
vector<node> mz[M];
int n,w;
int f[M][M];

int ed(int src,int end){
int father[M];
int front,rear,u,v,c,flow[M];
Set(f,0);
int maxflow=0;
while(1){
front=rear=0;
q[front++]=src;
Set(flow,0);
flow[src]=oo;
while(front>rear){
u=q[rear++];
FOR(it,mz[u]){
v=(*it).to,c=(*it).cap;
if(!flow[v]&&c-f[u][v]){
flow[v]=min(flow[u],c-f[u][v]);
q[front++]=v;
father[v]=u;
}
}
}
// debug("src%d end%d %d\n",src,end,flow[end]);
if(!flow[end])return maxflow;
maxflow+=flow[end];
for(int i=end;i!=src;i=father[i]){
f[father[i]][i]+=flow[end];
f[i][father[i]]-=flow[end];
}
}
return maxflow;
}

int main() {
ios_base::sync_with_stdio(0);
while(~scanf("%d",&n)){
int b,d,tmp;
for(int i=0;i<n;i++){
scanf("%d",&tmp);
mz[i].PB(node(i+n,tmp));
mz[i+n].PB(node(i,0));
}
scanf("%d",&w);
int u,v,c;
for(int i=0;i<w;i++){
scanf("%d%d%d",&u,&v,&c);
u--,v--;
mz[u+n].PB(node(v,c));
mz[v].PB(node(u+n,0));
}
// int b,d,tmp;
scanf("%d%d",&b,&d);
while(b--){
scanf("%d",&tmp);
mz[n<<1].PB(node(tmp-1,oo));
}
while(d--){
scanf("%d",&tmp);
tmp--;
mz[tmp+n].PB(node(n<<1|1,oo));
}
printf("%d\n",ed(n<<1,n<<1|1));
for(int i=0;i<=2*n;i++)mz[i].clear();

}

}

[/sourcecode]