#848705 (C++17) No.1843 Tree ANDistance

• 問題: No.1843 Tree ANDistance
• ユーザー: commy
• 提出日時: 2023-03-13 00:46:04
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 108 ms / 2,000 ms
• コード長: 4,772 bytes
• コンパイル時間: 850 ms
• コンパイル使用メモリ: 92,096 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-09-18 07:17:16
• 合計ジャッジ時間: 4,036 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	108 ms; 6,812 KB
testcase_01	AC	101 ms; 6,940 KB
testcase_02	AC	97 ms; 6,940 KB
testcase_03	AC	97 ms; 6,940 KB
testcase_04	AC	103 ms; 6,940 KB
testcase_05	AC	80 ms; 6,940 KB
testcase_06	AC	91 ms; 6,944 KB
testcase_07	AC	95 ms; 6,940 KB
testcase_08	AC	98 ms; 6,940 KB
testcase_09	AC	95 ms; 6,940 KB
testcase_10	AC	91 ms; 6,940 KB
testcase_11	AC	101 ms; 6,944 KB
testcase_12	AC	74 ms; 6,944 KB
testcase_13	AC	87 ms; 6,944 KB
testcase_14	AC	6 ms; 6,940 KB
testcase_15	AC	6 ms; 6,944 KB
testcase_16	AC	3 ms; 6,940 KB
testcase_17	AC	3 ms; 6,940 KB
testcase_18	AC	2 ms; 6,940 KB
testcase_19	AC	5 ms; 6,940 KB
testcase_20	AC	3 ms; 6,940 KB
testcase_21	AC	1 ms; 6,940 KB
testcase_22	AC	2 ms; 6,940 KB
testcase_23	AC	1 ms; 6,940 KB
testcase_24	AC	1 ms; 6,940 KB
testcase_25	AC	1 ms; 6,940 KB
testcase_26	AC	2 ms; 6,944 KB
testcase_27	AC	2 ms; 6,940 KB
testcase_28	AC	46 ms; 6,944 KB
testcase_29	AC	31 ms; 6,940 KB
testcase_30	AC	30 ms; 6,940 KB
testcase_31	AC	50 ms; 6,944 KB
testcase_32	AC	48 ms; 6,940 KB
testcase_33	AC	16 ms; 6,944 KB
testcase_34	AC	38 ms; 6,940 KB
testcase_35	AC	2 ms; 6,944 KB
testcase_36	AC	1 ms; 6,940 KB
testcase_37	AC	2 ms; 6,940 KB

ソースコード

#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <limits>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;  // NOLINT
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
struct Inf { template<typename T> constexpr operator T() { return numeric_limits<T>::max() / 2; } };
// clang-format on

template<ll MOD>
class ModInt {
    ll n;
    auto constexpr inverse() const {
        return this->pow(*this, this->mod - 2);
    }

public:
    constexpr static ll mod = MOD;
    using mint = ModInt<MOD>;

    constexpr ModInt() : n(0) {}
    constexpr ModInt(const ll &nn) : n(((nn % MOD) + MOD) % MOD) {}
    constexpr mint operator+=(const mint &m) {
        n += m.n;
        if (n >= mint::mod) n -= mint::mod;
        return *this;
    }
    constexpr mint operator-=(const mint &m) {
        n -= m.n;
        if (n < 0) n += mint::mod;
        return *this;
    }
    constexpr mint operator*=(const mint &m) {
        n *= m.n;
        if (n >= mint::mod) n %= mint::mod;
        return *this;
    }
    constexpr mint operator/=(const mint &m) {
        return (*this) *= m.inverse();
    }
    friend constexpr mint operator+(mint t, const mint &m) {
        return t += m;
    }
    friend constexpr mint operator-(mint t, const mint &m) {
        return t -= m;
    }
    friend constexpr mint operator*(mint t, const mint &m) {
        return t *= m;
    }
    friend constexpr mint operator/(mint t, const mint &m) {
        return t /= m;
    }
    constexpr mint operator=(const ll &l) {
        n = l % mint::mod;
        if (n < 0) n += mint::mod;
        return *this;
    }
    friend ostream &operator<<(ostream &out, const mint &m) {
        out << m.n;
        return out;
    }
    friend istream &operator>>(istream &in, mint &m) {
        ll l;
        in >> l;
        m = l;
        return in;
    }
    static constexpr auto pow(const mint &x, ll p) {
        mint ans = 1;
        for (auto m = x; p > 0; p /= 2, m *= m) {
            if (p % 2) ans *= m;
        }
        return ans;
    }
    constexpr ll get_raw() const {
        return n;
    }
};
using mint = ModInt<1000000007>::mint;
constexpr mint operator"" _m(unsigned long long m) {
    return mint(m);
}

class UnionFind {
public:
    vector<int> par;
    int N;
    UnionFind(int n) {
        par.resize(n, -1);
        N = n;
    }
    int Find(int n) {
        return par[n] < 0 ? n : par[n] = Find(par[n]);
    }
    bool Union(int x, int y) {
        x = Find(x);
        y = Find(y);
        if (x == y) return false;
        if (-par[x] > -par[y]) swap(x, y);
        par[y] += par[x];
        par[x] = y;
        N--;
        return true;
    }
    bool Same(int x, int y) {
        return Find(x) == Find(y);
    }
    int size(int x) {
        return -par[Find(x)];
    }
    int size() {
        return N;
    }
};

using Edge = tuple<int, int, ll>;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<Edge> edges;
    rep(i, 0, n - 1) {
        int a, b, c;
        cin >> a >> b >> c;
        a--;
        b--;
        edges.emplace_back(a, b, c);
    }

    mint div2 = 1_m / 2;
    mint ans = 0;
    rep(bit, 0, 33) {
        UnionFind uf(n);
        for (auto [a, b, c] : edges) {
            if ((c >> bit) & 1) uf.Union(a, b);
        }
        vector<bool> used(n, false);
        mint masked = 1LL << bit;
        rep(i, 0, n) {
            int p = uf.Find(i);
            if (used[p]) continue;
            used[p] = true;
            ll s = uf.size(p);
            ans += 1_m * s * (s - 1) * div2 * masked;
        }
    }

    print(ans);

    return 0;
}