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 1063. Domino Puzzle

How to solve it fast and cool?
Posted by Laise 22 Jan 2009 22:59
I solved it with next algo:
I bruteforce all possible connections (if graph consists of several not connected parts) and then add some edges for Euler path with greedy.

Of course its right algo, but some complicated (i think).
Does anyone knows more simple one?
I got AC 0.001s with brutforce all possible connections!!!
Posted by c_pp 22 Dec 2016 13:27
Only use buffered i/o )).