与‘图论(网络流)-费用流’有关的日志

poj2175

maksyuki 发表于 oj 分类,标签:
0
poj2175

Evacuation Plan

The City has a number of municipal buildings and a number of fallout shelters that were build specially to hide municipal workers in case of a nuclear war. Each fallout shelter has a limited capacity in terms of a number of people i >>继续阅读

poj2516

maksyuki 发表于 oj 分类,标签:
0
poj2516

Minimum Cost

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 >>继续阅读

poj2195

maksyuki 发表于 oj 分类,标签:
0
poj2195

Going Home

On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to an adjacent point. For each little man, you need to pay a $1 travel fee for every step >>继续阅读

poj3422

maksyuki 发表于 oj 分类,标签:
0
poj3422

Kaka's Matrix Travels

On an N × N chessboard with a non-negative number in each grid, Kaka starts his matrix travels with SUM = 0. For each travel, Kaka moves one rook from the left-upper grid to the right-bottom one, taking care that the rook move >>继续阅读