UVA 753 - A Plug for UNIX(网络流)

原创 2013年12月02日 20:06:31

  A Plug for UNIX 

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 several case. The first line of the input contains the number of cases, and it's followed bya blank line. The first line of each case contains a single positive integer n ( $1 \leŸ n \leŸ 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 \leŸ m \leŸ 100$) indicating the number of devices you would like to plug in. Each of the next mlines 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 \leŸ k \leŸ 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.

There's a blank line between test cases.

Output 

For each case, print a line containing a single non-negative integer indicating the smallest number of devices that cannot be plugged in. Print a blank line between cases.

Sample Input 

1

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
题意:给定插座,和转接器,和用电器,求出最少几个不能接上。

思路:最大流,源点连到插座,汇点连到用电器,转接器做中间边,注意同一名称为一个类型。

代码:

#include <stdio.h>
#include <string.h>
#include <queue>
using namespace std;
#define min(a,b) (a)<(b)?(a):(b)
#define max(a,b) (a)>(b)?(a):(b)
#define INF 0x3f3f3f3f
const int N = 1005;
int T, n, m, k, sum, g[N][N], f[N][N], p[N], a[N];
char str[30], str1[30], name[N][30];
queue<int>q;

int find(char *str) {
    for (int i = 0; i < sum; i ++)
	if (strcmp(str, name[i]) == 0)
	    return i + 1;
    strcpy(name[sum ++], str);
    return sum;
}

void init() {
    sum = 0;
    memset(g, 0, sizeof(g));
    scanf("%d", &n);
    for (int i = 0; i < n; i ++) {
	scanf("%s", str);
	g[0][find(str)] ++;
    }
    scanf("%d", &m);
    for (int i = 0; i < m; i ++) {
	scanf("%s%s", str1, str);
	p[i] = find(str);
    }
    scanf("%d", &k);
    for (int i = 0; i < k; i ++) {
	scanf("%s%s", str, str1);
	int u = find(str);
	int v = find(str1);
	g[v][u] = INF;
    }
    for (int i = 0; i < m; i ++) {
	g[p[i]][sum + 1] ++;
    }
}

int solve() {
    init();
    memset(f, 0, sizeof(f));
    memset(p, 0, sizeof(p));
    int s = 0, t = sum + 1, ans = 0;
    while (1) {
	memset(a, 0, sizeof(a));
	a[s] = INF;
	q.push(s);
	while (!q.empty()) {
	    int u = q.front(); q.pop();
	    for (int v = 1; v <= t; v ++) {
		if (!a[v] && g[u][v] > f[u][v]) {
		    a[v] = min(a[u], g[u][v] - f[u][v]);
		    p[v] = u; q.push(v);
		}
	    }
	}
	if (a[t] == 0) break;
	for (int u = t; u != s; u = p[u]) {
	    f[p[u]][u] += a[t];
	    f[u][p[u]] -= a[t];
	}
	ans += a[t];
    }
    return m - ans;
}

int main() {
    scanf("%d", &T);
    while (T --) {
	printf("%d\n", solve());	
	if (T) printf("\n");
    }
    return 0;
}



相关文章推荐

UVA 753 A Plug for UNIX 网络流 插头匹配

题目:有n个不同插口,每种插口有一个名字,现在要为m台设备安排插头,每台设备对应一种插口,当然,你也可以去商店买插口适配器来用,商店有k种适配器,每种适配器能够接受一种的插头,并插在另一种插口上,适配...
  • hcbbt
  • hcbbt
  • 2013年12月08日 16:31
  • 2075

UVA - 753 A Plug for UNIX (最大流)

题意: 有若干个电器设备需要不同的适配器才能接上电源,现在你要让尽可能多的电气设备接上电源。 首先你手中有n个适配器和适配器的型号,再告诉你有m个电器和他们分别对应的适配器的型号,最后还有一个商店...

UVa 753 - A Plug for UNIX(最大流 | EK)

题意 一个宾馆里有N种插座,现在有K个设备,每个设备有各自的插座类型。 还有一些转换器,提供插座类型之间的转换。 问最少剩下多少设备不能用。 思路 可以想到是最大...

UVA 753 - A Plug for UNIX

这是一道二分图最大匹配的问题。关键在于如何构造二分图,构造二分图时,我将适配器所有的可能都构造出来,例如:B X,X A,X D实际上有B X,X A,X D,B A, B D这五种,然后根据适配器在...

UVA, 753 A Plug for UNIX

题意:  4 4个插座,下面是名称,不一定时单字母,可能是字符串  A  B  C  D  5 5个设备,名称 插头  laptop B  phone C  pager B  cl...

uva 753 A Plug for UNIX

uva 753 A Plug for UNIX 网络流 最大匹配

UVa 753 A Plug for UNIX

网络流
  • sdfzyhx
  • sdfzyhx
  • 2016年11月04日 20:09
  • 91

UVa #753 A Plug for UNIX (例题11-7)

网络最大流问题。 建图的时候,取一个起点s,与所有设备的接口连接;再取一个终点t,与所有插线板的接口连接,流量都设为1。注意这里可能在相同的点之间多次添加边(比如不同的设备有着相同的接口),...

POJ 1087 A Plug for UNIX(一道网络流引起的思考)

题目大意:n个插座,m个电器及其插头,k个转化器,问最多有多少设备可以使用。一种转换器可以有无限多个。 建模方法:(假设插座与源点相连,电器与汇点相连) 第一种:很显然,最开始想到的是,插座与源点连边...

POJ 1087 A Plug for UNIX(网络流)

题目链接:http://poj.org/problem?id=1087 题意: 1、在一个会议室里有n种插座,每种插座一个; 2、每个插座只能插一种以及一个电器(或者适配器); 3、有m个电器...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:UVA 753 - A Plug for UNIX(网络流)
举报原因:
原因补充:

(最多只允许输入30个字)