hdu3526（最小费用流）

Description

Xiao A isbecoming more and more unsatisfied with his computer since he is learninghacker(黑客技术) technologiesthese days but his computer always fails whenever he changes the configurationsof the NIC. He buys a new NIC but the motherboard doesn’t recognize it. He thenpays for a motherboard from the same company as the NIC. This time the displaycard is in collision with the motherboard so he cannot even start his computer.
After days of affliction, XiaoA decides to assemble a computer himself. He hasto buy n components. Two companies are finally chosen after he searches theweb. They both offer all the n components but the prices may vary. There aresome pairs of components such that if XiaoA buys them from different companieshe has to spend an additional fee to buy adapters to avoid the collisionproblem.
XiaoA wants to spend as little as possible. Please tell him the minimum dollarshe has to pay.

Input

There aremultiple test cases.
For each test case, the first line contains two integers n andm(1<=n<=500, 0<=m<=n*(n-1)/2), indicating the number of componentsand the number of pairs. The components are conveniently numbered from 1 to nand all pairs are distinct. The next two lines both have n integers(in therange [1, 200]), describing the price in dollar for each component they offerin order. The next m lines contain three integers i, j and c(1<=i, j<=n,i!=j, 1<=c<=200) each, indicating that if he buys component i and j fromdifferent companies, he has to spend another c dollars for an adapter.
Proceed to the end of file.

Output

For each testcase, print the minimum cost on a single line.

Sample Input

5 3

2 3 4 5 2

1 5 3 6 4

1 2 3

2 3 5

3 4 2

Sample Output

题意：自从A这些天一直在学习黑客技术，她对自己的电脑越来越不满意无论她怎么改变自己电脑网络服务中心的配置她的电脑总是不工作，她买了一个新的网络服务中心但是和主板不兼容，然后她从买NIC的公司买了一个主板，这次是显卡不兼容甚至开机不了，苦恼了几天之后，A决定自己配置电脑，她从网上搜索最后决定有两家公司可以提供所有的硬件，这两家公司提供的硬件价格各异，如果A从不同公司买一些部件，她不得不花费额外的费用去买适配器由此避免硬件冲突，A想尽可能话费最少的钱，请你帮她。。。

输入：

多组测试数据，对于每组测试数据，首先一行包含n、m分别表示部件的数量和配对的数量，配件的数量是从1到n并且所有的配对是以区分的，接下来的两行有n个数字，描述每一个部件的价格按顺序排列，接下来的m行包含3个数字i、i、c，其中i、j表示从不同的公司获得，她不得不话费C美元买一个适配器，运行已文件结束。

代码：

翻译完后并没有思路…，看网上是最小费用流问题

hdu3526（最小费用流）相关推荐

poj3686（最小费用流）
题目大概意思为有N个玩具,M个工厂,每个工厂一次只能生产一个玩具,顺序任意,求所有玩具的加工完的平均时间最小值例:N = 3 M = 2 Z = {{1,100},{100,1},{1,100}} ...
poj3680（最小费用流 + 拆点）
(又是一道简单的最小费用流的题目) 题目大概意思为有N个带权的开区间,现在从中选取一些区间,使任意点都不能被超过k个区间覆盖,求最大权重和首先我们求得是最大的权重和,所以我们把权重 ,看为 -权重 ...
poj3422(最小费用流 + 拆点）
题目大概意思为有一个N × N矩阵,每个格子里都有一个非负数,一辆车从左上方的网格移动到右下方的网格k次(车只向右或向下移动).每次访问格子后,其替换为0,且将其加入到金额中.求第k次旅行后能得到的最 ...
poj2195（最小费用流）
(最小费用流的入门基础题) 题目大概意思为在一个矩阵中,有n个小人和n个房子,小人每走一格花费1美元,小人只能上下左右走,且可以经过房子但不进去,为了让每个小人有自己的房子,求最小费用首先统计每个小 ...
poj3068(最小费用流）
(和poj2135很像很像,就多了一个情况而已,基础入门题) 题目大概意思为总共有N个仓库,求两条不同路径从起点到达终点,若是没有两条,打出Not possible,若是有可能打出所需最小费用很简单 ...
HDU 5988 最小费用流
链接: http://acm.split.hdu.edu.cn/showproblem.php?pid=5988 题意: n个点,每个点有a个人和b包饭,m条边,第一次经过这条边没有问题,以后每一个经 ...
【转载】网络流和最小费用流
这段时间复习了下网络流模型,感觉比以前的理解有了长足进展,虽然我知道这东西难就难在建模上,而它的算法本身其实难度不大,但我还是决定说一些我的理解,毕竟理解了本质的东西运用起来才会更灵活. 最大流的求解 ...
一般图带权多重匹配（欧拉图+最小费用流）
problem 给定 nnn 个数 {ai}\{a_i\}{ai},其中 kkk 个 aia_iai 是奇数,再给一个 n×nn\times nn×n 的矩阵 {ci,j}\{c_{i,j}\}{ ...
POJ-2135 Farm Tour 最小费用流
题目链接:http://poj.org/problem?id=2135 很容易看出来时最小费用流,但这里要注意是无向边,所以要建立两条边.为了满足退流时,花费还是最小,反向边的花费要为相反数. 1 / ...

hdu3526（最小费用流）

hdu3526（最小费用流）相关推荐

最新文章

热门文章