13040 - Flyovers of Khaka

All about problems in Volume 130. If there is a thread about your problem, please use it. If not, create one with its number in the subject.
Post Reply
New poster
Posts: 20
Joined: Tue Jan 22, 2013 4:39 pm

13040 - Flyovers of Khaka

Post by Hikari9 » Tue Dec 15, 2015 7:36 pm

Problem description says:
"So the Government has decided to let Bodi travel each road only once and build some flyovers, which connects two notable places, so that he can complete his visit to all the notable places while going through every road in Khakha city."

I'm confused. Is this euler path creation, hamiltonian path creation or both? I don't think it's hamiltonian, because it says everything is connected already. I tried forcing the euler path through greedily adding cheapest flyovers while odd degrees exceed 2, but it gets WA. Help please? :C

Post Reply

Return to “Volume 130 (13000-13099)”