結果

問題 No.1769 Don't Stop the Game
ユーザー haruki_Kharuki_K
提出日時 2021-11-27 00:41:21
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 491 ms / 3,000 ms
コード長 7,704 bytes
コンパイル時間 2,328 ms
コンパイル使用メモリ 221,980 KB
実行使用メモリ 109,708 KB
最終ジャッジ日時 2024-06-29 19:17:24
合計ジャッジ時間 9,851 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 1 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 2 ms
6,944 KB
testcase_07 AC 3 ms
6,944 KB
testcase_08 AC 252 ms
58,108 KB
testcase_09 AC 205 ms
53,076 KB
testcase_10 AC 323 ms
78,760 KB
testcase_11 AC 171 ms
45,276 KB
testcase_12 AC 181 ms
44,152 KB
testcase_13 AC 189 ms
44,844 KB
testcase_14 AC 201 ms
48,808 KB
testcase_15 AC 240 ms
56,688 KB
testcase_16 AC 336 ms
75,568 KB
testcase_17 AC 403 ms
94,068 KB
testcase_18 AC 451 ms
104,708 KB
testcase_19 AC 467 ms
105,796 KB
testcase_20 AC 483 ms
109,708 KB
testcase_21 AC 472 ms
106,796 KB
testcase_22 AC 491 ms
108,196 KB
testcase_23 AC 156 ms
36,788 KB
testcase_24 AC 166 ms
40,836 KB
testcase_25 AC 102 ms
54,776 KB
testcase_26 AC 285 ms
67,404 KB
testcase_27 AC 105 ms
60,936 KB
testcase_28 AC 232 ms
73,476 KB
testcase_29 AC 235 ms
71,948 KB
testcase_30 AC 272 ms
71,812 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define rng(x, l, r) begin(x) + (l), begin(x) + (r)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class A, class B> constexpr auto mp(A &&a, B &&b) { return make_pair(forward<A>(a), forward<B>(b)); }
template <class... T> constexpr auto mt(T&&... x) { return make_tuple(forward<T>(x)...); }
template <class Int> auto constexpr inf_ = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf_<int32_t>;
auto constexpr INF64 = inf_<int64_t>;
auto constexpr INF   = inf_<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T, d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T, d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T, 0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T, d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > (T)y) { x = (T)y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < (T)y) { x = (T)y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
constexpr int64_t mod(int64_t x, int64_t m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr int64_t div_floor(int64_t x, int64_t y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr int64_t div_ceil(int64_t x, int64_t y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
template <class V> V &operator--(V &v) { for (auto &x : v) --x; return v; }
template <class V> V &operator++(V &v) { for (auto &x : v) ++x; return v; }
// <<<
// >>> pair + - * += -= *=
template <class A, class B>
constexpr auto operator+(pair<A, B> const& p, pair<A, B> const& q) {
    return make_pair(p.first + q.first, p.second + q.second);
}
template <class A, class B>
constexpr auto operator-(pair<A, B> const& p, pair<A, B> const& q) {
    return make_pair(p.first - q.first, p.second - q.second);
}
template <class A, class B, class C>
constexpr auto operator*(pair<A, B> const& p, C const& k) {
    return make_pair(p.first * k, p.second * k);
}
template <class A, class B, class C>
constexpr auto operator*(C const& k, pair<A, B> const& p) {
    return make_pair(k * p.first, k * p.second);
}
template <class A, class B>
constexpr auto& operator+=(pair<A, B>& p, pair<A, B> const& q) { return p = p + q; }
template <class A, class B>
constexpr auto& operator-=(pair<A, B>& p, pair<A, B> const& q) { return p = p - q; }
template <class A, class B, class C>
constexpr auto operator*=(pair<A, B>& p, C const& k) { return p = p * k; }
// <<<

int32_t main() {
    int n; cin >> n;
    struct edge { int to, c; };
    vector<vector<edge>> g(n);
    rep (i, n-1) {
        int x, y; cin >> x >> y; --x, --y;
        int c; cin >> c;
        g[x].pb({y, c});
        g[y].pb({x, c});
    }

    vector<int> a(n);
    {
        def (dfs, int x, int p) -> void {
            for (auto [y, c] : g[x]) {
                if (y == p) continue;
                a[y] = a[x]^c;
                dfs(y, x);
            }
        };
        a[0] = 0;
        dfs(0, -1);
    }
    dump(a);

    vector<map<int, pair<int, int>>> dp(n);
    vector<int> add(n);
    int ans = 0;
    def (dfs, int x, int p) -> void {
        for (auto [y, c] : g[x]) {
            if (y == p) continue;
            dfs(y, x);
            auto [A, B] = dp[y][a[x]];
            dump(x, y, add[y], A, B, (add[y] + A) * (B + 1));
            ans += (add[y] + A) * (B + 1);

            if (sz(dp[x]) < sz(dp[y])) {
                swap(dp[x], dp[y]);
                swap(add[x], add[y]);
            }
            add[x] += add[y];
            for (auto [val, cnt] : dp[y]) {
                dp[x][val] += cnt;
            }
        }
        add[x]++;
        dp[x][a[x]] = { -add[x], 1 };
        dump(x, add[x], dp[x]);
    };
    dfs(0, -1);
    for (auto [val, AB] : dp[0]) {
        if (val != a[0]) {
            auto [A, B] = AB;
            dump(val, add[0], A, B, (add[0] + A) * B);
            ans += (add[0] + A) * B;
        }
    }
    cout << ans << '\n';


}
0