{"height":"190","blog_title":"Logfiles","title":"AOJ2254 \u6a21\u64ec\u56fd\u51852011C Fastest Route","image_url":null,"published":"2014-03-29 11:10:37","type":"rich","author_name":"moistx","description":"\u89e3\u6cd5 bitDP\u3067\u89e3\u304f\u3002 dp[S] := \u72b6\u614bS\u3067\u30b9\u30c6\u30fc\u30b8\u3092\u5168\u3066\u30af\u30ea\u30a2\u3059\u308b\u306e\u306b\u304b\u304b\u308b\u6700\u5c0f\u6642\u9593 dp[0] = 0 for S[0, 1<<N) for i[0, N) if S\u306ei\u756a\u76ee\u306e\u30d3\u30c3\u30c8\u304c\u7acb\u3063\u3066\u3044\u306a\u3044 dp[S | (1<<i)] = min(dp[S | (1<<i)], dp[i] + T[i][0] /*\u7d20\u624b*/); for j[0,N) if S\u306ej\u756a\u76ee\u306e\u30d3\u30c3\u30c8\u304c\u7acb\u3063\u3066\u3044\u308b dp[ S | (1<<i)] = min(dp[S | (1<<i)], dp[S] + T[i][j+1])","blog_url":"https://logfiles.hatenablog.com/","provider_name":"Hatena Blog","categories":["AOJ"],"author_url":"https://blog.hatena.ne.jp/moistx/","width":"100%","version":"1.0","url":"https://logfiles.hatenablog.com/entry/20140329/1396059037","provider_url":"https://hatena.blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Flogfiles.hatenablog.com%2Fentry%2F20140329%2F1396059037\" title=\"AOJ2254 \u6a21\u64ec\u56fd\u51852011C Fastest Route - Logfiles\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>"}