結果
問題 | No.872 All Tree Path |
ユーザー |
|
提出日時 | 2019-08-30 22:25:53 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 314 ms / 3,000 ms |
コード長 | 1,789 bytes |
コンパイル時間 | 1,480 ms |
コンパイル使用メモリ | 139,316 KB |
最終ジャッジ日時 | 2025-01-07 15:58:20 |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 |
ソースコード
//include//------------------------------------------#include <vector>#include <list>#include <map>#include <unordered_map>#include <climits>#include <set>#include <unordered_set>#include <deque>#include <stack>#include <bitset>#include <algorithm>#include <functional>#include <numeric>#include <utility>#include <sstream>#include <iostream>#include <iomanip>#include <cstdio>#include <cmath>#include <cstdlib>#include <cctype>#include <string>#include <cstring>#include <ctime>#include <queue>#include <random>#include <complex>#include <regex>#include <locale>#include <random>#include <type_traits>using namespace std;#define SHOW_VECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}#define SHOW_MAP(v){std::cerr << #v << endl; for(const auto& xxx: v){std::cerr << xxx.first << " " << xxx.second << "\n";}}using LL = long long;//------------------------------------------//------------------------------------------constexpr LL MAX_N = 200020;struct edge {LL to;LL cost;};vector<edge> G[MAX_N];LL dfs(LL v, LL p, LL &ans, LL N) {LL later = 0;for (auto e: G[v]) {LL to = e.to;LL cost = e.cost;if (to == p) continue;LL tem = dfs(to, v, ans, N);ans += tem * (N - tem) * cost;later += tem;}// cout << v << " " << later << endl;return later + 1;}int main() {LL N;cin >> N;for (int i = 0; i < N - 1; i++) {LL a, b, c;cin >> a >> b >> c;a--, b--;G[a].push_back({b, c});G[b].push_back({a, c});}LL ans = 0;dfs(0, -1, ans, N);cout << ans * 2LL << endl;}