ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1076. Trash

I have problems here ... Is this Maximum Weighted Matching ?! I solve it with this approach but I won't make code for Maximum Weighted Matching, I suppose it has simpler solution ... Need an answer ?
Posted by Dejan Kolundzija 10 Jan 2002 19:35
Yes, this is a Maximum(Minimum) Weighted Matching on biparty graph.
Posted by Andrey Popyk (popyk@ief.tup.km.ua) 10 Jan 2002 19:51
>
Re: Yes, this is a Maximum(Minimum) Weighted Matching on biparty graph.
Posted by Dejan Kolundzija 12 Jan 2002 06:02
Thanx!
But I know one monster implementation that I don't like to code. If
you have some other (easier) I'd rather want to know. Please send any
useful information to sidejan@yahoo.com . Thanx!