{"image_url":null,"height":"190","width":"100%","author_url":"https://blog.hatena.ne.jp/inamori/","author_name":"inamori","title":"\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u3068\u6570\u5b66 044","blog_url":"https://inamori.hateblo.jp/","categories":[],"type":"rich","description":"https://atcoder.jp/contests/math-and-algorithm/tasks/math_and_algorithm_an\u5404\u8fba\u306e\u8ddd\u96e2\u30921\u3068\u3057\u3066\u3001\u30c0\u30a4\u30af\u30b9\u30c8\u30e9\u6cd5\u3092\u4f7f\u3048\u3070\u3088\u3044\u3067\u3059\u3002 PriorityQueue\u306f\u3001BinaryHeap\u3067\u5b9f\u88c5\u3067\u304d\u307e\u3059\u3002 // Shortest Path 1 #![allow(non_snake_case)] use std::collections::BinaryHeap; //////////////////// library //////////////////// fn read<T: std::str::FromStr>() -> \u2026","published":"2023-04-13 23:10:54","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F2023%2F04%2F13%2F231054\" title=\"\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u3068\u6570\u5b66 044 - 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>","version":"1.0","provider_name":"Hatena Blog","url":"https://inamori.hateblo.jp/entry/2023/04/13/231054","blog_title":"inamori\u2019s diary","provider_url":"https://hatena.blog"}