【poj1087/uva753】A Plug for UNIX(最大流)
A Plug for UNIXDescription
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 DSample 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**];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+;
t[++len].x=y;t[len].y=x;t[len].f=;
t[len].next=first[y];first[y]=len;t[len].o=len-;
} int h[Maxn],num[Maxn];
char c[Maxn],ss[Maxn],sh[*Maxn][Maxn]; void init()
{
scanf("%d",&n);
memset(first,,sizeof(first));
len=;int sl=;
for(int i=;i<=n;i++)
{
scanf("%s",ss);sl++;
memcpy(sh[sl],ss,sizeof(sh[sl]));
}
scanf("%d",&m);
for(int i=;i<=m;i++)
{
scanf("%s%s",c,ss);sl++;
memcpy(sh[sl],ss,sizeof(sh[sl]));
}
scanf("%d",&k);
for(int i=;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=,ed=;
int p=;
for(int i=;i<=sl;i++)
{
int id=-;
for(int j=;j<i;j++)
{
if(strcmp(sh[i],sh[j])==) {id=num[j];break;}
}
if(id==-) id=++p;
num[i]=id;
} // printf("%d\n",p); memset(h,,sizeof(h));
for(int i=;i<=n;i++) h[num[i]]++;
for(int i=;i<=p;i++) if(h[i])
{
ins(i,ed,h[i]);
ins(i+p,i,INF);
// ins(i+n+m,i,INF);
} memset(h,,sizeof(h));
for(int i=;i<=m;i++) h[num[i+n]]++;
for(int i=;i<=p;i++) if(h[i])
{
ins(st,i+p,h[i]);
ins(i+p,i,INF);
} for(int i=;i<=k;i++)
{
ins(num[i*-+n+m]+p,num[i*+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,-,sizeof(dis));
q.push(st);dis[st]=;
while(!q.empty())
{
int x=q.front();q.pop();
for(int i=first[x];i;i=t[i].next) if(t[i].f>)
{
if(dis[t[i].y]==-)
{
q.push(t[i].y);
dis[t[i].y]=dis[x]+;
}
}
}
if(dis[ed]==-) return ;
return ;
} int ffind(int x,int flow)
{
int now=;
if(x==ed) return flow;
for(int i=first[x];i;i=t[i].next)
if(t[i].f>&&dis[t[i].y]==dis[x]+)
{
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==) dis[x]=-;
return now;
} void max_flow()
{
int ans=;
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!=) printf("\n");
}
return ;
}
[UVA753]
2016-07-15 14:26:32
【poj1087/uva753】A Plug for UNIX(最大流)的更多相关文章
- uva753 A Plug for UNIX 网络流最大流
C - A Plug for UNIX You are in charge of setting up the press room for the inaugural meeting of t ...
- POJ1087:A Plug for UNIX(最大流)
A Plug for UNIX 题目链接:https://vjudge.net/problem/POJ-1087 Description: You are in charge of setting u ...
- POJ1087 A Plug for UNIX —— 最大流
题目链接:https://vjudge.net/problem/POJ-1087 A Plug for UNIX Time Limit: 1000MS Memory Limit: 65536K T ...
- UVa753/POJ1087_A Plug for UNIX(网络流最大流)(小白书图论专题)
解题报告 题意: n个插头m个设备k种转换器.求有多少设备无法插入. 思路: 定义源点和汇点,源点和设备相连,容量为1. 汇点和插头相连,容量也为1. 插头和设备相连,容量也为1. 可转换插头相连,容 ...
- ZOJ1157, POJ1087,UVA 753 A Plug for UNIX (最大流)
链接 : http://acm.hust.edu.cn/vjudge/problem/viewProblem.action? id=26746 题目意思有点儿难描写叙述 用一个别人描写叙述好的. 我的 ...
- TZOJ 1911 A Plug for UNIX(最大流)
描述 You are in charge of setting up the press room for the inaugural meeting of the United Nations In ...
- POJ A Plug for UNIX (最大流 建图)
Description You are in charge of setting up the press room for the inaugural meeting of the United N ...
- uva753 A Plug for UNIX
最大流. 流可以对应一种分配方式. 显然最大流就可以表示最多匹配数 #include<cstdio> #include<algorithm> #include<cstri ...
- UVa 753 A Plug for UNIX (最大流)
题意:给定 n 种插座,m种设备,和k个转换器,问你最少有几台设备不能匹配. 析:一个很裸的网络流,直接上模板就行,建立一个源点s和汇点t,源点和每个设备连一条边,每个插座和汇点连一条边,然后再连转换 ...
随机推荐
- GDB-Dashboard-GDB可视化界面
项目地址 https://github.com/cyrus-and/gdb-dashboard 项目介绍 gdb-dashboard是一个gdb的可视化界面,可以通过web或者终端来现实可视化信息,支 ...
- linux 提高进程优先级nice+ 进程调度CFS
http://www.cnblogs.com/wang_yb/archive/2012/09/04/2670564.htmlhttp://liwei.life/2016/04/07/linux%E7% ...
- Servlet中文乱码解决方法
程序中的输入输出都是以流的形式保存的,流中保存的实际上全都是字节文件. 字节流和字符流的区别: 在Java.io包中操作文件内容的主要有两大类:字节流.字符流,两类都分为输入和输出操作. 在字节流中输 ...
- Android(java)学习笔记169:Activity中的onCreate()方法分析
1.onCreate( )方法是android应用程序中最常见的方法之一: 翻译过来就是说,onCreate()函数是在activity初始化的时候调用的,通常情况下,我们需要在onCreate()中 ...
- Gym 100187M-Heaviside Function
题意:给定函数: f(x) = θ(s1x - a1) + θ(s2x - a2) + ... + θ(snx - an), where si = ± 1. Calculate its values ...
- javascript 封装 构造函数继承 非构造函数继承
1 封装 把"属性"(property)和"方法"(method),封装成一个对象,甚至要从原型对象生成一个实例对象 1.1 简单封装:var cat1 = { ...
- java输入输出流(内容练习)
1,编写一个程序,读取文件test.txt的内容并在控制台输出.如果源文件不存在,则显示相应的错误信息. package src; import java.io.File; import java.i ...
- 3 委托、匿名函数、lambda表达式
委托.匿名函数.lambda表达式 在 2.0 之前的 C# 版本中,声明委托的唯一方法是使用命名方法.C# 2.0 引入了匿名方法,而在 C# 3.0 及更高版本中,Lambda 表达式取代了匿名方 ...
- 批量缩放PNG图片.
最近需要缩放N多图片, 找遍了互联网也没有找到方便使用的批量缩放工具.. 趁着周末写一个练手.. #include <iostream> #include <vector> # ...
- SecureCRT、FileZilla使用Public证书登录Linux
本文作者:Vinkn ,转载请注明出处http://www.cnblogs.com/Vinkn/ 一.简介 服 务器部署之后一般都配置了防火墙,一般也都开启了ssh,可以直接登录远程服务器,为了安全等 ...