結果

問題 No.1333 Squared Sum
ユーザー fastmathfastmath
提出日時 2021-01-08 22:18:52
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 294 ms / 2,000 ms
コード長 4,342 bytes
コンパイル時間 2,358 ms
コンパイル使用メモリ 206,076 KB
実行使用メモリ 45,056 KB
最終ジャッジ日時 2024-11-16 12:54:04
合計ジャッジ時間 11,362 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 9 ms
15,796 KB
testcase_01 AC 11 ms
15,872 KB
testcase_02 AC 10 ms
15,872 KB
testcase_03 AC 278 ms
26,240 KB
testcase_04 AC 264 ms
26,112 KB
testcase_05 AC 257 ms
26,184 KB
testcase_06 AC 254 ms
26,112 KB
testcase_07 AC 259 ms
26,112 KB
testcase_08 AC 252 ms
26,240 KB
testcase_09 AC 261 ms
26,056 KB
testcase_10 AC 256 ms
26,056 KB
testcase_11 AC 259 ms
26,112 KB
testcase_12 AC 294 ms
26,052 KB
testcase_13 AC 223 ms
44,996 KB
testcase_14 AC 286 ms
35,712 KB
testcase_15 AC 293 ms
42,692 KB
testcase_16 AC 10 ms
15,936 KB
testcase_17 AC 10 ms
15,944 KB
testcase_18 AC 10 ms
15,872 KB
testcase_19 AC 10 ms
15,940 KB
testcase_20 AC 9 ms
15,944 KB
testcase_21 AC 10 ms
15,940 KB
testcase_22 AC 10 ms
15,872 KB
testcase_23 AC 9 ms
15,944 KB
testcase_24 AC 9 ms
15,872 KB
testcase_25 AC 9 ms
15,940 KB
testcase_26 AC 292 ms
44,616 KB
testcase_27 AC 292 ms
36,352 KB
testcase_28 AC 293 ms
44,416 KB
testcase_29 AC 225 ms
45,056 KB
testcase_30 AC 78 ms
20,164 KB
testcase_31 AC 42 ms
18,304 KB
testcase_32 AC 132 ms
21,960 KB
testcase_33 AC 101 ms
20,804 KB
testcase_34 AC 190 ms
24,192 KB
testcase_35 AC 127 ms
22,144 KB
testcase_36 AC 70 ms
19,656 KB
testcase_37 AC 70 ms
19,784 KB
testcase_38 AC 85 ms
20,480 KB
testcase_39 AC 159 ms
22,912 KB
testcase_40 AC 182 ms
25,148 KB
testcase_41 AC 188 ms
25,144 KB
testcase_42 AC 185 ms
24,936 KB
testcase_43 AC 172 ms
25,152 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
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::cout << #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 
#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; 
}

//need define int long long
namespace Stuff {
const int MOD = 1e9+7;
int mod(int n) {
    n %= MOD;
    if (n < 0) return n + MOD;
    else return n;
}   
int fp(int a, int p) {
    int ans = 1, c = a;
    for (int i = 0; (1ll << i) <= p; ++i) {
        if ((p >> i) & 1) ans = mod(ans * c);
        c = mod(c * c);
    }   
    return ans;
}   
int dv(int a, int b) { return mod(a * fp(b, MOD - 2)); }
};
struct M {
ll x;
M (int x_) { x = Stuff::mod(x_); }   
M () { x = 0; }
M operator + (M y) {
    int ans = x + y.x;
    if (ans >= Stuff::MOD)
        ans -= Stuff::MOD;
    return M(ans);
}
M operator - (M y) {
    int ans = x - y.x;
    if (ans < 0)
        ans += Stuff::MOD;
    return M(ans);            
}   
M operator * (M y) { return M(x * y.x % Stuff::MOD); }   
M operator / (M y) { return M(x * Stuff::fp(y.x, Stuff::MOD - 2) % Stuff::MOD); }   
M operator + (int y) { return (*this) + M(y); }
M operator - (int y) { return (*this) - M(y); }   
M operator * (int y) { return (*this) * M(y); }   
M operator / (int y) { return (*this) / M(y); }   
M operator ^ (int p) { return M(Stuff::fp(x, p)); }   
void operator += (M y) { *this = *this + y; }   
void operator -= (M y) { *this = *this - y; }   
void operator *= (M y) { *this = *this * y; }
void operator /= (M y) { *this = *this / y; }   
void operator += (int y) { *this = *this + y; }   
void operator -= (int y) { *this = *this - y; }   
void operator *= (int y) { *this = *this * y; }
void operator /= (int y) { *this = *this / y; }   
void operator ^= (int p) { *this = *this ^ p; }
bool operator == (M y) { return x == y.x; }
};  
std::ostream& operator << (std::ostream& o, const M& a)
{
    cout << a.x;
    return o;
}


const int N = 2e5+7;
int n;
V <ii> g[N];
M sub[N], sum[N], cnt[N];
void dfs1(int u, int p) {
    cnt[u] = 1;
    trav (e, g[u]) {
        int v = e.x, c = e.y;
        M w = c;
        if (v != p) {
            dfs1(v, u);

            cnt[u] += cnt[v];

            sum[u] += sum[v];
            sum[u] += w * cnt[v];

            sub[u] += sub[v];
            sub[u] += w * 2 * sum[v]; 
            sub[u] += w * w * cnt[v];
        }   
    }   
}   

M ans = 0;
M dist[N];
M res[N];
void dfs2(int u, int p) {
    //debug(u);
    //debug(res[u]);
    ans += res[u];
    trav (e, g[u]) {
        int v = e.x, c = e.y;
        M w = c;
        if (v != p) {
            M down = sum[v] + w * cnt[v];
            M up = dist[u] - down;
            res[v] = res[u] + (w^2) * n + (w * 2) * (up - down);
            dist[v] = dist[u] - cnt[v] * w + (M(n) - cnt[v]) * w;
            dfs2(v, u);
        }   
    }   
}   

signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    cin >> n;
    FOR (i, n - 1) {
        int u,v,w;
        cin >> u >> v >> w;
        g[u].app(mp(v, w));
        g[v].app(mp(u, w));
    }   
    dfs1(1, 1);
    res[1] = sub[1];
    dist[1] = sum[1];
    dfs2(1, 1);
    cout << ans/2 << endl;
}
0