{"categories":["\u89e3\u8aacAC\u3001\u307e\u3060\u81ea\u529b\u3067\u66f8\u3051\u3066\u306a\u3044"],"blog_url":"https://melty-chocolate.hateblo.jp/","author_name":"melty_chocolate","title":"ABC385 E Snowflake Tree (\u6c34\u8272)","width":"100%","author_url":"https://blog.hatena.ne.jp/melty_chocolate/","height":"190","image_url":null,"description":"1/8 \u89e3\u8aacAC\u30b0\u30e9\u30d5\u306e\u554f\u984c\u3001\u82e6\u624b\u3060\u306a\u3041 signed main(){ int N;cin >> N; vector<vector<int>>G(N); vector<int>deg(N,0); rep(i,N-1){ int u,v;cin >> u >> v; u--;v--; G[u].push_back(v); G[v].push_back(u); deg[u]++; deg[v]++; } int res = N; rep(v,N){//\u4e2d\u5fc3\u3092\u5168\u90e8\u8a66\u3059 //\u3044\u304f\u3064\u6b8b\u3059\u304b\u3092\u8003\u3048\u308b vector<int>d; for(auto u:G[v]){ d.push_back(deg[u]); \u2026","type":"rich","version":"1.0","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fmelty-chocolate.hateblo.jp%2Fentry%2F2025%2F01%2F08%2F183515\" title=\"ABC385 E Snowflake Tree (\u6c34\u8272) - \u7cbe\u9032\u9332\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","published":"2025-01-08 18:35:15","provider_url":"https://hatena.blog","blog_title":"\u7cbe\u9032\u9332","url":"https://melty-chocolate.hateblo.jp/entry/2025/01/08/183515","provider_name":"Hatena Blog"}