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 1029. Ministry

AC
Posted by linjek 7 Aug 2014 22:39
I solved this problem with algo of Dijkstra.
Edge : (i,j)->(i+1,j), (i-1, j), (i, j+1) with weight of a[i]j];
Re: AC
Posted by Liol 19 Feb 2022 12:11


Edited by author 19.02.2022 12:12
Re: AC
Posted by Liol 19 Feb 2022 12:11
Why I get WA?!

Edited by author 19.02.2022 12:12

Edited by author 19.02.2022 12:13