13066 - Ant-Man's Sugar Journey

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
User avatar
Zyaad Jaunnoo
Experienced poster
Posts: 120
Joined: Tue Apr 16, 2002 10:07 am

13066 - Ant-Man's Sugar Journey

Post by Zyaad Jaunnoo » Mon Apr 03, 2017 2:12 pm

Hello there,

What algorithms did you use to solve this problem?

My idea was to build a DAG out of strongly connected components and then traverse the graph from the entry till the exit node while keeping track of the vertices being visited. But WA..

Any guidance on this problem?

Thanks!

Post Reply

Return to “Volume 130 (13000-13099)”

Who is online

Users browsing this forum: No registered users and 1 guest