UVA 753 A Plug for UNIX（最大流）

题目地址：

思路：设置源点s、汇点t，若设备i能经过转接到插座j，则连一条边<i,j>，容量为INF（转接可使用无限个），从s向每个设备连一条边，容量为1，从每个插座向t连一条边，容量为1。求最大流即为可连接的设备数，也即当前二分图的最大匹配数。

#include<map>
#include<cstdio>
#include<queue>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
#define debu
using namespace std;
const int Len=50;
const int maxn=800+50;
const int INF=0x3f3f3f3f;
struct Edge
{
    int from, to, cap, flow;
    Edge(int a=0,int b=0,int c=0,int d=0):from(a),to(b),cap(c),flow(d) {}
};
struct Dinic
{
    int n, m, s, t;
    vector<Edge> edges;
    vector<int> G[maxn];
    bool vis[maxn];
    int d[maxn];
    int cur[maxn];
    void init(int n)
    {
        this->n=n;
        for(int i = 0; i < n; i++) G[i].clear();
        edges.clear();
    }
    void addedge(int from, int to, int cap)
    {
        edges.push_back(Edge(from,to,cap,0));
        edges.push_back(Edge(to,from,0,0));
        int m = edges.size();
        G[from].push_back(m-2);
        G[to].push_back(m-1);
    }
    bool BFS()
    {
        memset(vis, 0, sizeof(vis));
        queue<int> Q;
        Q.push(s);
        vis[s] = 1;
        d[s] = 0;
        while(!Q.empty())
        {
            int x = Q.front();
            Q.pop();
            for(int i = 0; i < G[x].size(); i++)
            {
                Edge& e = edges[G[x][i]];
                if(!vis[e.to] && e.cap > e.flow)
                {
                    vis[e.to] = 1;
                    d[e.to] = d[x] + 1;
                    Q.push(e.to);
                }
            }
        }
        return vis[t];
    }
    int DFS(int x, int a)
    {
        if(x == t || a == 0) return a;
        int flow = 0, f;
        for(int& i = cur[x]; i < G[x].size(); i++)
        {
            Edge& e = edges[G[x][i]];
            if(d[x] + 1 == d[e.to] && (f = DFS(e.to, min(a, e.cap-e.flow))) > 0)
            {
                e.flow += f;
                edges[G[x][i]^1].flow -= f;
                flow += f;
                a -= f;
                if(a == 0) break;
            }
        }
        return flow;
    }
    int Maxflow(int s, int t)
    {
        this->s = s;
        this->t = t;
        int flow = 0;
        while(BFS())
        {
            memset(cur, 0, sizeof(cur));
            flow += DFS(s, INF);
        }
        return flow;
    }
};
struct Node
{
    char id[Len],rec[Len];
};
Dinic G;
Node dev[maxn];
int cnt1,cnt2,n,m,k;
int g[maxn][maxn];
char rec[maxn][Len];
map<string,int> id1,id2;
inline int ID1(string x)
{
    if(!id1[x]) return id1[x]=++cnt1;
    else return id1[x];
}
inline int ID2(string x)
{
    if(!id2[x]) return id2[x]=++cnt2;
    else return id2[x];
}
void init()
{
    id1.clear(),cnt1=0;
    id2.clear(),cnt2=0;
    memset(g,0,sizeof(g));
    for(int i=1; i<maxn; i++) g[i][i]=1;
}
void Floyd()
{
    for(int k=1; k<=cnt1; k++)
    {
        for(int i=1; i<=cnt1; i++)
        {
            for(int j=1; j<=cnt1; j++)
                g[i][j]=g[i][j]||(g[i][k]&&g[k][j]);
        }
    }
}
void input()
{
    scanf("%d",&n);
    for(int i=0; i<n; i++)
    {
        getchar();
        scanf("%s",rec[i]);
        //cout<<rec[i]<<endl;
        ID1(rec[i]);
    }
    scanf("%d",&m);
    for(int i=0; i<m; i++)
    {
        getchar();
        scanf("%s%s",dev[i].id,dev[i].rec);
        //cout<<dev[i].id<<" "<<dev[i].rec<<endl;
        ID2(dev[i].id),ID1(dev[i].rec);
    }
    scanf("%d",&k);
    for(int i=0; i<k; i++)
    {
        getchar();
        char tmp1[Len],tmp2[Len];
        scanf("%s%s",tmp1,tmp2);
        //cout<<tmp1<<" "<<tmp2<<endl;
        g[ID1(tmp1)][ID1(tmp2)]=1;
    }
}
void make()
{
    //cout<<cnt1<<" "<<cnt2<<endl;
    for(int i=0; i<n; i++)
    {
        G.addedge(cnt2+ID1(rec[i]),cnt1+cnt2+1,1);
       // cout<<cnt2+ID1(rec[i])<<" "<<cnt1+cnt2+1<<endl;
    }
    for(int i=0; i<m; i++)
    {
        G.addedge(0,ID2(dev[i].id),1);
        //cout<<0<<" "<<ID2(dev[i].id)<<endl;
        for(int j=0; j<n; j++)
        {
            if(g[ID1(dev[i].rec)][ID1(rec[j])])
            {
                //cout<<ID2(dev[i].id)<<" "<<cnt2+ID1(rec[j])<<endl;
                G.addedge(ID2(dev[i].id),cnt2+ID1(rec[j]),INF);
            }
        }
    }
}
int main()
{
#ifdef debug
    freopen("in.in","r",stdin);
#endif // debug
    int t,cas=0;
    scanf("%d",&t);
    while(t--)
    {
        cas++;
        if(cas!=1) printf("\n");
        init();
        input();
        G.init(cnt1+cnt2+2);
        Floyd();
        make();
        printf("%d\n",m-G.Maxflow(0,cnt1+cnt2+1));
    }
    return 0;
}