結果
問題 | No.872 All Tree Path |
ユーザー |
|
提出日時 | 2019-09-27 02:44:15 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 149 ms / 3,000 ms |
コード長 | 2,621 bytes |
コンパイル時間 | 1,971 ms |
コンパイル使用メモリ | 183,824 KB |
実行使用メモリ | 27,652 KB |
最終ジャッジ日時 | 2024-09-24 06:42:34 |
合計ジャッジ時間 | 4,874 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for(int i = 0; i < (n); ++i)#define eee(a) (cerr << (#a) << ": " << (a) << endl);#define ppp(a) (cout << (a) << endl);#define cop(a) for(auto x:(a)){cout << x << endl;}using ll = long long;using pint = pair<int, int>;using pll = pair<ll, ll>;using mint = map<int, int>;int dx[4] = {1, 0, -1, 0};int dy[4] = {0, 1, 0, -1};const char sp = ' ';const char cmm = ',';const int MOD = 1e9+7;const int INF = 1e9;const ll LINF = 1e18;ll mod(ll a, ll b){return (a%b+b)%b;}ll gcd(ll a, ll b){return b?gcd(b,a%b):a;}ll lcm(ll a, ll b){return a*b/gcd(a,b);}void Yes(){cout << "Yes" << endl;}void No(){cout << "No" << endl;}void Judge(bool b){b?Yes():No();}void YES(){cout << "YES" << endl;}void NO(){cout << "NO" << endl;}void JUDGE(bool b){b?YES():NO();}ll powmod(ll b, ll e){ll r=1;while(e>0){if(e&1)r=(r%MOD)*(b%MOD)%MOD;b=(b%MOD)*(b%MOD)%MOD;e>>=1;}return r;}double distance(ll x1, ll y1, ll x2, ll y2){return sqrt((x1-x2)*(x1-x2) + (y1-y2)*(y1-y2));}template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) {return s << "(" << p.first << ", " << p.second << ")";}template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {int len = v.size();s << '[';for (int i = 0; i < len; ++i) {s << v[i]; if (i < len-1) s << ", ";}s << ']';return s;}struct aaa{aaa(){// comment this out when you use scanf or printf// cin.tie(0); ios::sync_with_stdio(0);cout<<fixed<<setprecision(15);};}fastio;vector<ll> calc_divisor(ll n) {vector<ll> res;for (ll i = 1; i*i <= n; ++i) {if (n % i == 0) {res.push_back(i);ll j = n / i;if (j != i) res.push_back(j);}}sort(res.begin(), res.end());return res;}vector<vector<pint>> G;vector<int> num;ll ans, n;void dfs(int i, int prev, ll d){for(auto e : G[i]){if(e.first != prev)dfs(e.first, i, e.second);}if(prev == -1) return;num[prev] += num[i];ans += 2*d*num[i]*(n-num[i]);}int main(){scanf("%lld", &n);G.resize(n);num.resize(n, 1);rep(i, n-1){int u, v, w;scanf("%d%d%d", &u, &v, &w);--u; --v;G[u].emplace_back(v, w);G[v].emplace_back(u, w);}dfs(0, -1, 0);ppp(ans);return 0;}