【poj1087/uva753】A Plug for UNIX(最大流)

A Plug for UNIX

 

Description

You are in charge of setting up the press room for the inaugural meeting of the United Nations Internet eXecutive (UNIX), which has an international mandate to make the free flow of information and ideas on the Internet as cumbersome and bureaucratic as possible. 
Since the room was designed to accommodate reporters and journalists from around the world, it is equipped with electrical receptacles to suit the different shapes of plugs and voltages used by appliances in all of the countries that existed when the room was built. Unfortunately, the room was built many years ago when reporters used very few electric and electronic devices and is equipped with only one receptacle of each type. These days, like everyone else, reporters require many such devices to do their jobs: laptops, cell phones, tape recorders, pagers, coffee pots, microwave ovens, blow dryers, curling 
irons, tooth brushes, etc. Naturally, many of these devices can operate on batteries, but since the meeting is likely to be long and tedious, you want to be able to plug in as many as you can. 
Before the meeting begins, you gather up all the devices that the reporters would like to use, and attempt to set them up. You notice that some of the devices use plugs for which there is no receptacle. You wonder if these devices are from countries that didn't exist when the room was built. For some receptacles, there are several devices that use the corresponding plug. For other receptacles, there are no devices that use the corresponding plug. 
In order to try to solve the problem you visit a nearby parts supply store. The store sells adapters that allow one type of plug to be used in a different type of outlet. Moreover, adapters are allowed to be plugged into other adapters. The store does not have adapters for all possible combinations of plugs and receptacles, but there is essentially an unlimited supply of the ones they do have.

Input

The input will consist of one case. The first line contains a single positive integer n (1 <= n <= 100) indicating the number of receptacles in the room. The next n lines list the receptacle types found in the room. Each receptacle type consists of a string of at most 24 alphanumeric characters. The next line contains a single positive integer m (1 <= m <= 100) indicating the number of devices you would like to plug in. Each of the next m lines lists the name of a device followed by the type of plug it uses (which is identical to the type of receptacle it requires). A device name is a string of at most 24 alphanumeric 
characters. No two devices will have exactly the same name. The plug type is separated from the device name by a space. The next line contains a single positive integer k (1 <= k <= 100) indicating the number of different varieties of adapters that are available. Each of the next k lines describes a variety of adapter, giving the type of receptacle provided by the adapter, followed by a space, followed by the type of plug.

Output

A line containing a single non-negative integer indicating the smallest number of devices that cannot be plugged in.

Sample Input

4 
A 
B 
C 
D 
5 
laptop B 
phone C 
pager B 
clock B 
comb X 
3 
B X 
X A 
X D 

Sample Output

1

 

 

　　最大流或者二分图匹配都能做。

　　我做的是最大流~~
　　建图->st连插头流量为这种插头数量
　　插座连ed流量为这种插座的数量
　　对于插头的转换，就在左边的图连x->y，流量为正无穷
　　最后计算最大流。
　　不会用map的我，搞编号搞了一辈子，呵呵~

 

代码如下：

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
#define INF 0xfffffff
// #define Maxl 100010
#define Maxn 510

int n,m,k;

struct node
{
    int x,y,f,o,next;
}t[Maxn*10*10];int len;
int first[Maxn],st,ed;

int mymin(int x,int y) {return x<y?x:y;}

void ins(int x,int y,int f)
{
    t[++len].x=x;t[len].y=y;t[len].f=f;
    t[len].next=first[x];first[x]=len;t[len].o=len+1;
    t[++len].x=y;t[len].y=x;t[len].f=0;
    t[len].next=first[y];first[y]=len;t[len].o=len-1;
}

int h[Maxn],num[Maxn];
char c[Maxn],ss[Maxn],sh[5*Maxn][Maxn];

void init()
{
    scanf("%d",&n);
    memset(first,0,sizeof(first));
    len=0;int sl=0;
    for(int i=1;i<=n;i++)
    {
        scanf("%s",ss);sl++;
        memcpy(sh[sl],ss,sizeof(sh[sl]));
    }
    scanf("%d",&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%s%s",c,ss);sl++;
        memcpy(sh[sl],ss,sizeof(sh[sl]));
    }
    scanf("%d",&k);
    for(int i=1;i<=k;i++) 
    {
        scanf("%s",ss);sl++;
        memcpy(sh[sl],ss,sizeof(sh[sl]));
        scanf("%s",ss);sl++;
        memcpy(sh[sl],ss,sizeof(sh[sl]));
    }
    
    st=1,ed=2;
    int p=2;
    for(int i=1;i<=sl;i++)
    {
        int id=-1;
        for(int j=1;j<i;j++)
        {
            if(strcmp(sh[i],sh[j])==0) {id=num[j];break;}
        }
        if(id==-1) id=++p;
        num[i]=id;
    }
    
    // printf("%d\n",p);
    
    memset(h,0,sizeof(h));
    for(int i=1;i<=n;i++) h[num[i]]++;
    for(int i=1;i<=p;i++) if(h[i])
    {
        ins(i,ed,h[i]);
        ins(i+p,i,INF);
        // ins(i+n+m,i,INF);
    }
    
    memset(h,0,sizeof(h));
    for(int i=1;i<=m;i++) h[num[i+n]]++;
    for(int i=1;i<=p;i++) if(h[i]) 
    {
        ins(st,i+p,h[i]);
        ins(i+p,i,INF);
    }
    
    for(int i=1;i<=k;i++)
    {
        ins(num[i*2-1+n+m]+p,num[i*2+n+m]+p,INF);
        // ins(num[i*2-1+n+m]+n+m,num[i*2+n+m],INF);
    }
    /*for(int i=1;i<=len;i+=2)
    {
        printf("%d -> %d :%d \n",t[i].x,t[i].y,t[i].f);
    }*/
}

int dis[Maxn];
queue<int > q;
bool bfs()
{
    while(!q.empty()) q.pop();
    memset(dis,-1,sizeof(dis));
    q.push(st);dis[st]=0;
    while(!q.empty())
    {
        int x=q.front();q.pop();
        for(int i=first[x];i;i=t[i].next) if(t[i].f>0)
        {
            if(dis[t[i].y]==-1)
            {
                q.push(t[i].y);
                dis[t[i].y]=dis[x]+1;
            }
        }
    }
    if(dis[ed]==-1) return 0;
    return 1;
}

int ffind(int x,int flow)
{
    int now=0;
    if(x==ed) return flow;
    for(int i=first[x];i;i=t[i].next) 
      if(t[i].f>0&&dis[t[i].y]==dis[x]+1)
      {
          int a=ffind(t[i].y,
          mymin(flow-now,t[i].f));
          now+=a;
          t[i].f-=a;
          t[t[i].o].f+=a;
          if(now==flow) break;
      }
    if(now==0) dis[x]=-1;
    return now;
}

void max_flow()
{
    int ans=0;
    while(bfs()) ans+=ffind(st,INF);
    printf("%d\n",m-ans);
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        init();
        bfs();
        max_flow();
        if(T!=0) printf("\n");
    }
    return 0;
}

 

2016-07-15 14:26:32