{"categories":["topcoder"],"published":"2011-04-04 18:41:59","width":"100%","blog_title":"a_kawashiro\u306e\u30d6\u30ed\u30b0","provider_url":"https://hatena.blog","author_name":"a_kawashiro","url":"https://a-kawashiro.hatenablog.com/entry/20110404/1301910119","provider_name":"Hatena Blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fa-kawashiro.hatenablog.com%2Fentry%2F20110404%2F1301910119\" title=\"SRM319 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>","author_url":"https://blog.hatena.ne.jp/a_kawashiro/","description":"\uff15\u6642\u9593\u304b\u304b\u3063\u305forz #include <sstream> #include <string> #include <vector> using namespace std; class IncompleteBST { public: char tree[(1<<20)]; bool rec(int cur,char bottom,char ceil) { if((1<<20)<=cur || tree[cur]=='#') return true; if(tree[cur]<bottom || ceil<tree[cur]) return false; return rec(cur*2,bot\u2026","height":"190","version":"1.0","type":"rich","blog_url":"https://a-kawashiro.hatenablog.com/","image_url":null,"title":"SRM319 div2 hard"}