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 1092. Transversal

Possibly to solve with greedy algo even now
Posted by Vedernikoff Sergey 6 May 2008 20:02
Even after anti-greedy tests were added, it is possibly to solve the problem with greedy algo. Just randomize directions in which you make "greedy walk" of the incidence matrix. The best thing is that it is impossible to kill such an algo with any anti-greesy tests! =)
Re: Possibly to solve with greedy algo even now
Posted by Denis Koshman 19 Aug 2008 02:48
I have proven greedy solution (with O(N^3) output size)