結果
問題 | No.1418 Sum of Sum of Subtree Size |
ユーザー |
![]() |
提出日時 | 2021-04-03 11:43:01 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 83 ms / 2,000 ms |
コード長 | 9,729 bytes |
コンパイル時間 | 8,215 ms |
コンパイル使用メモリ | 203,032 KB |
最終ジャッジ日時 | 2025-01-20 10:26:38 |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 41 |
ソースコード
#line 2 "library/other/template.hpp"#define _CRT_SECURE_NO_WARNINGS#ifdef ONLINE_JUDGE#pragma GCC target("avx512f")#elif defined EVAL#else#pragma GCC target("avx2")#endif#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <string.h>#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <cfloat>#include <climits>#include <cmath>#include <complex>#include <ctime>#include <deque>#include <fstream>#include <functional>#include <iomanip>#include <iostream>#include <iterator>#include <list>#include <map>#include <memory>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>#define rep(i, n) for (int i = 0; i < int(n); i++)#define REP(i, n) for (int i = 1; i <= int(n); i++)#define all(V) V.begin(), V.end()using i128 = __int128_t;using u128 = __uint128_t;using uint = unsigned int;using lint = long long;using ulint = unsigned long long;using IP = std::pair<int, int>;using LP = std::pair<lint, lint>;constexpr int INF = INT_MAX / 2;constexpr lint LINF = LLONG_MAX / 2;constexpr double eps = DBL_EPSILON;constexpr double PI = 3.141592653589793238462643383279;template <class T>class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {};template <class F>inline constexpr decltype(auto) lambda_fix(F&& f) {return [f = std::forward<F>(f)](auto&&... args) {return f(f, std::forward<decltype(args)>(args)...);};}template <class T>constexpr std::vector<T> make_vec(size_t n) {return std::vector<T>(n);}template <class T, class... Args>constexpr auto make_vec(size_t n, Args&&... args) {return std::vector<decltype(make_vec<T>(args...))>(n, make_vec<T>(std::forward<Args>(args)...));}template <class T, class U>constexpr inline bool chmax(T& lhs, const U& rhs) noexcept {if (lhs < rhs) {lhs = rhs;return true;}return false;}template <class T, class U>constexpr inline bool chmin(T& lhs, const U& rhs) noexcept {if (lhs > rhs) {lhs = rhs;return true;}return false;}constexpr inline lint gcd(lint a, lint b) noexcept {while (b) {lint c = a;a = b;b = c % b;}return a;}inline lint lcm(lint a, lint b) noexcept { return a / gcd(a, b) * b; }constexpr bool isprime(lint n) noexcept {if (n == 1) return false;for (int i = 2; i * i <= n; i++) {if (n % i == 0) return false;}return true;}template <class T>constexpr T mypow(T a, lint b) noexcept {T res(1);while (true) {if (b & 1) res *= a;b >>= 1;if (!b) break;a *= a;}return res;}constexpr lint modpow(lint a, lint b, lint m) noexcept {a %= m;lint res(1);while (b) {if (b & 1) {res *= a;res %= m;}a *= a;a %= m;b >>= 1;}return res;}template <class T>constexpr void printArray(const std::vector<T>& vec, char split = ' ') {rep(i, vec.size()) {std::cout << vec[i];std::cout << (i == (int)vec.size() - 1 ? '\n' : split);}}template <class InputIter>constexpr void printArray(InputIter l, InputIter r, char split = ' ') {auto rprev = std::prev(r);for (auto i = l; i != r; i++) {std::cout << *i;std::cout << (i == rprev ? '\n' : split);}}LP extGcd(lint a, lint b) noexcept {if (b == 0) return {1, 0};LP s = extGcd(b, a % b);std::swap(s.first, s.second);s.second -= a / b * s.first;return s;}LP ChineseRem(const lint& b1, const lint& m1, const lint& b2,const lint& m2) noexcept {auto p = extGcd(m1, m2);lint g = gcd(m1, m2), l = m1 / g * m2;lint tmp = (b2 - b1) / g * p.first % (m2 / g);lint r = (b1 + m1 * tmp + l) % l;return {r, l};}int LCS(const std::string& a, const std::string& b) {auto dp = make_vec<int>(a.size() + 1, b.size() + 1);rep(i, a.size()) {rep(j, b.size()) {chmax(dp[i + 1][j], dp[i][j]);chmax(dp[i][j + 1], dp[i][j]);if (a[i] == b[j]) chmax(dp[i + 1][j + 1], dp[i][j] + 1);}chmax(dp[i + 1][b.size()], dp[i][b.size()]);}rep(j, b.size()) chmax(dp[a.size()][j + 1], dp[a.size()][j]);return dp[a.size()][b.size()];}template <class T, std::enable_if_t<std::is_convertible<int, T>::value,std::nullptr_t> = nullptr>void compress(std::vector<T>& vec) {auto tmp = vec;std::sort(all(tmp));tmp.erase(std::unique(all(tmp)), tmp.end());for (T& i : vec) i = std::lower_bound(all(tmp), i) - tmp.begin();}template <class T>void compress(T* l, T* r) {std::vector<T> tmp(l, r);std::sort(all(tmp));tmp.erase(std::unique(all(tmp)), tmp.end());for (auto i = l; i < r; i++) {*i = std::lower_bound(all(tmp), *i) - tmp.begin();}}template <class InputIter>void compress(InputIter l, InputIter r) {std::vector<typename InputIter::value_type> tmp(l, r);std::sort(all(tmp));tmp.erase(std::unique(all(tmp)), tmp.end());for (auto i = l; i < r; i++) {*i = std::lower_bound(all(tmp), *i) - tmp.begin();}}#line 3 "library/other/type_traits.hpp"class ModInt__Base {};class StaticModInt__Base : ModInt__Base {};class DynamicModInt__Base : ModInt__Base {};template <class T>class is_ModInt : public std::is_base_of<ModInt__Base, T> {};template <class T>constexpr bool is_ModInt_v = is_ModInt<T>::value;template <class T>class is_StaticModInt : public std::is_base_of<StaticModInt__Base, T> {};template <class T>constexpr bool is_StaticModInt_v = is_StaticModInt<T>::value;template <class T>class is_DynamicModInt : public std::is_base_of<DynamicModInt__Base, T> {};template <class T>constexpr bool is_DynamicModInt_v = is_DynamicModInt<T>::value;#line 4 "library/algebraic/StaticModInt.hpp"template <uint modulo>class StaticModInt : StaticModInt__Base {std::conditional_t<(modulo > INT_MAX >> 1), lint, int> value;public:static constexpr uint mod_value = modulo;constexpr StaticModInt() : value(0) {}template <class T,std::enable_if_t<!std::is_convertible<T, StaticModInt>::value,std::nullptr_t> = nullptr>constexpr StaticModInt(T value = 0) : value(value) {this->value =(value < 0 ? -(-value % modulo) + modulo : lint(value)) % modulo;}inline constexpr StaticModInt inv() const {return mypow(*this, modulo - 2);}inline constexpr operator int() const { return value; }inline constexpr StaticModInt& operator+=(const StaticModInt& x) {value = value + x.value;if (value >= modulo) value -= modulo;return *this;}inline constexpr StaticModInt& operator++() {if (value == modulo - 1)value = 0;elsevalue++;return *this;}inline constexpr StaticModInt operator++(int) {StaticModInt res = *this;++*this;return res;}inline constexpr StaticModInt operator-() const {return StaticModInt(0) -= *this;}inline constexpr StaticModInt& operator-=(const StaticModInt& x) {value -= x.value;if (value < 0) value += modulo;return *this;}inline constexpr StaticModInt& operator--() {if (value == 0)value = modulo - 1;elsevalue--;return *this;}inline constexpr StaticModInt operator--(int) {StaticModInt res = *this;--*this;return res;}inline constexpr StaticModInt& operator*=(const StaticModInt& x) {value = (lint)value * x.value % modulo;return *this;}inline constexpr StaticModInt& operator/=(const StaticModInt& rhs) {return *this *= rhs.inv();}template <class T>constexpr StaticModInt operator+(const T& rhs) const {return StaticModInt(*this) += rhs;}template <class T>constexpr StaticModInt& operator+=(const T& rhs) {return operator+=(StaticModInt(rhs));}template <class T>constexpr StaticModInt operator-(const T& rhs) const {return StaticModInt(*this) -= rhs;}template <class T>constexpr StaticModInt& operator-=(const T& rhs) {return operator-=(StaticModInt(rhs));}template <class T>constexpr StaticModInt operator*(const T& rhs) const {return StaticModInt(*this) *= rhs;}template <class T>constexpr StaticModInt& operator*=(const T& rhs) {return operator*=(StaticModInt(rhs));}template <class T>constexpr StaticModInt operator/(const T& rhs) const {return StaticModInt(*this) /= rhs;}template <class T>constexpr StaticModInt& operator/=(const T& rhs) {return operator/=(StaticModInt(rhs));}static int primitive_root() {static int p = 0;static std::random_device rd;static std::mt19937 mt(rd());static std::uniform_int_distribution<> uid(1, modulo - 1);if (p) return 0;// use naive factorize due to file size limitstd::vector<int> vec;int tmp = modulo - 1;for (int i = 2; i * i <= tmp; i++) {if (tmp % i == 0) {vec.emplace_back(i);do {tmp /= i;} while (tmp % i == 0);}}if (tmp != 1) vec.emplace_back(tmp);vec.erase(std::unique(all(vec)), vec.end());while (true) {p = uid(mt);bool f = true;for (const auto& i : vec) {if (mypow(StaticModInt(p), (modulo - 1) / i) == 1) {f = false;break;}}if (f) return p;}}};template <uint modulo>std::istream& operator>>(std::istream& ist, StaticModInt<modulo>& x) {lint a;ist >> a;x = a;return ist;}/*** @title StaticModInt*/#line 3 "main.cpp"int N, sz[100010];std::vector<int> vec[100010];int main() {std::cin >> N;rep(i, N - 1) {int A, B;std::cin >> A >> B;vec[A].emplace_back(B);vec[B].emplace_back(A);}std::fill(sz + 1, sz + N + 1, -1);lint ans = 0;lambda_fix([&](auto self, int node) -> void {sz[node] = 1;for (int i : vec[node]) {if (sz[i] == -1) {self(self, i);sz[node] += sz[i];ans += sz[i] * lint(N - sz[i]);}}ans += N + sz[node] * lint(N - sz[node]);})(1);std::cout << ans << std::endl;return 0;}