結果

問題 No.1418 Sum of Sum of Subtree Size
ユーザー yuji9511yuji9511
提出日時 2021-03-06 01:03:04
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 58 ms / 2,000 ms
コード長 2,152 bytes
コンパイル時間 2,024 ms
コンパイル使用メモリ 204,324 KB
最終ジャッジ日時 2025-01-19 12:12:39
ジャッジサーバーID
(参考情報)
judge3 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 41
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

/*** author: yuji9511 ***/
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
using vll = vector<ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
ostream& operator<<(ostream& os, lpair& h){ os << "(" << h.first << ", " << h.second << ")"; return os;}
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void solve(){
ll N;
cin >> N;
vector<vll> tree(N);
rep(i,0,N-1){
ll a,b;
cin >> a >> b;
a--; b--;
tree[a].push_back(b);
tree[b].push_back(a);
}
vll v(N, 0), sum(N,0);
auto dfs = [&](auto dfs, ll cur, ll par) -> void {
for(auto &e: tree[cur]){
if(e == par) continue;
dfs(dfs, e, cur);
v[cur] += v[e];
}
v[cur]++;
};
auto dfs2 = [&](auto dfs2, ll cur, ll par) -> void {
for(auto &e: tree[cur]){
if(e == par) continue;
dfs2(dfs2, e, cur);
sum[cur] += sum[e];
sum[cur] += v[e];
}
sum[cur]++;
};
dfs(dfs, 0, -1);
dfs2(dfs2, 0, -1);
ll ans = 0;
auto calc = [&](auto calc, ll cur, ll par) -> void {
ans += sum[cur];
for(auto &e: tree[cur]){
if(e == par) continue;
ll t1 = sum[cur], t2 = sum[e];
ll val = sum[cur] - N - sum[e];
sum[e] += N - v[e];
sum[cur] = val + N - v[e];
sum[e] += sum[cur];
calc(calc, e, cur);
sum[cur] = t1;
sum[e] = t2;
}
};
calc(calc, 0, -1);
print(ans);
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
solve();
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0