結果
問題 | No.872 All Tree Path |
ユーザー |
|
提出日時 | 2024-04-08 11:01:18 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 212 ms / 3,000 ms |
コード長 | 3,365 bytes |
コンパイル時間 | 25,913 ms |
コンパイル使用メモリ | 359,112 KB |
最終ジャッジ日時 | 2025-02-20 22:57:58 |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>#include<atcoder/all>#include<time.h>using namespace atcoder;using namespace std;using ll = long long;using vll = vector<ll>;using vvll = vector<vll>;using vvvll = vector<vvll>;using vvvvll = vector<vvvll>;using vvvvvll = vector<vvvvll>;using vb = vector<bool>;using vvb = vector<vb>;using vvvb = vector<vvb>;using vvvvb = vector<vvvb>;using vvvvvb = vector<vvvvb>;using vd = vector<double>;using vvd = vector<vd>;using vvvd = vector<vvd>;using vvvvd = vector<vvvd>;using vvvvvd = vector<vvvvd>;#define all(A) A.begin(),A.end()#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)#define rep2(i, s,t) for (ll i = s; i < (ll) (t); i++)template<class T>bool chmax(T& p, T q, bool C = 1) {if (C == 0 && p == q) {return 1;}if (p < q) {p = q;return 1;}else {return 0;}}template<class T>bool chmin(T& p, T q, bool C = 1) {if (C == 0 && p == q) {return 1;}if (p > q) {p = q;return 1;}else {return 0;}}ll modPow(long long a, long long n, long long p) {if (n == 0) return 1; // 0乗にも対応する場合if (n == 1) return a % p;if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;long long t = modPow(a, n / 2, p);return (t * t) % p;}ll gcd(ll(a), ll(b)) {if (a == 0)return b;if (b == 0)return a;ll c = a;while (a % b != 0) {c = a % b;a = b;b = c;}return b;}ll sqrtz(ll N) {ll L = 0;ll R = sqrt(N) + 10000;while (abs(R - L) > 1) {ll mid = (R + L) / 2;if (mid * mid <= N)L = mid;else R = mid;}return L;}using mint = modint998244353;using vm = vector<mint>;using vvm = vector<vm>;using vvvm = vector<vvm>;vector<mint> fact, factinv, inv, factK;ll mod = 998244353;void prenCkModp(ll n) {//factK.resize(4*n+5);fact.resize(n + 5);factinv.resize(n + 5);inv.resize(n + 5);fact[0] = fact[1] = 1;factinv[0] = factinv[1] = 1;inv[1] = 1;for (ll i = 2; i < n + 5; i++) {fact[i] = (fact[i - 1] * i);inv[i] = (mod - ((inv[mod % i] * (mod / i))));factinv[i] = (factinv[i - 1] * inv[i]);}//factK[0]=1;//for(ll i=1;i<4*n+5;i++){// factK[i]=factK[i-1]*mint(K-i+1);// //K*(K-1)*...*(K-i+1);//}}mint nCk(ll n, ll k) {if (n < k || k < 0) return 0;return (fact[n] * ((factinv[k] * factinv[n - k])));}//mint nCkK(ll n,ll k){// if(K<n||K-n<k)return 0;// mint res=factK[n+k];// res*=factK[n].inv();// res*=factinv[k];// return res;//}bool DEB = 1;vvll G;vll C;void dfs(ll n,ll p){for(auto v:G[n])if(v!=p){dfs(v,n);C[n]+=C[v];}C[n]++;}int main() {cin.tie(nullptr);ios::sync_with_stdio(false);ll N;cin>>N;G.resize(N);C.assign(N,0);vll U(N),V(N),W(N);rep(i,N-1){cin>>U[i]>>V[i]>>W[i];U[i]--;V[i]--;G[U[i]].push_back(V[i]);G[V[i]].push_back(U[i]);}dfs(0,-1);ll an=0;rep(i,N-1){if(C[U[i]]<C[V[i]])swap(U[i],V[i]);an+=W[i]*C[V[i]]*(N-C[V[i]]);}cout<<an*2<<endl;}