結果
問題 | No.1098 LCAs |
ユーザー |
![]() |
提出日時 | 2020-06-26 22:08:22 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 201 ms / 2,000 ms |
コード長 | 5,976 bytes |
コンパイル時間 | 1,629 ms |
コンパイル使用メモリ | 144,932 KB |
最終ジャッジ日時 | 2025-01-11 11:33:30 |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 28 |
ソースコード
#include <limits>#include <initializer_list>#include <utility>#include <bitset>#include <tuple>#include <type_traits>#include <functional>#include <string>#include <array>#include <deque>#include <list>#include <queue>#include <stack>#include <vector>#include <map>#include <set>#include <unordered_map>#include <unordered_set>#include <iterator>#include <algorithm>#include <complex>#include <random>#include <numeric>#include <iostream>#include <iomanip>#include <sstream>#include <regex>#include <cassert>#include <cstddef>#ifdef CPP17#include <variant>#endif#define endl codeforces#define ALL(v) std::begin(v), std::end(v)#define ALLR(v) std::rbegin(v), std::rend(v)using ll = std::int64_t;using ull = std::uint64_t;using pii = std::pair<int, int>;using tii = std::tuple<int, int, int>;using pll = std::pair<ll, ll>;using tll = std::tuple<ll, ll, ll>;using size_type = ssize_t;template <typename T> using vec = std::vector<T>;template <typename T> using vvec = vec<vec<T>>;template <typename T> const T& var_min(const T &t) { return t; }template <typename T> const T& var_max(const T &t) { return t; }template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }template <typename T, std::size_t Head, std::size_t... Tail>struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };template <typename T, std::size_t Head>struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;#ifdef CPP17template <typename T, typename F, typename... Args>void fill_seq(T &t, F f, Args... args) {if constexpr (std::is_invocable<F, Args...>::value) {t = f(args...);} else {for (size_type i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i);}}#endiftemplate <typename T> vec<T> make_v(size_type sz) { return vec<T>(sz); }template <typename T, typename... Tail>auto make_v(size_type hs, Tail&&... ts) {auto v = std::move(make_v<T>(std::forward<Tail>(ts)...));return vec<decltype(v)>(hs, v);}namespace init__ {struct InitIO {InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); }} init_io;}namespace graph {using Node = ll;using Weight = ll;using Edge = std::pair<Node, Weight>;template <bool Directed>struct Graph : public vvec<Edge> {using vvec<Edge>::vvec;void add_edge(Node f, Node t, Weight w = 1) {(*this)[f].emplace_back(t, w);if (!Directed) (*this)[t].emplace_back(f, w);}Graph<Directed> build_inv() const {Graph<Directed> ret(this->size());for (Node i = 0; i < this->size(); i++) {for (const Edge &e : (*this)[i]) {Node j;Weight w;std::tie(j, w) = e;if (!Directed && j < i) continue;ret.add_edge(j, i, w);}}return ret;}};template <typename Iterator>class dst_iterator {Iterator ite;public:dst_iterator(Iterator ite) : ite(ite) { }bool operator ==(const dst_iterator<Iterator> &oth) const {return ite == oth.ite;}bool operator !=(const dst_iterator<Iterator> &oth) const {return !(*this == oth);}bool operator <(const dst_iterator<Iterator> &oth) const {return ite < oth.ite;}bool operator >(const dst_iterator<Iterator> &oth) const {return ite > oth.ite;}bool operator <=(const dst_iterator<Iterator> &oth) const {return ite <= oth.ite;}bool operator >=(const dst_iterator<Iterator> &oth) const {return ite >= oth.ite;}const Node& operator *() {return ite->first;}const Node& operator *() const {return ite->first;}dst_iterator operator ++() {++ite;return ite;}};class dst_iteration {using ite_type = vec<Edge>::const_iterator;const vec<Edge> &edges;public:dst_iteration(const vec<Edge> &edges) : edges(edges) { }auto begin() const {return dst_iterator<ite_type>(edges.cbegin());}auto end() const {return dst_iterator<ite_type>(edges.cend());}};class dst_reverse_iteration {using ite_type = vec<Edge>::const_reverse_iterator;const vec<Edge> &edges;public:dst_reverse_iteration(const vec<Edge> &edges) : edges(edges) { }auto begin() const {return dst_iterator<ite_type>(edges.crbegin());}auto end() const {return dst_iterator<ite_type>(edges.crend());}};dst_iteration dst(const vec<Edge> &edges) {return dst_iteration(edges);}dst_reverse_iteration rdst(const vec<Edge> &edges) {return dst_reverse_iteration(edges);}}ll dfs(ll cur, ll pre, const graph::Graph<false> &g, vec<ll> &ans) {vec<ll> sumv;for (ll nxt : graph::dst(g[cur])) if (nxt != pre) sumv.push_back(dfs(nxt, cur, g, ans));ll ret = std::accumulate(ALL(sumv), 0ll);for (ll e : sumv) ans[cur] += e * (ret - e);ans[cur] += 2 * ret + 1;return ret + 1;}int main() {ll n;std::cin >> n;graph::Graph<false> tree(n);for (ll i = 1; i < n; i++) {ll a, b;std::cin >> a >> b;tree.add_edge(a - 1, b - 1);}vec<ll> ans(n);dfs(0, -1, tree, ans);for (ll e : ans) std::cout << e << "\n";return 0;}