結果

問題 No.872 All Tree Path
ユーザー Konton7
提出日時 2020-04-22 17:14:57
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 233 ms / 3,000 ms
コード長 3,992 bytes
コンパイル時間 2,534 ms
コンパイル使用メモリ 207,264 KB
最終ジャッジ日時 2025-01-09 22:34:19
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d))
#define allpt(v) (v).begin(), (v).end()
#define allpt_c(v) (v).cbegin(), (v).cend()
#define allpt_r(v) (v).rbegin(), (v).rend()
const int mod = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9;
const ll inf = 1e18;
const string wsp = " ";
const string tb = "\t";
const string rt = "\n";
template <typename T>
void show1dvec(const vector<T> &v)
{
if (v.size() == 0)
return;
int n = v.size() - 1;
rep(i, n) cout << v[i] << wsp;
cout << v[n] << rt;
return;
}
template <typename T>
void show2dvec(const vector<vector<T>> &v)
{
int n = v.size();
rep(i, n) show1dvec(v[i]);
}
template <typename T, typename S>
void show1dpair(const vector<pair<T, S>> &v)
{
int n = v.size();
rep(i, n) cout << v[i].first << wsp << v[i].second << rt;
return;
}
template <typename T, typename S>
void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s)
{
int n = v.size();
rep(i, n)
{
t.push_back(v[i].first);
s.push_back(v[i].second);
}
return;
}
template <typename T>
void maxvec(vector<T> &v)
{
T s = v[0];
int n = v.size();
rep(i, n - 1)
{
if (s > v[i + 1])
{
v[i + 1] = s;
}
s = v[i + 1];
}
}
template <typename T, typename S>
bool myfind(T t, S s)
{
return find(t.cbegin(), t.cend(), s) != t.cend();
}
bool check(int y, int x, int h, int w)
{
return 0 <= y && y < h && 0 <= x && x < w;
}
template <typename T>
vector<T> cumsum(const vector<T> &v)
{
T s = 0;
vector<T> ret = {0};
rep(i, v.size())
{
s += v[i];
ret.push_back(s);
}
return ret;
}
bool iskadomatsu(int a, int b, int c)
{
return (a != b && b != c && c != a) && ((a > b && b < c) || (a < b && b > c));
}
VS split(string s, char c)
{
VS ret;
string part;
s += c;
rep(i, s.length())
{
if (s[i] == c)
{
ret.emplace_back(part);
part = "";
}
else if (s[i] != c)
{
part += s[i];
}
}
return ret;
}
string removezero(string &s)
{
string ret;
for (auto z : s)
if (z != '0')
ret += z;
return ret;
}
ll sumdigit(ll x)
{
ll ans{0};
while (x > 0)
{
ans += x % 10;
x /= 10;
}
return ans;
}
struct node{
int parent = -1;
ll parent_edge_length;
ll offsplings = 1;
VI children;
};
void dfs(int v, vector<vector<PLL>> &connect, vector<node> &nodes)
{
for (const auto [u, c] : connect[v])
{
if (nodes[v].parent != u)
{
nodes[u].parent = v;
nodes[u].parent_edge_length = c;
nodes[v].children.emplace_back(u);
dfs(u, connect, nodes);
nodes[v].offsplings += nodes[u].offsplings;
}
}
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
#ifdef DEBUG
cout << "DEBUG MODE" << endl;
ifstream in("input.txt"); //for debug
cin.rdbuf(in.rdbuf()); //for debug
#endif
int n, a, b, c;
ll ans{0};
cin >> n;
vector<vector<PLL>> connect(n);
vector<node> nodes(n);
rep(i, n - 1)
{
cin >> a >> b >> c;
a--, b--;
connect[a].emplace_back(make_pair(b, c));
connect[b].emplace_back(make_pair(a, c));
}
dfs(0, connect, nodes);
for (auto z : nodes)
{
ans += z.parent_edge_length * z.offsplings * (n - z.offsplings);
}
cout << 2 * ans << rt;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0