{"provider_name":"Hatena Blog","published":"2020-09-26 09:00:00","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fkmjp.hatenablog.jp%2Fentry%2F2020%2F09%2F26%2F0900\" title=\"Codeforces #625 Div1 A. Journey Planning - kmjp&#39;s blog\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","blog_title":"kmjp's blog","author_url":"https://blog.hatena.ne.jp/kmjp/","author_name":"kmjp","url":"https://kmjp.hatenablog.jp/entry/2020/09/26/0900","image_url":null,"provider_url":"https://hatena.blog","title":"Codeforces #625 Div1 A. Journey Planning","height":"190","blog_url":"https://kmjp.hatenablog.jp/","categories":["Codeforces"],"type":"rich","width":"100%","version":"1.0","description":"\u5272\u3068\u7c21\u5358\u76ee\u306a\u554f\u984c\u3092\u843d\u3068\u3057\u3066\u3057\u307e\u3063\u305f\u56de\u3002 https://codeforces.com/contest/1320/problem/A"}