Minimum Cost
Time Limit: 4000MS |
|
Memory Limit: 65536K |
Total Submissions: 8593 |
|
Accepted: 2825 |
Description
Dearboy, a goods victualer, now comes to a big
problem, and he needs your help. In his sale area there are N shopkeepers
(marked from 1 to N) which stocks goods from him.Dearboy has M supply places
(marked from 1 to M), each provides K different kinds of goods (marked from 1 to
K). Once shopkeepers order goods, Dearboy should arrange which supply place
provide how much amount of goods to shopkeepers to cut down the total cost of
transport.
It's known that the cost to transport one unit goods for
different kinds from different supply places to different shopkeepers may be
different. Given each supply places' storage of K kinds of goods, N shopkeepers'
order of K kinds of goods and the cost to transport goods for different kinds
from different supply places to different shopkeepers, you should tell how to
arrange the goods supply to minimize the total cost of transport.
Input
The input consists of multiple test cases. The first
line of each test case contains three integers N, M, K (0 < N, M, K < 50),
which are described above. The next N lines give the shopkeepers' orders, with
each line containing K integers (there integers are belong to [0, 3]), which
represents the amount of goods each shopkeeper needs. The next M lines give the
supply places' storage, with each line containing K integers (there integers are
also belong to [0, 3]), which represents the amount of goods stored in that
supply place.
Then come K integer matrices (each with the size N * M),
the integer (this integer is belong to (0, 100)) at the i-th row, j-th column in
the k-th matrix represents the cost to transport one unit of k-th goods from the
j-th supply place to the i-th shopkeeper.
The input is terminated with
three "0"s. This test case should not be processed.
Output
For each test case, if Dearboy can satisfy all the
needs of all the shopkeepers, print in one line an integer, which is the minimum
cost; otherwise just output "-1".
Sample Input
1 3 3
1 1 1
0 1 1
1 2 2
1 0 1
1 2 3
1 1 1
2 1 1
1 1 1
3
2
20
0 0 0
Sample Output
4
-1
Source
分享到:
相关推荐
【标题】"POJ2516-Minimum Cost"是一个经典的计算机编程竞赛题目,源自北京大学的在线评测系统POJ(PKU Online Judge)。这个题目主要涉及到图论中的最短路径算法,要求参赛者编写程序找出从源节点到目标节点的最小...
【标题】"pku.zip_PKU" 指的是一份与北京大学(Peking University, PKU)相关的压缩文件。从描述来看,这份压缩包包含了部分编程题目的代码,可能是学生或者爱好者在解决北京大学编程竞赛或课程作业时编写的。"pku"这...
"pku经典题目解题报告"这一标题揭示了文件内容的核心,它表明这是一份关于北京大学(PKU)编程竞赛或算法竞赛中的经典问题的解答集。通常,这样的报告会涵盖一系列在PKU历年比赛中出现的难题,包含了解题思路、算法...
pku1000 pku1000程序 解题报告
在编程竞赛的世界里,北京大学(PKU)的ACM团队以其高质量的题目和独特的解题思路闻名。"PKU-ACM.rar"这个压缩包包含了北大ACM题目的一些核心知识点,旨在帮助参赛者理解和掌握算法竞赛中的生命周期题目解法。本文将...
benchmark (PKU-MMD) for continuous multi-modality 3D human action understanding and cover a wide range of complex human activities with well annotated information. PKU-MMD contains 1076 long video ...
【标题】"ACM代码 之pku代码" 涉及的是在计算机科学领域中的算法竞赛编程,尤其是北京大学(Peking University, PKU)的ACM/ICPC(国际大学生程序设计竞赛)训练代码。这些代码是参赛者或教练为了准备这类竞赛而编写的,...
标题 "pku acm 一些代码" 暗示了这是一个与北京大学(Peking University, 简称PKU)的ACM(国际大学生程序设计竞赛)相关的代码集合。在这个领域,参赛者通常需要解决算法问题,编写高效且优化的代码来求解数学、逻辑...
标题"Pku1664"很可能是指北京大学(Peking University)在某个编程竞赛或课程中的一道题目或项目,编号为1664。这道题目可能涉及到计算机科学的基础概念,尤其是算法和数据结构。描述中提到的是"Pku1664源代码",暗示...
8数码代码pku1077,300ms(哈希+广度搜索)
PKU 2339 Rock, Scissors, Paper 源代码
pku acm 1469 COURSES 代码 二分图的最大匹配的匈牙利算法 解题报告请访问:http://blog.csdn.net/china8848
标题中的“pku1742.rar_pku 17_pku 1742 _报告及程序”表明这是一个与北京大学(Peking University, 简称PKU)相关的项目,项目编号可能是1742,内容包括了结题报告和程序代码。这个压缩包很可能是学生或研究人员提交...
标签部分进一步细化了内容:"pku acm_pku"再次强调这是北京大学ACM竞赛的资料,"pku__1709__crossword"可能是特定的题目标签,而"pku_acm"可能是北京大学ACM团队的标识。"visual_c"可能表示这些代码是使用C++语言,...
北京大学pku2317 Questions and answers c++标程 文件名为2371.cpp
"p_acm"、"pku_acm"以及"pu_acm.pku_pku"等标签可能是用于分类或标识这些代码属于北京大学(Peking University, PKU)的ACM训练题目。"acm"一词重复出现,进一步强调了这是关于ACM编程竞赛的内容。 描述中提到"acmer...
标题中的“pku1088.rar_pku 10_pku 1088_poj 1088”指的是北京大学(Peking University, PKU)编程竞赛中的第1088题,也称为POJ(Peking University Online Judge)的1088题。这个题目在编程竞赛社区中通常有一个特定的...
此数据集用于NLP中分词训练使用,文档中的文字已经人工切分好词组,总共有65536个中国汉字组合而成