POJ 2516 Minimum Cost//비용 흐름

Minimum Cost
Time Limit: 4000MS
 
Memory Limit: 65536K
Total Submissions: 7104
 
Accepted: 2334
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
POJ Monthly--2005.07.31, Wang Yijie
첫 번째 최소 비용 흐름 제목.
코드는 붙이지 않고 남의 템플릿으로 썼다
구도 한번 얘기해주세요.
우선 두 개의 슈퍼 소스와 송금점 S, T를 설립한다
S는 공급자와 연결되어 있으며 용량은 공급자의 공급량이고 비용은 0이다
상점과 T가 연결되어 있으며, 용량은 상점의 수요량이며, 비용은 여전히 0이다
그러면 납품자의 공급화물상점도 필요하다면 납품자와 상점 사이가 연결된다
용량은 무한대, 비용은 제목 입력량
여기 각별히 주의하세요!!!비용 흐름은 역방향이어야 하고, 상점은 공급자에게도 연결되어야 하며, 변의 길이는 비용의 마이너스이다
이렇게 하면 돼요.
여러 상품이 서로 아무런 영향이 없기 때문에 K번으로 찾으면 된다