{"published":"2018-09-17 09:00:00","categories":["Codeforces"],"provider_url":"https://hatena.blog","description":"\u3044\u3064\u3082\u306e2500pt/3000pt\u3088\u308a\u306f\u5c11\u3057\u7c21\u5358\u304b\u3002 http://codeforces.com/contest/1041/problem/E","author_name":"kmjp","version":"1.0","title":"Codeforces #509 Div2 E. Tree Reconstruction","blog_url":"https://kmjp.hatenablog.jp/","author_url":"https://blog.hatena.ne.jp/kmjp/","width":"100%","type":"rich","blog_title":"kmjp's blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fkmjp.hatenablog.jp%2Fentry%2F2018%2F09%2F17%2F0900\" title=\"Codeforces #509 Div2 E. Tree Reconstruction - 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>","height":"190","image_url":null,"url":"https://kmjp.hatenablog.jp/entry/2018/09/17/0900","provider_name":"Hatena Blog"}