要邻接表才能过呢。。。
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<queue>
using namespace std;
#define INF 100000000struct edge
{int t,next,cap;
}e[250000];int head[1000],dist[1000];
int s,t,id;
queue<int> q;int min(int a,int b)
{return a>b?b:a;
}void addEdge(int u,int v,int c)
{e[id].t=v; e[id].cap=c;e[id].next=head[u]; head[u]=id++;e[id].t=u; e[id].cap=0;e[id].next=head[v]; head[v]=id++;
}bool bfs()
{memset(dist,-1,sizeof(dist));while( !q.empty() ) q.pop();dist[s]=0;q.push(s);while( !q.empty() ){int u=q.front();q.pop();for( int i=head[u] ; i!=-1 ; i=e[i].next ){if( e[i].cap && dist[e[i].t]==-1 ){dist[e[i].t]=dist[u]+1;q.push(e[i].t);}}}return dist[t]!=-1;
}int dfs(int u,int flow)
{if(u==t) return flow;int cf=0;for( int i=head[u]; i!=-1 ; i=e[i].next )if( e[i].cap && dist[e[i].t]==dist[u]+1 ){int t=dfs(e[i].t,min(flow,e[i].cap));if(t){cf+=t;e[i].cap-=t;e[i^1].cap+=t;if(cf==flow) return flow;}}if(!cf) dist[u]=-1;return cf;
}int dinic()
{int ans=0,res;while(bfs()){ans+=dfs(s,INF);}return ans;
}int main()
{
// freopen("in.txt","r",stdin);int n,f,d;while(scanf("%d %d %d",&n,&f,&d)==3){s=id=0;t=f+2*n+d+1;memset(head,-1,sizeof(head));for(int i=1;i<=f;i++){int a;scanf("%d",&a);addEdge(s,i,a);}for(int i=f+2*n+1;i<=f+2*n+d;i++){int a;scanf("%d",&a);addEdge(i,t,a);}for(int i=f+1;i<=f+n;i++){getchar();char c;for(int j=1;j<=f;j++){scanf("%c",&c);if(c=='Y')addEdge(j,i,1);else addEdge(j,i,0);}}for(int i=f+n+1;i<=f+n+n;i++){getchar();char c;for(int j=f+n+n+1;j<=f+2*n+d;j++){scanf("%c",&c);if(c=='Y')addEdge(i,j,1);else addEdge(i,j,0);}}for(int i=f+1;i<=f+n;i++)addEdge(i,i+n,1);int ans=dinic();printf("%d\n",ans);}return 0;
}