{"description":"\u87fb\u672c\u304b\u3089\u3002 \u30b9\u30bf\u30fc\u30c8\u3001\u30b4\u30fc\u30eb\u3001\u58c1\u3001\u901a\u8def\u304c'S', 'G', '#', '.'\u3067\u8868\u3055\u308c\u3066\u3044\u308b\u4e8c\u6b21\u5143\u914d\u5217\u306e\u5730\u56f3\u3067\u3001\u30b9\u30bf\u30fc\u30c8\u304b\u3089\u30b4\u30fc\u30eb\u307e\u3067\u306e\u6700\u77ed\u7d4c\u8def\uff08\u5fc5\u305a\u5b58\u5728\u3059\u308b\uff09\u306e\u9577\u3055\u3092\u8fd4\u3059\u3002 \u3056\u30fbBFS\u3002 import itertools as it def solve(map_): def neighbors(i,j): dirs = ((i+i1, j+j1) for i1, j1 in it.product((-1,0,1), repeat=2)) return ((n, m) for n, m in dirs if not n==-1 and not n==len(map_) and not m==-1\u2026","version":"1.0","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fzehnpaard.hatenablog.com%2Fentry%2F2018%2F03%2F08%2F212333\" title=\"\u8ff7\u8def\u306e\u6700\u77ed\u8def\u554f\u984c - Arantium Maestum\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","author_url":"https://blog.hatena.ne.jp/zehnpaard/","image_url":null,"type":"rich","provider_url":"https://hatena.blog","published":"2018-03-08 21:23:33","provider_name":"Hatena Blog","blog_title":"Arantium Maestum","categories":["Python","\u87fb\u672c"],"title":"\u8ff7\u8def\u306e\u6700\u77ed\u8def\u554f\u984c","height":"190","author_name":"zehnpaard","blog_url":"https://zehnpaard.hatenablog.com/","url":"https://zehnpaard.hatenablog.com/entry/2018/03/08/212333","width":"100%"}