{"width":"100%","published":"2011-03-16 05:25:48","description":"\u554f\u984c\u6587:404 Not Found \u5e45\u512a\u5148\u63a2\u7d22 + \u5de1\u56de\u30bb\u30fc\u30eb\u30b9\u30de\u30f3\u306a\u554f\u984c\u3002 \u5148\u306b\u6c5a\u308c\u540c\u58eb\u306e\u6700\u77ed\u7d4c\u8def\u3092\u8a08\u7b97\u3057\u3066\u304a\u3051\u307010!\u89e3\u6cd5\u3067\u3082\u901a\u308b\u304b\u3082\u3057\u308c\u306a\u3044\u3002 \u5de1\u56de\u30bb\u30fc\u30eb\u30b9\u30de\u30f3\u306e\u5b9f\u88c5\u306e\u8efd\u3055\u306f\u7570\u5e38\u3002 #include <iostream> #include <queue> using namespace std; #define rep(i,n) for(int i=0;i<n;i++) #define INF (1<<21) static const int dx[]={1,-1,0,0} , dy[]={0,0,-1,1}; char data[30][30]; struct P{ int x,y; \u2026","blog_url":"https://kyuridenamida.hatenablog.com/","provider_name":"Hatena Blog","version":"1.0","provider_url":"https://hatena.blog","blog_title":"kyuridenamida\u306e\u30d6\u30ed\u30b0","title":"AOJ Problem 1140 : Cleaning Robot","height":"190","type":"rich","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fkyuridenamida.hatenablog.com%2Fentry%2F2011%2F03%2F16%2F052548\" title=\"AOJ Problem 1140 : Cleaning Robot - kyuridenamida\u306e\u30d6\u30ed\u30b0\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","author_name":"kyuridenamida","url":"https://kyuridenamida.hatenablog.com/entry/2011/03/16/052548","categories":["AOJ"],"image_url":null,"author_url":"https://blog.hatena.ne.jp/kyuridenamida/"}