結果
| 問題 |
No.1418 Sum of Sum of Subtree Size
|
| コンテスト | |
| ユーザー |
 iiljj
|
| 提出日時 | 2021-03-05 23:00:08 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 141 ms / 2,000 ms |
| コード長 | 11,072 bytes |
| コンパイル時間 | 1,685 ms |
| コンパイル使用メモリ | 151,844 KB |
| 最終ジャッジ日時 | 2025-01-19 11:52:30 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 41 |
ソースコード
/* #region Head */
// #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert> // assert.h
#include <cmath> // math.h
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;
#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))
#define endl '\n'
constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;
template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
for (T &x : vec) is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)
os << "{";
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
os << "}";
return os;
}
template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
return os;
}
template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力
REP(i, 0, SIZE(arr)) is >> arr[i];
return is;
}
template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump)
os << "{";
REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");
os << "}";
return os;
}
template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
is >> pair_var.first >> pair_var.second;
return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, const T &map_var) {
os << "{";
REPI(itr, map_var) {
os << *itr;
auto itrcp = itr;
if (++itrcp != map_var.end()) os << ", ";
}
return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {
return out_iter(os, map_var);
}
template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {
os << "{";
REPI(itr, map_var) {
auto [key, value] = *itr;
os << "(" << key << ", " << value << ")";
auto itrcp = itr;
if (++itrcp != map_var.end()) os << ", ";
}
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {
pq<T> pq_cp(pq_var);
os << "{";
if (!pq_cp.empty()) {
os << pq_cp.top(), pq_cp.pop();
while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
}
return os << "}";
}
void pprint() { cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&... tail) {
cout << head;
if (sizeof...(Tail) > 0) cout << ' ';
pprint(move(tail)...);
}
// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0) DUMPOUT << ", ";
dump_func(move(tail)...);
}
// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
if (comp(xmax, x)) {
xmax = x;
return true;
}
return false;
}
// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
if (comp(x, xmin)) {
xmin = x;
return true;
}
return false;
}
// ローカル用
#ifndef ONLINE_JUDGE
#define DEBUG_
#endif
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
#define VAR(type, ...) \
type __VA_ARGS__; \
cin >> __VA_ARGS__;
template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }
struct AtCoderInitialize {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
AtCoderInitialize() {
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH) cout << unitbuf;
}
} ATCODER_INITIALIZE;
void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }
/* #endregion */
// #include <atcoder/all>
// using namespace atcoder;
/* #region ReRooting */
template <class T> class ReRooting {
public:
int n; // node cnt
private:
T ti; // identity
function<T(T, T)> merge;
function<T(T, int)> addNode;
vc<vc<int>> adjs, idxForAdjs; // adjacents
vc<vc<T>> dp;
vc<T> res;
public:
ReRooting(int n, vc<vc<int>> edges, T ti, function<T(T, T)> merge, function<T(T, int)> addNode)
: n(n), ti(ti), merge(merge), addNode(addNode), adjs(n), idxForAdjs(n), dp(n), res(n) {
for (vc<int> &edge : edges) {
idxForAdjs[edge[0]].push_back(SIZE(adjs[edge[1]]));
idxForAdjs[edge[1]].push_back(SIZE(adjs[edge[0]]));
adjs[edge[0]].push_back(edge[1]);
adjs[edge[1]].push_back(edge[0]);
}
REP(i, 0, SIZE(adjs)) dp[i].resize(SIZE(adjs[i]));
if (n > 1)
init();
else if (n == 1)
res[0] = addNode(ti, 0);
}
T query(int node) { return res[node]; }
private:
void init() {
vc<int> parents(n);
vc<int> order(n);
{ // 行きがけ順の記録
int index = 0;
stack<int> stack;
stack.push(0);
parents[0] = -1;
while (stack.size() > 0) {
int node = stack.top();
stack.pop();
order[index++] = node;
for (int adjacent : adjs[node]) {
if (adjacent == parents[node]) continue;
stack.push(adjacent);
parents[adjacent] = node;
}
}
}
{ // 帰りがけ順で部分木の値を求めていく
REPR(i, SIZE(order) - 1, 1) {
int node = order[i], parent = parents[node];
T accum = ti;
int parentIndex = -1;
REP(j, 0, SIZE(adjs[node])) {
if (adjs[node][j] == parent)
parentIndex = j;
else
accum = merge(accum, dp[node][j]);
}
dp[parent][idxForAdjs[node][parentIndex]] = addNode(accum, node);
}
}
// 行きがけ順で頂点の値を確定させていく
for (int node : order) {
int sz = SIZE(adjs[node]);
T accum = ti;
vc<T> accumsFromTail(sz);
accumsFromTail[sz - 1] = ti;
REPR(j, sz - 1, 1) accumsFromTail[j - 1] = merge(dp[node][j], accumsFromTail[j]);
REP(j, 0, sz) {
dp[adjs[node][j]][idxForAdjs[node][j]] = addNode(merge(accum, accumsFromTail[j]), node);
accum = merge(accum, dp[node][j]);
}
res[node] = addNode(accum, node);
}
} // end init
};
/* #endregion */
// Problem
void solve() {
VAR(ll, n);
vc<int> a(n - 1), b(n - 1);
REP(i, 0, n - 1) {
cin >> a[i] >> b[i];
--a[i], --b[i];
}
vc<vc<int>> edges(n - 1);
REP(i, 0, n - 1) edges[i] = {a[i], b[i]};
// (部分木，全体)
auto merge = [](pll dp_cum, pll d) -> pll {
dp_cum.first += d.first;
dp_cum.second += d.second;
return dp_cum;
};
auto addNode = [](pll d, [[maybe_unused]] int id) -> pll {
d.first += 1;
d.second += d.first;
return d;
};
ReRooting<pll> rr(n, edges, {0LL, 0LL}, merge, addNode);
ll ans = 0;
REP(root, 0, n) ans += rr.query(root).second;
pprint(ans);
}
// entry point
int main() {
solve();
return 0;
}