POJ1087:A Plug for UNIX(最大流)
来源:互联网 发布:软件安装管理器 知乎 编辑:程序博客网 时间:2024/05/29 12:29
A Plug for UNIX
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17169 Accepted: 5925
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.
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.
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
Source
East Central North America 1999
题意:大意是N个插座,M个用电器,K个转换器,问最少几个用电器不能通电,注意插座名和用电器可能有重复,M和K中可能出现新的插座。思路:典型的最大流+map,源点->用电器->插座->汇点,转换器在插座里建容量无限大的有向路,搞定那些小细节就不难了。
# include <iostream># include <cstdio># include <map># include <cstring>using namespace std;const int maxn = 1e3;const int INF = 0x3f3f3f3f;using namespace std;int cnt, Next[maxn], dis[maxn], q[maxn];map<string, int>m1;struct node{ int u, v, w, next;}edge[maxn];void add_edge(int u, int v, int w){ edge[cnt].v = v; edge[cnt].w = w; edge[cnt].next = Next[u]; Next[u] = cnt++; edge[cnt].v = u; edge[cnt].w = 0; edge[cnt].next = Next[v]; Next[v] = cnt++;}bool bfs(){ memset(dis, -1, sizeof(dis)); dis[0] = 0; int l=0, r=0; q[r++] = 0; while(l<r) { int u= q[l]; ++l; for(int i=Next[u]; i!=-1; i=edge[i].next) { int v = edge[i].v, w = edge[i].w; if(w>0&&dis[v]==-1) { dis[v] = dis[u] + 1; q[r++] = v; } } } return dis[888] != -1;}int dfs(int u, int pre){ if(u == 888) return pre; int ans=0, f=0; for(int i=Next[u]; i!=-1; i=edge[i].next) { int v = edge[i].v, w = edge[i].w; if(dis[v]==dis[u]+1&&w>0&&(f=dfs(v, min(w, pre)))) { edge[i].w -= f; edge[i^1].w += f; pre -= f; ans += f; if(!pre) break; } } if(ans) return ans; dis[u] = -1; return 0;}int main(){ cnt = 0; memset(Next, -1, sizeof(Next)); m1.clear(); string s, t;; int n, m, k, max_flow=0; scanf("%d",&n); for(int i=1; i<=n; ++i) { cin >> s; if(!m1[s]) m1[s] = i; add_edge(m1[s], 888, 1); } scanf("%d",&m); for(int i=401; i<m+401; ++i) { cin >> s >> t; if(!m1[t]) m1[t] = ++n; add_edge(0, i, 1); add_edge(i, m1[t], 1); } scanf("%d",&k); for(int i=1; i<=k; ++i) { cin >> s >> t; if(!m1[s]) m1[s] = ++n; if(!m1[t]) m1[t] = ++n; add_edge(m1[s], m1[t], INF); } while(bfs()) max_flow += dfs(0, INF); printf("%d\n",m-max_flow); return 0;}
阅读全文
0 0
- POJ1087 A Plug for UNIX 【最大流】
- poj1087 A Plug for UNIX (最大流)
- POJ1087 A Plug for UNIX(最大流)
- poj1087 A Plug for UNIX 最大流
- poj1087 A Plug for UNIX(最大流)
- POJ1087:A Plug for UNIX(最大流)
- [最大流] POJ1087 ZOJ1157 A Plug for UNIX
- ZOJ1157, POJ1087,UVA 753 A Plug for UNIX (最大流)
- POJ1087 A Plug for UNIX(map+dinic最大流)
- poj1087&hdu1526A Plug for UNIX(最大流)
- 【网络流】:poj1087,A Plug for UNIX
- poj1087 - A Plug for UNIX
- poj1087 A Plug for UNIX
- POJ1087--A Plug for UNIX
- poj1087 A Plug for UNIX
- POJ1087 A Plug for UNIX
- POJ1087 A Plug for UNIX
- POJ1087-A Plug for UNIX
- ARM指令中如何判断一个立即数是有效立即数
- [7.9] 纪中C组
- OpenCV3 Python语言实现 笔记1
- GalaxyOJ-687 (离散化)
- 递推问题之“佐罗”的烦恼
- POJ1087:A Plug for UNIX(最大流)
- 零阶矩、一阶矩、二阶矩、三阶矩
- java中等待一些线程执行完之后,再去执行别的方法(后者需要使用前者返回的结果)
- Android系列之手机多点触摸画圆
- 二进制、八进制、十进制、十六进制之间的转换
- 字符串转二进制
- 1019. General Palindromic Number (20)
- GetMessage
- LightOJ