uva753最大流

思路：源点到插头容量为1的边，插头到插头(适配器)容量为INF的边，插头到电器容量为1，电器到汇点同容量为1.

#include<iostream>
#include<string>
#include<cstring>
#include<cstdio>
#include<map>
#include<queue>
using namespace std;
const int maxm=10000;
const int maxn=310;
const int INF=(1<<30);
struct node
{
    int v,next,f;
}edge[maxm*2];
int n,nn,num;
int head[maxn],pre[maxn],gap[maxn],dis[maxn],cur[maxn];
map<string,int> q,p;
void init()
{
    num=0;
    memset(head,-1,sizeof(head));
}
void add_edge(int x,int y,int f)
{
    edge[num].v=y;
    edge[num].next=head[x];
    edge[num].f=f;
    head[x]=num++;
    edge[num].v=x;
    edge[num].next=head[y];
    edge[num].f=0;
    head[y]=num++;
}
int sap(int s,int t)
{
    for(int i=0;i<=nn;i++)
    {
        dis[i]=gap[i]=0;
        cur[i]=head[i];
    }
    int u,flow=0,aug=INF;
    u=pre[s]=s;
    gap[s]=nn;
    bool flag;
    while(dis[s]<nn)
    {
        flag=false;
        for(int &i=cur[u];i!=-1;i=edge[i].next)
        {
            int v=edge[i].v;
            if(edge[i].f>0&&dis[u]==dis[v]+1)
            {
                flag=true;
                if(edge[i].f<aug)
                    aug=edge[i].f;
                pre[v]=u;
                u=v;
                if(u==t)
                {
                    flow+=aug;
                    while(u!=s)
                    {
                        u=pre[u];
                        edge[cur[u]].f-=aug;
                        edge[cur[u]^1].f+=aug;
                    }
                    aug=INF;
                }
                break;
            }
        }
        if(flag)continue;

        int mindis=nn;
        for(int i=head[u];i!=-1;i=edge[i].next)
        {
            int v=edge[i].v;
            if(dis[v]<mindis&&edge[i].f>0)
            {
                mindis=dis[v];
                cur[u]=i;
            }
        }
        if((--gap[dis[u]])==0)break;
        gap[dis[u]=mindis+1]++;
        u=pre[u];
    }
    return flow;
}
int main()
{
    //freopen("in.txt","r",stdin);
    int t;
    scanf("%d",&t);
    while(t--)
    {
        q.clear(),p.clear();
        int cnt=1,m,k,s=0,e;
        string x,y;
        cin>>n;
        init();
        for(int i=0;i<n;i++)
        {
            cin>>x;
            q[x]=cnt++;
            add_edge(s,q[x],1);
        }
        cin>>m;
        for(int i=0;i<m;i++)
        {
            cin>>x>>y;
            if(q.count(y)){add_edge(q[y],cnt++,1);p[x]=cnt-1;}
            else{add_edge(cnt,cnt+1,1);q[y]=cnt;p[x]=cnt+1;cnt+=2;}
        }
        cin>>k;
        for(int i=0;i<k;i++)
        {
            cin>>x>>y;
            if(q.count(x)==0)q[x]=cnt++;
            if(q.count(y)==0)q[y]=cnt++;
            //add_edge(q[y],q[x],1);
            add_edge(q[y],q[x],INF);
        }
        int len=q.size();
        e=cnt;nn=cnt+1;
        for(map<string,int>::iterator i=p.begin();i!=p.end();i++)
            add_edge((*i).second,e,1);
        int ans=sap(s,e);
        cout<<m-ans<<endl;
        if(t)cout<<endl;
    }
    return 0;
}