11383 - Golden Tiger Claw
Moderator: Board moderators
11383 - Golden Tiger Claw
I believe this problem is the Primal-Dual of a networkflow problem.
However, I can't quite get it into the right form. Does it require full
integer programming?
However, I can't quite get it into the right form. Does it require full
integer programming?
It can be shown that the maximum weight of a perfect matching in bipartite graph with weights w_ij is equal to the minimum value of the sum of row and column labels.
Kuhn-Munkres algorithm is the constructive proof.
Kuhn-Munkres algorithm is the constructive proof.
correct io format
Nevermind, got accepted...
No extra spaces or blanks in the output.
Numbers are separated by one space.
No extra spaces or blanks in the output.
Numbers are separated by one space.
I cant understand one thing, my pc is slow there is no doubt about that, it took approximately 8s, but in judge pc it got AC in only 0.76s. but when i asked official to check my code against judge pc it was more than 3s. But on the same data it is only 0.76s now! how did it happen? anybody any idea?
Self judging is the best judging!
I'm greatly pulling down the acceptance rate... :- )
Could anyone offer some test cases? I am getting WA...
[EDIT] Never mind. I've found a stupid flaw in my alternate-path finding routine. Now I'm facing TLE.
[EDIT] Accepted. Now with the slowest time in ranklist~
Could anyone offer some test cases? I am getting WA...
[EDIT] Never mind. I've found a stupid flaw in my alternate-path finding routine. Now I'm facing TLE.
[EDIT] Accepted. Now with the slowest time in ranklist~
7th Contest of Newbies
Date: December 31st, 2011 (Saturday)
Time: 12:00 - 16:00 (UTC)
URL: http://uva.onlinejudge.org
Date: December 31st, 2011 (Saturday)
Time: 12:00 - 16:00 (UTC)
URL: http://uva.onlinejudge.org