R.I.P Tet

*in CF not CP

"It can be proved that doing dijkstra in the new graph is sufficient if we guarantee that the first used edge is not fake.

We can map waiting for x seconds and then using an edge to go to u from v to using a cannon and then using x fake edges to go to u from v."

Ali_Tavakoli orz

aha :)

no my birth date in shamsi calendar which this year is 1399th year of this calendar

My first rating was my birth date

orz

Did you solve that? What did you do? Binary search + idea or you did Some Other Algorithms