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 1449. Credit Operations 2

1449- Hungarian weighted maching algorithm
Posted by svr 10 Feb 2007 18:53
Hungarian method of weighted matching!
It's interesting that I solved 1449
by first version of program without any optimization.
It,s rather strange because commonly
challange team prepear most difficult tests with respect
to time and memory. Now the problem has junior level.
This is  a pity, because matching frequently using on
various contests.
For information: Let W- weight of maximal matching in A[][]
Graph. Then W- our answer.
Re: 1449- Hungarian weighted maching algorithm
Posted by Denis Koshman 30 Jul 2008 22:52
I don't consider myself a weak problem solver (even been to ACM WF twice), but it's still not obvious for me how does this problem resolve to maximal matching, and how should I convert that matching into result :) So, the problem is worth it.