ABC184E

https://gyazo.com/3b62a4951b2100ef564ece4d0770989b

Width-first search with increasing distance by 1

The muddy part is loading the necessary values in a usable form.

I wanted the start and finish line to be given separately, not written on a map.

Nothing particularly interesting there.

I TLE'd on the width-first search, so I assumed the warp part wasn't a good idea and jitters and TLE'd four times.

I had figured out that the same letter warp is only used once, and I was trying to figure out how to avoid trying it twice.

Turns out, the cause wasn't there, but where they had a list of "next vertices to visit".

AC if you change it to a set.

code:python

def solve(data):

DIR4 = dir4()

ret = 0

while to_visit:

new_visit = []

for p in to_visit:

if p == GOAL:

return ret

if v > 0: # WARP

new_visit.append(p2)

for d in DIR4:

p2 = p + d

new_visit.append(p2)

to_visit = set(new_visit)

ret += 1

return -1

---