{"categories":[],"version":"1.0","width":"100%","provider_url":"https://hatena.blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F2024%2F08%2F27%2F081359\" title=\"AtCoder Beginner Contest 368 D - inamori\u2019s diary\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","description":"https://atcoder.jp/contests/abc368/tasks/abc368_d\u30a8\u30c3\u30b8\u304b\u3089\u30b0\u30e9\u30d5\u3092\u4f5c\u3063\u3066\u3001\u305d\u308c\u3092\u6728\u306b\u3057\u3066\u3001\u30eb\u30fc\u30c8\u304b\u3089\u8fbf\u308a\u307e\u3059\u3002V\u306b\u3042\u308b\u30ce\u30fc\u30c9\u3092\u30eb\u30fc\u30c8\u306b\u3059\u308b\u3068\u9593\u9055\u3044\u304c\u7121\u3044\u3067\u3059\u3002 // Minimum Steiner Tree #![allow(non_snake_case)] use std::collections::HashSet; //////////////////// library //////////////////// fn read<T: std::str::FromStr>() -> T { let mut line = String::ne\u2026","author_name":"inamori","type":"rich","url":"https://inamori.hateblo.jp/entry/2024/08/27/081359","title":"AtCoder Beginner Contest 368 D","provider_name":"Hatena Blog","author_url":"https://blog.hatena.ne.jp/inamori/","blog_url":"https://inamori.hateblo.jp/","blog_title":"inamori\u2019s diary","image_url":null,"height":"190","published":"2024-08-27 08:13:59"}