結果
問題 | No.1418 Sum of Sum of Subtree Size |
ユーザー |
![]() |
提出日時 | 2021-03-05 21:47:21 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 70 ms / 2,000 ms |
コード長 | 2,952 bytes |
コンパイル時間 | 1,168 ms |
コンパイル使用メモリ | 127,596 KB |
最終ジャッジ日時 | 2025-01-19 10:51:56 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 41 |
ソースコード
#include <iostream> #include <cstdio> #include <cstdlib> #include <algorithm> #include <cmath> #include <vector> #include <set> #include <map> #include <unordered_set> #include <unordered_map> #include <queue> #include <ctime> #include <cassert> #include <complex> #include <string> #include <cstring> #include <chrono> #include <random> #include <bitset> #include <fstream> using namespace std; #define int long long #define ii pair <int, int> #define app push_back #define all(a) a.begin(), a.end() #define bp __builtin_popcountll #define ll long long #define mp make_pair #define x first #define y second #define Time (double)clock()/CLOCKS_PER_SEC #define debug(x) std::cerr << #x << ": " << x << '\n'; #define FOR(i, n) for (int i = 0; i < n; ++i) #define pb push_back #define trav(a, x) for (auto& a : x) using vi = vector<int>; template <typename T> std::ostream& operator <<(std::ostream& output, const pair <T, T> & data) { output << "(" << data.x << "," << data.y << ")"; return output; } template <typename T> std::ostream& operator <<(std::ostream& output, const std::vector<T>& data) { for (const T& x : data) output << x << " "; return output; } ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down ll math_mod(ll a, ll b) { return a - b * div_down(a, b); } #define tcT template<class T #define tcTU tcT, class U tcT> using V = vector<T>; tcT> void re(V<T>& x) { trav(a, x) cin >> a; } tcT> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } // set a = min(a,b) tcT> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } ll gcd(ll a, ll b) { while (b) { tie(a, b) = mp(b, a % b); } return a; } const int N = 1e5+7; int n; vi g[N]; const int LG = 20; int ptr = 0, to[N][LG], h[N], l[N], r[N]; int cnt[N]; int ans = 0; void calc(int u, int p) { to[u][0] = p; for (int i = 1; i < LG; ++i) to[u][i] = to[to[u][i-1]][i-1]; l[u] = ptr; ptr++; cnt[u] = 1; for (int v : g[u]) if (v != p) { h[v] = h[u]+1; calc(v, u); cnt[u] += cnt[v]; ans += cnt[v] * (n - cnt[v]); } ans += (n - cnt[u]) * cnt[u]; ans += n; r[u] = ptr - 1; } bool anc(int u, int v) { return l[u] <= l[v] && r[v] <= r[u]; } int lca(int u, int v) { if (anc(u,v)) return u; for (int i = LG - 1; i >= 0; --i) if (!anc(to[u][i], v)) u = to[u][i]; return to[u][0]; } int dist(int u, int v) { return h[u] + h[v] - 2 * h[lca(u,v)]; } signed main() { #ifdef ONLINE_JUDGE #define endl '\n' ios_base::sync_with_stdio(0); cin.tie(0); #endif cin >> n; FOR (i, n - 1) { int u, v; cin >> u >> v; g[u].app(v); g[v].app(u); } calc(1, 1); cout << ans << endl; }