結果

問題 No.1333 Squared Sum
ユーザー siro53siro53
提出日時 2021-10-19 17:13:43
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 343 ms / 2,000 ms
コード長 8,837 bytes
コンパイル時間 2,264 ms
コンパイル使用メモリ 219,744 KB
実行使用メモリ 78,264 KB
最終ジャッジ日時 2024-09-20 06:23:58
合計ジャッジ時間 13,322 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 237 ms
30,656 KB
testcase_04 AC 250 ms
30,764 KB
testcase_05 AC 233 ms
30,784 KB
testcase_06 AC 243 ms
30,748 KB
testcase_07 AC 236 ms
30,760 KB
testcase_08 AC 230 ms
30,696 KB
testcase_09 AC 234 ms
30,772 KB
testcase_10 AC 243 ms
30,620 KB
testcase_11 AC 223 ms
30,612 KB
testcase_12 AC 222 ms
30,740 KB
testcase_13 AC 247 ms
78,264 KB
testcase_14 AC 303 ms
51,864 KB
testcase_15 AC 334 ms
71,828 KB
testcase_16 AC 2 ms
6,944 KB
testcase_17 AC 2 ms
6,940 KB
testcase_18 AC 2 ms
6,944 KB
testcase_19 AC 2 ms
6,944 KB
testcase_20 AC 2 ms
6,944 KB
testcase_21 AC 2 ms
6,940 KB
testcase_22 AC 2 ms
6,944 KB
testcase_23 AC 2 ms
6,940 KB
testcase_24 AC 2 ms
6,944 KB
testcase_25 AC 2 ms
6,944 KB
testcase_26 AC 343 ms
76,844 KB
testcase_27 AC 325 ms
53,300 KB
testcase_28 AC 328 ms
76,176 KB
testcase_29 AC 250 ms
78,180 KB
testcase_30 AC 79 ms
14,848 KB
testcase_31 AC 42 ms
9,856 KB
testcase_32 AC 123 ms
19,840 KB
testcase_33 AC 95 ms
16,256 KB
testcase_34 AC 177 ms
25,280 KB
testcase_35 AC 130 ms
19,900 KB
testcase_36 AC 67 ms
13,184 KB
testcase_37 AC 70 ms
13,696 KB
testcase_38 AC 79 ms
15,232 KB
testcase_39 AC 136 ms
22,236 KB
testcase_40 AC 190 ms
32,180 KB
testcase_41 AC 190 ms
32,576 KB
testcase_42 AC 184 ms
32,172 KB
testcase_43 AC 177 ms
32,168 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "main.cpp"
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
    }
} __Setup;

using ll = long long;
#define OVERLOAD3(_1, _2, _3, name, ...) name
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define REP1(i, n) for(int i = 0; i < (n); i++)
#define REP2(i, a, b) for(int i = (a); i < int(b); i++)
#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
constexpr int MOD = 1000000007;
constexpr int MOD2 = 998244353;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

void Case(int i) { cout << "Case #" << i << ": "; }
int popcount(int x) { return __builtin_popcount(x); }
ll popcount(ll x) { return __builtin_popcountll(x); }
#pragma endregion Macros

#line 1 "/home/siro53/kyo-pro/compro_library/math/modint.hpp"
template <int mod> struct ModInt {
    int x;
    ModInt() : x(0) {}
    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    ModInt &operator+=(const ModInt &p) {
        if((x += p.x) >= mod)
            x -= mod;
        return *this;
    }
    ModInt &operator-=(const ModInt &p) {
        if((x += mod - p.x) >= mod)
            x -= mod;
        return *this;
    }
    ModInt &operator*=(const ModInt &p) {
        x = (int)(1LL * x * p.x % mod);
        return *this;
    }
    ModInt &operator/=(const ModInt &p) {
        *this *= p.inv();
        return *this;
    }
    ModInt operator-() const { return ModInt(-x); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
    bool operator==(const ModInt &p) const { return x == p.x; }
    bool operator!=(const ModInt &p) const { return x != p.x; }
    ModInt inv() const {
        int a = x, b = mod, u = 1, v = 0, t;
        while(b > 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(u -= t * v, v);
        }
        return ModInt(u);
    }
    ModInt pow(int64_t n) const {
        ModInt ret(1), mul(x);
        while(n > 0) {
            if(n & 1)
                ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }
    friend ostream &operator<<(ostream &os, const ModInt &p) {
        return os << p.x;
    }
    friend istream &operator>>(istream &is, ModInt &a) {
        int64_t t;
        is >> t;
        a = ModInt<mod>(t);
        return (is);
    }
    static int get_mod() { return mod; }
};
#line 76 "main.cpp"
using mint = ModInt<MOD>;
#line 1 "/home/siro53/kyo-pro/compro_library/graph/re_rooting.hpp"
template<class S, S (*op)(S, int), S (*merge)(S, S), S (*op2)(S, int), S (*e)()>
class re_rooting {
private:
    int N;
    vector<vector<int>> G;
    vector<vector<S>> dp;

    S dfs1(int u, int p) {
        S res = e();
        for(int i = 0; i < (int)G[u].size(); i++) {
            if(G[u][i] == p) continue;
            int v = G[u][i];
            dp[u][i] = dfs1(v, u);
            res = merge(res, op(dp[u][i], v));
        }
        return op2(res, u);
    }

    void dfs2(int u, int p, S from_par) {
        int sz = (int)G[u].size();
        for(int i = 0; i < sz; i++) {
            if(G[u][i] == p) {
                dp[u][i] = from_par;
                break;
            }
        }
        vector<S> rsum(sz + 1);
        rsum[sz] = e();
        for(int i = sz-1; i >= 0; i--) {
            rsum[i] = merge(rsum[i+1], op(dp[u][i], G[u][i]));
        }
        S lsum = e();
        for(int i = 0; i < sz; i++) {
            int v = G[u][i];
            if(v != p) {
                S val = merge(lsum, rsum[i+1]);
                dfs2(v, u, op2(val, u));
            }
            lsum = merge(lsum, op(dp[u][i], v));
        }
    }

    void build(int root) {
        for(int i = 0; i < N; i++) dp[i].resize(G[i].size());
        dfs1(root, -1);
        dfs2(root, -1, e());
    }
    
public:
    re_rooting(int N): N(N), G(N), dp(N) {}
    re_rooting(const vector<vector<int>>& G): N(G.size()), G(G), dp(G.size()) {}

    void add_edge(int u, int v) {
        G[u].emplace_back(v);
        G[v].emplace_back(u);
    }

    vector<S> solve(int root = 0) {
        build(root);
        vector<S> ans(N);
        for(int u = 0; u < N; u++) {
            S res = e();
            for(int i = 0; i < (int)G[u].size(); i++) {
                res = merge(res, op(dp[u][i], G[u][i]));
            }
            ans[u] = op2(res, u);
        }
        return ans;
    }
};

template<class T>
struct Edge {
    int from, to;
    T cost;
    Edge() = default;
    Edge(int from, int to, T cost): from(from), to(to), cost(cost) {}
    operator int() const { return to; }
};

template<class S, class Cost, S (*op)(S, Edge<Cost>), S (*merge)(S, S), S (*op2)(S, int), S (*e)()>
class re_rooting_edge {
private:
    int N;
    vector<vector<Edge<Cost>>> G;
    vector<vector<S>> dp;

    S dfs1(int u, int p) {
        S res = e();
        for(int i = 0; i < (int)G[u].size(); i++) {
            int v = G[u][i];
            if(v == p) continue;
            dp[u][i] = dfs1(v, u);
            res = merge(res, op(dp[u][i], G[u][i]));
        }
        return op2(res, u);
    }

    void dfs2(int u, int p, S from_par) {
        int sz = (int)G[u].size();
        for(int i = 0; i < sz; i++) {
            if(G[u][i] == p) {
                dp[u][i] = from_par;
                break;
            }
        }
        vector<S> rsum(sz + 1);
        rsum[sz] = e();
        for(int i = sz-1; i >= 0; i--) {
            rsum[i] = merge(rsum[i+1], op(dp[u][i], G[u][i]));
        }
        S lsum = e();
        for(int i = 0; i < sz; i++) {
            int v = G[u][i];
            if(v != p) {
                S val = merge(lsum, rsum[i+1]);
                dfs2(v, u, op2(val, u));
            }
            lsum = merge(lsum, op(dp[u][i], G[u][i]));
        }
    }

    void build(int root) {
        for(int i = 0; i < N; i++) dp[i].resize(G[i].size());
        dfs1(root, -1);
        dfs2(root, -1, e());
    }

public:
    re_rooting_edge(int N): N(N), G(N), dp(N) {}
    re_rooting_edge(const vector<vector<Edge<Cost>>>& G): N(G.size()), G(G), dp(G.size()) {}

    void add_edge(int u, int v, Cost cost) {
        G[u].emplace_back(u, v, cost);
        G[v].emplace_back(v, u, cost);
    }

    vector<S> solve(int root = 0) {
        build(root);
        vector<S> ans(N);
        for(int u = 0; u < N; u++) {
            S res = e();
            for(int i = 0; i < (int)G[u].size(); i++) {
                res = merge(res, op(dp[u][i], G[u][i]));
            }
            ans[u] = op2(res, u);
        }
        return ans;
    }
};
#line 78 "main.cpp"

using S = tuple<mint, mint, mint>;
using Cost = mint;

S op(S x, Edge<Cost> e) {
    auto [s2, d, sz] = x;
    return S(d*2*e.cost + s2 + e.cost*e.cost*(sz+1), d+e.cost*(sz+1), sz+1);
}
S merge(S x, S y) {
    auto [s2x, dx, szx] = x;
    auto [s2y, dy, szy] = y;
    return S(s2x + s2y, dx + dy, szx + szy);
}
S op2(S x, int id) {
    return x;
}
S e() { return {0, 0, 0}; }

int main() {
    int N;
    cin >> N;
    re_rooting_edge<S, Cost, op, merge, op2, e> re(N);
    REP(i, N-1) {
        int u, v, w;
        cin >> u >> v >> w;
        u--; v--;
        re.add_edge(u, v, w);
    }
    auto dp = re.solve();
    mint ans = 0;
    REP(i, N) ans += get<0>(dp[i]);
    ans /= 2;
    cout << ans << endl;
}
0