{"provider_name":"Hatena Blog","provider_url":"https://hatena.blog","author_url":"https://blog.hatena.ne.jp/a_kawashiro/","image_url":null,"url":"https://a-kawashiro.hatenablog.com/entry/20110405/1301997486","blog_title":"a_kawashiro\u306e\u30d6\u30ed\u30b0","published":"2011-04-05 18:58:06","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fa-kawashiro.hatenablog.com%2Fentry%2F20110405%2F1301997486\" title=\"SRM442 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>","title":"SRM442 div2 hard","author_name":"a_kawashiro","description":"\u5dee\u3092\u4fdd\u5b58\u3059\u308b\u3068\u3053\u308d\u307e\u3067\u306f\u601d\u3044\u3064\u3044\u305f\u306e\u306b\u3001\u6b8b\u5ff5\u3002 #include <cstring> #include <vector> #define TOWER_MAX 250000 using namespace std; class EqualTowers { public: int n; vector<int> bricks; int cache[TOWER_MAX+1][50]; int rec(int dif,int k) { if((k==n && dif!=0) || TOWER_MAX<dif) return -(1<<28); if(k==n && dif==0) return 0; i\u2026","version":"1.0","height":"190","type":"rich","width":"100%","categories":["topcoder"],"blog_url":"https://a-kawashiro.hatenablog.com/"}