結果
問題 | No.1333 Squared Sum |
ユーザー | milanis48663220 |
提出日時 | 2021-01-08 23:19:06 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 313 ms / 2,000 ms |
コード長 | 3,411 bytes |
コンパイル時間 | 982 ms |
コンパイル使用メモリ | 98,688 KB |
実行使用メモリ | 57,316 KB |
最終ジャッジ日時 | 2024-04-28 05:31:59 |
合計ジャッジ時間 | 9,240 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 8 ms
12,928 KB |
testcase_01 | AC | 9 ms
12,784 KB |
testcase_02 | AC | 9 ms
12,800 KB |
testcase_03 | AC | 256 ms
23,168 KB |
testcase_04 | AC | 225 ms
23,168 KB |
testcase_05 | AC | 230 ms
23,168 KB |
testcase_06 | AC | 225 ms
23,012 KB |
testcase_07 | AC | 233 ms
23,136 KB |
testcase_08 | AC | 245 ms
23,296 KB |
testcase_09 | AC | 246 ms
23,168 KB |
testcase_10 | AC | 229 ms
23,040 KB |
testcase_11 | AC | 237 ms
23,168 KB |
testcase_12 | AC | 236 ms
23,168 KB |
testcase_13 | AC | 232 ms
57,216 KB |
testcase_14 | AC | 264 ms
40,296 KB |
testcase_15 | AC | 279 ms
52,992 KB |
testcase_16 | AC | 5 ms
12,800 KB |
testcase_17 | AC | 5 ms
12,832 KB |
testcase_18 | AC | 6 ms
12,772 KB |
testcase_19 | AC | 5 ms
12,672 KB |
testcase_20 | AC | 5 ms
12,928 KB |
testcase_21 | AC | 5 ms
12,800 KB |
testcase_22 | AC | 5 ms
12,672 KB |
testcase_23 | AC | 6 ms
12,772 KB |
testcase_24 | AC | 6 ms
12,800 KB |
testcase_25 | AC | 6 ms
12,800 KB |
testcase_26 | AC | 313 ms
56,320 KB |
testcase_27 | AC | 272 ms
41,216 KB |
testcase_28 | AC | 281 ms
55,808 KB |
testcase_29 | AC | 218 ms
57,316 KB |
testcase_30 | AC | 77 ms
17,124 KB |
testcase_31 | AC | 38 ms
15,232 KB |
testcase_32 | AC | 117 ms
19,044 KB |
testcase_33 | AC | 80 ms
17,764 KB |
testcase_34 | AC | 184 ms
21,120 KB |
testcase_35 | AC | 122 ms
18,916 KB |
testcase_36 | AC | 69 ms
16,512 KB |
testcase_37 | AC | 82 ms
16,640 KB |
testcase_38 | AC | 91 ms
17,408 KB |
testcase_39 | AC | 147 ms
19,840 KB |
testcase_40 | AC | 170 ms
28,300 KB |
testcase_41 | AC | 170 ms
28,296 KB |
testcase_42 | AC | 169 ms
28,300 KB |
testcase_43 | AC | 170 ms
28,300 KB |
ソースコード
#include <iostream> #include <algorithm> #include <iomanip> #include <vector> #include <queue> #include <set> #include <map> #include <cassert> #define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl; #define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl; 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; } using namespace std; typedef long long ll; const ll MOD = 1000000007; class ModInt{ public: ll v; ModInt(ll _v = 0){ if(_v >= MOD) _v %= MOD; v = _v; } ModInt operator+(ll n){ return ModInt((v+n)%MOD); } ModInt operator-(ll n){ return ModInt((v-n+MOD)%MOD); } ModInt operator*(ll n){ if(n >= MOD) n %= MOD; return ModInt((v*n)%MOD); } ModInt operator/(ll n){ return ModInt((ModInt(n).inv()*v).v%MOD); } void operator+=(ll n){ v = (v+n)%MOD; } void operator-=(ll n){ v = (v-n+MOD)%MOD; } void operator*=(ll n){ v = (v*n)%MOD; } ModInt operator+(ModInt n){ return ModInt((v+n.v)%MOD); } ModInt operator-(ModInt n){ return ModInt((v-n.v+MOD)%MOD); } ModInt operator*(ModInt n){ return ModInt((v*n.v)%MOD); } ModInt operator/(ModInt n){ return ModInt((n.inv()*v).v%MOD); } void operator+=(ModInt n){ v = (v+n.v)%MOD; } void operator-=(ModInt n){ v = (v-n.v+MOD)%MOD; } void operator*=(ModInt n){ v = (v*n.v)%MOD; } void operator=(ModInt n){ v = n.v; } void operator=(ll n){ v = n; } ModInt inv(){ if(v == 1) return ModInt(1); else return ModInt(MOD-ModInt(MOD%v).inv().v*(MOD/v)%MOD); } }; ostream& operator<<(ostream& os, const ModInt& m){ os << m.v; return os; } istream & operator >> (istream &in, ModInt &m){ in >> m.v; return in; } ModInt dp_sum[200000]; ModInt dp_square[200000]; ModInt cnt_ch[200000]; struct edge{ int to; ModInt cost; }; int n; vector<edge> G[200000]; ModInt ans; bool used[200000]; void dfs(int v){ used[v] = true; vector<edge> visited; for(auto e : G[v]){ if(!used[e.to]){ visited.push_back(e); dfs(e.to); cnt_ch[v] += cnt_ch[e.to]; dp_square[v] += dp_square[e.to]+dp_sum[e.to]*e.cost*2+e.cost*e.cost*cnt_ch[e.to]; dp_sum[v] += dp_sum[e.to]+e.cost*cnt_ch[e.to]; } } for(edge e : visited){ ModInt x = dp_square[e.to]+dp_sum[e.to]*e.cost*2+e.cost*e.cost*cnt_ch[e.to]; ans += x*(cnt_ch[v]-cnt_ch[e.to]); x = dp_sum[e.to]+e.cost*cnt_ch[e.to]; ans += x*(dp_sum[v]-x); } ans += dp_square[v]; cnt_ch[v]+=1; // cout << v << ' ' << dp_sum[v] << ' ' << dp_square[v] << ' ' << ans << ' ' << cnt_ch[v] << endl; } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << setprecision(10) << fixed; cin >> n; for(int i = 0; i < n-1; i++){ int u, v; ModInt w; cin >> u >> v >> w; u--; v--; G[u].push_back((edge){v, w}); G[v].push_back((edge){u, w}); } dfs(0); cout << ans << endl; }