結果
問題 | No.1333 Squared Sum |
ユーザー | fastmath |
提出日時 | 2021-01-08 22:18:52 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 296 ms / 2,000 ms |
コード長 | 4,342 bytes |
コンパイル時間 | 2,334 ms |
コンパイル使用メモリ | 204,368 KB |
実行使用メモリ | 41,952 KB |
最終ジャッジ日時 | 2023-08-10 10:11:13 |
合計ジャッジ時間 | 12,267 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 7 ms
15,932 KB |
testcase_01 | AC | 6 ms
16,036 KB |
testcase_02 | AC | 6 ms
16,036 KB |
testcase_03 | AC | 263 ms
26,336 KB |
testcase_04 | AC | 269 ms
26,064 KB |
testcase_05 | AC | 258 ms
26,084 KB |
testcase_06 | AC | 261 ms
26,096 KB |
testcase_07 | AC | 269 ms
26,188 KB |
testcase_08 | AC | 266 ms
26,012 KB |
testcase_09 | AC | 263 ms
26,068 KB |
testcase_10 | AC | 270 ms
26,340 KB |
testcase_11 | AC | 259 ms
26,364 KB |
testcase_12 | AC | 261 ms
26,120 KB |
testcase_13 | AC | 216 ms
41,904 KB |
testcase_14 | AC | 281 ms
34,196 KB |
testcase_15 | AC | 287 ms
40,292 KB |
testcase_16 | AC | 6 ms
16,044 KB |
testcase_17 | AC | 7 ms
15,876 KB |
testcase_18 | AC | 6 ms
15,940 KB |
testcase_19 | AC | 7 ms
15,852 KB |
testcase_20 | AC | 6 ms
15,840 KB |
testcase_21 | AC | 6 ms
15,852 KB |
testcase_22 | AC | 7 ms
15,832 KB |
testcase_23 | AC | 6 ms
15,860 KB |
testcase_24 | AC | 6 ms
15,824 KB |
testcase_25 | AC | 7 ms
16,168 KB |
testcase_26 | AC | 296 ms
41,540 KB |
testcase_27 | AC | 291 ms
34,556 KB |
testcase_28 | AC | 296 ms
41,488 KB |
testcase_29 | AC | 227 ms
41,952 KB |
testcase_30 | AC | 86 ms
20,312 KB |
testcase_31 | AC | 43 ms
18,344 KB |
testcase_32 | AC | 132 ms
22,016 KB |
testcase_33 | AC | 101 ms
20,928 KB |
testcase_34 | AC | 201 ms
24,052 KB |
testcase_35 | AC | 145 ms
22,136 KB |
testcase_36 | AC | 70 ms
19,732 KB |
testcase_37 | AC | 70 ms
20,020 KB |
testcase_38 | AC | 90 ms
20,300 KB |
testcase_39 | AC | 164 ms
22,932 KB |
testcase_40 | AC | 180 ms
24,852 KB |
testcase_41 | AC | 185 ms
25,396 KB |
testcase_42 | AC | 186 ms
24,972 KB |
testcase_43 | AC | 176 ms
25,016 KB |
ソースコード
#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; }