{"width":"100%","published":"2011-03-11 21:33:41","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fa-kawashiro.hatenablog.com%2Fentry%2F20110311%2F1299846821\" title=\"SRM451 div2 hard - a_kawashiro\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>","provider_url":"https://hatena.blog","blog_title":"a_kawashiro\u306e\u30d6\u30ed\u30b0","url":"https://a-kawashiro.hatenablog.com/entry/20110311/1299846821","image_url":null,"description":"BFS\u3084\u308b\u3060\u3051\u306a\u3093\u3060\u3051\u3069\u3001\u4f55\u56de\u304bTLE\u3057\u305f\u3002\u8a73\u7d30\u306f\u30bd\u30fc\u30b9\u5185\u306e\u30b3\u30e1\u30f3\u30c8\u3067\u3069\u3046\u305e #include <cmath> #include <string> #include <queue> #include <vector> using namespace std; class Q { public: int y,x,c; }; class PizzaDelivery { public: int cost[50][50]; int deliverAll(vector<string> terrain) { int h=terrain.size(),w=terrain[0].size(); Q q; qu\u2026","height":"190","title":"SRM451 div2 hard","blog_url":"https://a-kawashiro.hatenablog.com/","categories":["topcoder"],"author_url":"https://blog.hatena.ne.jp/a_kawashiro/","type":"rich","author_name":"a_kawashiro","version":"1.0","provider_name":"Hatena Blog"}