Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Minimum Weighted Perfect Fractional
b-Matching
Description In graph theory, a Extending the definition of a matching, the concept of in which A minimum weighted perfect fractional Given a capacitated, weighted graph with a balance constraint on each vertex, find a minimum weighted perfect fractional Input The first line contains two integers The next The last b(v) ≤ 200), the balance of vertex _{i}i.Output Output the weight of the found matching. Sample Input 4 3 3 1 6 4 3 1 10 4 2 3 2 2 2 1 6 6 2 2 4 Sample Output 12 Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator