Send your feedback or ask for help here!
Thanks for approval for any query ask it here only,Thanks
has lost is mother
in km.each block =10km
Would look even better if grammar/punctuation/spelling are improved. More improvement could be possible in the input/constraint sections.
In the above 2nd quote the mentioning of 10km can be unnecessary as this detail is already in input.
In case the author do not know it… you can and should continue editing your published puzzle to improve wordings, fixing errors in statement, or even fixing bug in test cases/validators.
Puzzle approvers can also take up the role to make improvement. “With great power there must also come great responsibility” - Peter Parker.
Thanks i will edit my puzzle and will fix wordings
Fixed them suggest any other changes if needed.
Passed all validators except of the 3rd. Any suggestions on possible problems?
If your code passes all the IDE tests it should work on validator 3, it’s similar to test 3.
So I tried to resolve the problem (which is new for me)
From what I understood, a way to solve the problem is to use the dijkstra algorithm from the proposed ressource.
So I try to create a graphe composed of vertices and edges to apply the algorithm.
But here is the trouble: when I parkour the table, I add the vertices into a set (the set ‘vertices’) but for some reasons, even if I find the coordinates of my starting end my ending point, the value for the ending point “M” is always en empty tuple (which should be the coordinates of the value M in the table)…
Any help, its driving me crazy XD
Thank for the puzzles
Ok the trouble came from the fact I called a variable ‘end_p’.
‘end_pa’ didn’t work neither.
The trouble add nothing to do with an immutable type or whatsoever… This was a trouble to find.
a simple flood fill algorithm works for me