結果

問題 No.1418 Sum of Sum of Subtree Size
ユーザー mjtaimjtai
提出日時 2021-03-05 23:07:19
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 76 ms / 2,000 ms
コード長 6,659 bytes
コンパイル時間 2,720 ms
コンパイル使用メモリ 223,404 KB
実行使用メモリ 26,564 KB
最終ジャッジ日時 2024-10-07 04:38:23
合計ジャッジ時間 5,322 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
8,064 KB
testcase_01 AC 4 ms
8,192 KB
testcase_02 AC 4 ms
8,064 KB
testcase_03 AC 73 ms
18,572 KB
testcase_04 AC 73 ms
18,752 KB
testcase_05 AC 68 ms
18,720 KB
testcase_06 AC 75 ms
18,540 KB
testcase_07 AC 76 ms
18,780 KB
testcase_08 AC 45 ms
15,300 KB
testcase_09 AC 22 ms
11,460 KB
testcase_10 AC 24 ms
11,744 KB
testcase_11 AC 14 ms
10,052 KB
testcase_12 AC 36 ms
13,764 KB
testcase_13 AC 44 ms
14,788 KB
testcase_14 AC 46 ms
15,044 KB
testcase_15 AC 35 ms
13,244 KB
testcase_16 AC 7 ms
8,832 KB
testcase_17 AC 7 ms
8,704 KB
testcase_18 AC 64 ms
17,856 KB
testcase_19 AC 13 ms
9,840 KB
testcase_20 AC 5 ms
8,192 KB
testcase_21 AC 33 ms
13,120 KB
testcase_22 AC 28 ms
12,356 KB
testcase_23 AC 7 ms
8,448 KB
testcase_24 AC 5 ms
8,576 KB
testcase_25 AC 6 ms
8,448 KB
testcase_26 AC 6 ms
8,576 KB
testcase_27 AC 4 ms
8,320 KB
testcase_28 AC 4 ms
8,192 KB
testcase_29 AC 6 ms
8,704 KB
testcase_30 AC 6 ms
8,576 KB
testcase_31 AC 5 ms
8,448 KB
testcase_32 AC 5 ms
8,448 KB
testcase_33 AC 16 ms
12,096 KB
testcase_34 AC 63 ms
26,564 KB
testcase_35 AC 27 ms
15,676 KB
testcase_36 AC 8 ms
9,276 KB
testcase_37 AC 44 ms
17,856 KB
testcase_38 AC 44 ms
17,276 KB
testcase_39 AC 5 ms
8,192 KB
testcase_40 AC 5 ms
8,064 KB
testcase_41 AC 5 ms
8,064 KB
testcase_42 AC 4 ms
8,192 KB
testcase_43 AC 5 ms
8,064 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

///////////////////////////////////////////////////////////////////////////////

#include <bits/stdc++.h>
#include <unistd.h>
#include <time.h>
#include <sys/time.h>

using namespace std;

///////////////////////////////////////////////////////////////////////////////

#define DEBUG 0

#define pb push_back
#define V vector
#define S static

#define rep(i,n) for(ll i=0LL; i<n; ++i)
#define srep(i,s,n) for(ll i=s; i<n; ++i)
#define rrep(i,n) for(ll i=n-1LL; i>=0LL; --i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define CIN(x) do { \
        assert(!cin.eof()); \
        cin >> x; \
        assert(!cin.fail()); \
} while(0);
#if DEBUG
#define debug_print(...) _debug_print(__VA_ARGS__)
#define debug_printf(...) printf(__VA_ARGS__)
#define debug_print_time _debug_print_time
#else // DEBUG
#define debug_print(...)
#define debug_printf(...)
#define debug_print_time
#endif // DEBUG

typedef long long ll;
typedef unsigned long long ull;
typedef __int128_t ll128;
typedef tuple<ll, ll> t2;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
template <typename T>
using priority_queue_incr = priority_queue<T, V<T>, greater<T> >;

///////////////////////////////////////////////////////////////////////////////

template <typename TT, typename T>
void incr_m(map<TT, T> &m, TT k)
{
    if (m.find(k) == m.end()) m[k] = 0;
    m[k]++;
}

void llin(ll &a)
{
    CIN(a);
}

void llinl1(V<ll> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a;
        CIN(a);
        v.push_back(a);
    }
}

void llinl2(V<t2> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b;
        CIN(a >> b);
        v.push_back(t2(a, b));
    }
}

void llinl3(V<t3> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c;
        CIN(a >> b >> c);
        v.push_back(t3(a, b, c));
    }
}

void llinl4(V<t4> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c, d;
        CIN(a >> b >> c >> d);
        v.push_back(t4(a, b, c, d));
    }
}

void llina(V<ll> &v, ll count)
{
    llinl1(v, count);
}

template <typename T>
void sort(V<T> &v)
{
    sort(v.begin(), v.end());
}

template <typename T>
void sort_reverse(V<T> &v)
{
    sort(v.begin(), v.end(), greater<T>());
}

t2 _ext_gcd(ll a, ll b, ll g)
{
    if (!b) return t2(1, 0);
    ll q = a / b;
    ll r = a % b;
    t2 sol = _ext_gcd(b, r, g);
    ll sx = get<0>(sol);
    ll sy = get<1>(sol);
    ll x = sy;
    ll y = sx - q * sy;
    return t2(x, y);
}

t2 ext_gcd(ll a, ll b)
{
    return _ext_gcd(a, b, gcd(a, b));
}

// x and mod must be coprime
ll mod_inv(ll x, ll mod)
{
    t2 result = ext_gcd(x, mod);
    ll ret = get<0>(result);
    while (ret < 0) ret += mod;
    ret %= mod;
    return ret;
}

ll msec()
{
    struct timeval tv;
    gettimeofday(&tv, NULL);
    ll ret = 0;
    ret += tv.tv_sec * 1000LL;
    ret += tv.tv_usec / 1000LL;
    return ret;
}


template <typename T>
void _debug_print(T x)
{
    cout << x << " ";
}

void _debug_print(const t2 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    cout << "(" << x1 << ", " << x2 << ") ";
}

void _debug_print(const t3 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    ll x3 = get<2>(x);
    cout << "(" << x1 << ", " << x2 << ", " << x3 << ") ";
}

void _debug_print(const t4 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    ll x3 = get<2>(x);
    ll x4 = get<3>(x);
    cout << "(" << x1 << ", " << x2 << ", " << x3 << ", " << x4 << ") ";
}

template <typename T>
void _debug_print(T xarray[], ll n)
{
    rep (i, n) _debug_print(xarray[i]);
    cout << endl;
}

template <typename T>
void _debug_print(const V<T> &xlist)
{
    for (auto x : xlist) _debug_print(x);
    cout << endl;
}

template <typename T>
void _debug_print(const set<T> &xset)
{
    for (auto x : xset) _debug_print(x);
    cout << endl;
}

template <typename TT, typename T>
void _debug_print(const map<TT, T> &xlist)
{
    for (auto x : xlist) {
        TT k = x.first;
        T v = x.second;
        cout << "K=";
        _debug_print(k);
        cout << " V=";
        _debug_print(v);
        cout << endl;
    }
}

///////////////////////////////////////////////////////////////////////////////

void _main();
int main()
{
    cout << setprecision(12);
#if !DEBUG
    ios::sync_with_stdio(false);
    cin.tie(0);
#endif

    _main();
    return 0;
}

void make_edgelist(const V<t2> &srclist, V<ll> edgelist[])
{
    for (auto src : srclist) {
        ll a = get<0>(src);
        ll b = get<1>(src);
        edgelist[a].pb(b);
        edgelist[b].pb(a);
    }
}

void make_parental_relation(const V<ll> edgelist[], ll root, ll n,
                            ll parents[], V<ll> children[], ll levels[])
{
    queue<ll> q;
    bool checked[n+1];

    memset(checked, 0, sizeof(checked));

    q.push(root);
    checked[root] = true;
    parents[root] = root;
    levels[root] = 0LL;

    for ( ; !(q.empty()); ) {
        ll now = q.front(); q.pop();
        for (auto next : edgelist[now]) {
            if (checked[next]) continue;
            q.push(next);
            checked[next] = true;
            parents[next] = now;
            children[now].pb(next);
            levels[next] = levels[now] + 1LL;
        }
    }
}

S V<ll> edgelist[100010];
S ll parents[100010];
S V<ll> children[100010];
S ll levels[100010];
S ll cnts[100010] = {};
ll ans = 0;

void dfs(ll v, ll now)
{
    ans += now;

    for (auto cv : children[v]) {
        ll orig_cvc = cnts[cv];
        ll orig_vc = cnts[v];
        cnts[v] -= orig_cvc;
        cnts[cv] += orig_vc - orig_cvc;
        dfs(cv, now + orig_vc - orig_cvc * 2LL);
        cnts[v] += orig_cvc;
        cnts[cv] -= orig_vc - orig_cvc;
    }
}

void _main()
{
    ll n; llin(n);
    V<t2> uvlist; llinl2(uvlist, n-1);

    make_edgelist(uvlist, edgelist);
    make_parental_relation(edgelist, 1, n, parents, children, levels);

    queue<ll> q;
    S ll refs[100010] = {};
    srep (v, 1, n+1) refs[v] = children[v].size();
    srep (v, 1, n+1) if (!refs[v]) q.push(v);
    srep (v, 1, n+1) if (!refs[v]) cnts[v] = 1;

    while (q.size()) {
        ll v = q.front(); q.pop();
        ll pv = parents[v];
        if (v == pv) continue;
        cnts[pv] += cnts[v];
        refs[pv]--;
        if (refs[pv]) continue;
        q.push(pv);
        cnts[pv]++;
    }
    debug_printf("---- cnts\n");
    debug_print(cnts, n+1);

    ll total = 0;
    srep (v, 1, n+1) total += cnts[v];

    dfs(1, total);

    debug_printf("---- ans\n");
    cout << ans << endl;
}

///////////////////////////////////////////////////////////////////////////////
0