{"blog_title":"a_kawashiro\u306e\u30d6\u30ed\u30b0","author_name":"a_kawashiro","provider_url":"https://hatena.blog","categories":["topcoder"],"title":"SRM479 div1 medium","version":"1.0","provider_name":"Hatena Blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fa-kawashiro.hatenablog.com%2Fentry%2F20110507%2F1304765360\" title=\"SRM479 div1 medium - 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>","height":"190","published":"2011-05-07 19:49:20","image_url":null,"width":"100%","type":"rich","description":"\u4e8c\u90e8\u63a2\u7d22\uff0b\u30c0\u30a4\u30af\u30b9\u30c8\u30e9\u3002 #include <algorithm> #include <string> #include <vector> #include <sstream> #include <queue> #include <utility> using namespace std; typedef long long LL; int n; LL limit; LL INF=((LL)1<<LL(50)); LL visited[500]; vector<int> F[500]; vector<int> T[500]; vector<int> P[500]; vector<int> D[\u2026","blog_url":"https://a-kawashiro.hatenablog.com/","author_url":"https://blog.hatena.ne.jp/a_kawashiro/","url":"https://a-kawashiro.hatenablog.com/entry/20110507/1304765360"}