結果
問題 | No.872 All Tree Path |
ユーザー |
|
提出日時 | 2019-08-30 22:49:37 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 178 ms / 3,000 ms |
コード長 | 6,896 bytes |
コンパイル時間 | 3,255 ms |
コンパイル使用メモリ | 223,596 KB |
最終ジャッジ日時 | 2025-01-07 16:00:56 |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 |
ソースコード
#pragma GCC optimize ("O3")#include "bits/stdc++.h"using namespace std;using ll = long long int;#define debugos cout#define debug(v) {printf("L%d %s > ",__LINE__,#v);debugos<<(v)<<endl;}#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:(v)){debugos<<e<<" ";}debugos<<endl;}#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){debugos<<(m)[x]<<" ";}debugos<<endl;}#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){debugos<<(m)[y][x]<<" ";}debugos<<endl;}}#define all(v) (v).begin(),(v).end()#define repeat(cnt,l) for(auto cnt=remove_reference<decltype(l)>::type();(cnt)<(l);++(cnt))#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))const ll MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;inline void assert_call(bool assertion, function<void()> f) { if (!assertion) { cerr << "assertion fault:" << endl; f(); abort(); } }template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')';return o; }template<typename Vec> inline ostream& _ostream_vecprint(ostream& os, const Vec& a) {os << '['; for (const auto& e : a) os << ' ' << e << ' '; os << ']'; return os; }template<typename T> inline ostream& operator<<(ostream& o, const vector<T>& v) { return _ostream_vecprint(o, v); }template<typename T, size_t S> inline ostream& operator<<(ostream& o, const array<T, S>& v) { return _ostream_vecprint(o, v); }template<typename T> inline T& chmax(T& to, const T& val) { return to = max(to, val); }template<typename T> inline T& chmin(T& to, const T& val) { return to = min(to, val); }void bye(string s, int code = 0) { cout << s << endl; exit(code); }mt19937_64 randdev(8901016);template<typename T, typename Random = decltype(randdev), typename enable_if<is_integral<T>::value>::type* = nullptr>inline T rand(T l, T h, Random& rand = randdev) { return uniform_int_distribution<T>(l, h)(rand); }template<typename T, typename Random = decltype(randdev), typename enable_if<is_floating_point<T>::value>::type* = nullptr>inline T rand(T l, T h, Random& rand = randdev) { return uniform_real_distribution<T>(l, h)(rand); }#if defined(_WIN32) || defined(_WIN64)#define getc_x _getc_nolock#define putc_x _putc_nolock#elif defined(__GNUC__)#define getc_x getc_unlocked#define putc_x putc_unlocked#else#define getc_x getc#define putc_x putc#endif#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)class MaiScanner {FILE* fp_;public:inline MaiScanner(FILE* fp):fp_(fp){}template<typename T> void input_integer(T& var) noexcept {var = 0; T sign = 1;int cc = getc_x(fp_);for (; cc < '0' || '9' < cc; cc = getc_x(fp_))if (cc == '-') sign = -1;for (; '0' <= cc && cc <= '9'; cc = getc_x(fp_))var = (var << 3) + (var << 1) + cc - '0';var = var * sign;}inline int c() noexcept { return getc_x(fp_); }inline MaiScanner& operator>>(int& var) noexcept { input_integer<int>(var); return *this; }inline MaiScanner& operator>>(long long& var) noexcept { input_integer<long long>(var); return *this; }inline MaiScanner& operator>>(string& var) {int cc = getc_x(fp_);for (; !isvisiblechar(cc); cc = getc_x(fp_));for (; isvisiblechar(cc); cc = getc_x(fp_))var.push_back(cc);return *this;}template<typename IT> inline void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }};class MaiPrinter {FILE* fp_;public:inline MaiPrinter(FILE* fp):fp_(fp){}template<typename T>void output_integer(T var) noexcept {if (var == 0) { putc_x('0', fp_); return; }if (var < 0)putc_x('-', fp_),var = -var;char stack[32]; int stack_p = 0;while (var)stack[stack_p++] = '0' + (var % 10),var /= 10;while (stack_p)putc_x(stack[--stack_p], fp_);}inline MaiPrinter& operator<<(char c) noexcept { putc_x(c, fp_); return *this; }inline MaiPrinter& operator<<(int var) noexcept { output_integer<int>(var); return *this; }inline MaiPrinter& operator<<(long long var) noexcept { output_integer<long long>(var); return *this; }inline MaiPrinter& operator<<(char* str_p) noexcept { while (*str_p) putc_x(*(str_p++), fp_); return *this; }inline MaiPrinter& operator<<(const string& str) {const char* p = str.c_str();const char* l = p + str.size();while (p < l) putc_x(*p++, fp_);return *this;}template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin :*this << *begin; }};MaiScanner scanner(stdin);MaiPrinter printer(stdout);// Edge構造体を定義する無向グラフclass GraphE {public:using W_T = int;struct Edge {int u, v;W_T value;Edge(int from = 0, int to = 0, W_T value = 0) :u(from), v(to), value(value) {}inline int to(int _v) const { return _v == v ? u : v; }};size_t n;vector<vector<int>> vertex_to;vector<Edge> edges;GraphE(int n = 1) :n(n), vertex_to(n) { }inline size_t size() const noexcept { return n; }void resize(size_t _n) { vertex_to.resize(n = _n); }void connect(int from, int to, W_T val = 0) {vertex_to[(size_t)from].push_back((int)edges.size());vertex_to[(size_t)to].push_back((int)edges.size());edges.emplace_back(from, to, val);}void connect(vector<Edge>&& es) {edges = move(es);for (int i = 0; (size_t)i < edges.size(); ++i) {vertex_to[edges[i].u].push_back(i);vertex_to[edges[i].v].push_back(i);}}};//int N, M;//GraphE graph;ll total = 0;// <distsum, num>pair<ll, int> dfs(int v = 0, int from = -1){ll d = 0;int n = 0;vector<pair<ll, int>> ww;for (auto ei : graph.vertex_to[v]) {auto e = graph.edges[ei];int u = e.to(v);if (from == u) continue;auto p = dfs(u, v);total += p.first;p.first += e.value*p.second;ww.push_back(p);d += ll(p.first);n += p.second;}for (auto w : ww) {total += w.first*(n-w.second);}return pair<ll, int>(d, n+1);}int main() {scanner >> N;M = N - 1;graph.resize(N);repeat(i, M) {int a, b, c;scanner >> a >> b >> c;--a; --b;graph.connect(a, b, c);}total += dfs().first;printer << total*2 << '\n';return 0;}