結果

問題 No.872 All Tree Path
ユーザー shimarut
提出日時 2021-04-29 23:16:51
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 282 ms / 3,000 ms
コード長 3,626 bytes
コンパイル時間 3,652 ms
コンパイル使用メモリ 192,652 KB
実行使用メモリ 26,676 KB
最終ジャッジ日時 2024-07-17 23:47:36
合計ジャッジ時間 7,035 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
#include <sstream>
#include <regex>
#include <fstream>
#include <array>
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
//using mint = modint998244353;
//using mint = modint;
#pragma region using
using namespace std;
typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vmint = vector<mint>;
using vvmint = vector<vmint>;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using vpint = vector<pint>;
using vvpint = vector<vpint>;
using vd = vector<double>;
using vvd = vector<vd>;
//#define rep(i, s, e) for (int(i) = (s); (i) < (e); ++(i))
#define rep(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define rrep(i, s) for (int(i) = (s) - 1; (i) >= 0; --(i))
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#pragma endregion
#pragma region UnionFind
struct UnionFind
{
vector<int> par;
UnionFind(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
int root(int x)
{
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool issame(int x, int y)
{
return root(x) == root(y);
}
bool merge(int x, int y)
{
x = root(x); y = root(y);
if (x == y) return false;
if (par[x] > par[y]) swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x)
{
return -par[root(x)];
}
};
#pragma endregion
#pragma region GCD
ll gcd(ll a, ll b)
{
if (b == 0)return a;
return gcd(b, a%b);
}
#pragma endregion
#pragma region LCM
ll lcm(ll a, ll b)
{
return a / gcd(a, b) * b;
}
#pragma endregion
#pragma region chmin
template<class T> inline bool chmin(T& a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
#pragma endregion
#pragma region chmax
template<class T> inline bool chmax(T& a, T b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
#pragma endregion
#pragma region Dijkstra
vl dijkstra(vector<vector<pair<int, ll>>> v, int s)
{
ll INF = 1e18;
int MAX = 1e6;
vl res(MAX, INF);
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> q;
q.push({ 0,s });
while (!q.empty())
{
int now;
ll d;
tie(d, now) = q.top();
q.pop();
if (!chmin(res[now], d))continue;
for (auto p : v[now])
{
int next;
ll c;
tie(next, c) = p;
if (res[next] <= res[now] + c)continue;
q.push({ res[now] + c,next });
}
}
return res;
}
#pragma endregion
#pragma region degrad
double dtor(double deg) { return deg * M_PI / 180; }
#pragma endregion
#pragma region raddeg
double rtod(double r) { return r * 180 / M_PI; }
#pragma endregion
//
bool out(int x, int y, int h, int w)
{
if (x < 0 || h <= x || y < 0 || w <= y)return true;
else return false;
}
#pragma endregion
vvpint g(200100);
vi dp(200100);
int dfs(int now, int p)
{
dp[now] = 1;
for (auto q : g[now])
{
int next, w; tie(next, w) = q;
if (next == p)continue;
dp[now] += dfs(next, now);
}
return dp[now];
}
int main()
{
int n; cin >> n;
vector<tuple<int, int, int>> e;
rep(i, n - 1)
{
int u, v, w; cin >> u >> v >> w;
--u, --v;
g[u].push_back({ v,w });
g[v].push_back({ u,w });
e.push_back({ u,v,w });
}
dfs(0, -1);
ll res = 0;
rep(i, n - 1)
{
int u, v, w; tie(u, v, w) = e[i];
ll x = min(dp[u], dp[v]);
res += w * x*(n - x) * 2;
}
cout << res << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0