{"categories":["\u65e5\u8a18","C++","Memo"],"url":"https://jeneshicc.hatenadiary.org/entry/20090927/1254051055","version":"1.0","title":"Google Code Jam 2009 Round2 B \uff08\u30e1\u30e2\uff09","type":"rich","provider_name":"Hatena Blog","width":"100%","blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66","description":"\u66f8\u3044\u3066\u307f\u305f\uff0e Haskell\u3067\u306f\uff0c\u9762\u5012\u306b\u306a\u308b\u3053\u3068\u304c\u4e88\u60f3\u3055\u308c\u305f\u306e\u3067\uff0cC++\u3067\uff0e \u591a\u5206\uff0c\u6a19\u6e96\u7684\u306a\u89e3\u6cd5\u3060\u3068\u601d\u3046\uff0e\u305f\u3060\u306eDP. #include <iostream> #include <cstdlib> using namespace std; #define rep(i, n) for (int i = 0; i < (int)(n); i++) const int R = 50, C = 50, U = R*C+1; char cave[R][C]; int dig[R][C][C], emptyL[R][C], emptyR[R][C], groundL[R][C], groundR[R][C\u2026","published":"2009-09-27 20:30:55","author_name":"jeneshicc","author_url":"https://blog.hatena.ne.jp/jeneshicc/","blog_url":"https://jeneshicc.hatenadiary.org/","image_url":null,"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20090927%2F1254051055\" title=\"Google Code Jam 2009 Round2 B \uff08\u30e1\u30e2\uff09 - \u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66\" 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","height":"190"}