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

• 問題: No.1843 Tree ANDistance
• ユーザー: satashun
• 提出日時: 2023-05-16 12:38:00
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 7,078 bytes
• コンパイル時間: 3,363 ms
• コンパイル使用メモリ: 219,548 KB
• 実行使用メモリ: 8,684 KB
• 最終ジャッジ日時: 2024-05-08 10:28:11
• 合計ジャッジ時間: 19,357 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	769 ms; 7,656 KB
testcase_01	AC	766 ms; 7,656 KB
testcase_02	AC	791 ms; 7,656 KB
testcase_03	AC	791 ms; 7,576 KB
testcase_04	AC	781 ms; 7,528 KB
testcase_05	WA	-
testcase_06	AC	501 ms; 7,528 KB
testcase_07	AC	709 ms; 7,524 KB
testcase_08	AC	743 ms; 7,652 KB
testcase_09	AC	733 ms; 7,420 KB
testcase_10	AC	718 ms; 7,396 KB
testcase_11	AC	764 ms; 7,532 KB
testcase_12	AC	386 ms; 7,268 KB
testcase_13	AC	458 ms; 7,400 KB
testcase_14	AC	17 ms; 6,940 KB
testcase_15	AC	19 ms; 6,944 KB
testcase_16	AC	8 ms; 6,940 KB
testcase_17	AC	8 ms; 6,944 KB
testcase_18	AC	4 ms; 6,940 KB
testcase_19	AC	14 ms; 6,944 KB
testcase_20	AC	8 ms; 6,944 KB
testcase_21	AC	2 ms; 6,940 KB
testcase_22	AC	2 ms; 6,944 KB
testcase_23	AC	2 ms; 6,940 KB
testcase_24	AC	2 ms; 6,944 KB
testcase_25	AC	2 ms; 6,944 KB
testcase_26	AC	2 ms; 6,944 KB
testcase_27	AC	2 ms; 6,940 KB
testcase_28	AC	549 ms; 8,428 KB
testcase_29	AC	342 ms; 6,944 KB
testcase_30	WA	-
testcase_31	AC	614 ms; 8,684 KB
testcase_32	AC	577 ms; 8,552 KB
testcase_33	AC	139 ms; 6,940 KB
testcase_34	AC	422 ms; 7,400 KB
testcase_35	AC	2 ms; 6,940 KB
testcase_36	AC	2 ms; 6,940 KB
testcase_37	AC	2 ms; 6,940 KB

ソースコード

#pragma region satashun
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;

template <class T>
V<T> make_vec(size_t a) {
    return V<T>(a);
}

template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return V<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}

template <typename T, typename V>
void fill_vec(T& v, const V& val) {
    v = val;
}

template <typename T, typename V>
void fill_vec(vector<T>& vec, const V& val) {
    for (auto& v : vec) fill_vec(v, val);
}

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }

template <class T, class U>
void chmin(T& t, const U& u) {
    if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
    if (t < u) t = u;
}

template <typename T>
int arglb(const V<T>& v, const T& x) {
    return distance(v.begin(), lower_bound(ALL(v), x));
}

template <typename T>
int argub(const V<T>& v, const T& x) {
    return distance(v.begin(), upper_bound(ALL(v), x));
}

template <class T>
void mkuni(vector<T>& v) {
    sort(ALL(v));
    v.erase(unique(ALL(v)), end(v));
}

template <class T>
vector<int> sort_by(const vector<T>& v, bool increasing = true) {
    vector<int> res(v.size());
    iota(res.begin(), res.end(), 0);

    if (increasing) {
        stable_sort(res.begin(), res.end(),
                    [&](int i, int j) { return v[i] < v[j]; });
    } else {
        stable_sort(res.begin(), res.end(),
                    [&](int i, int j) { return v[i] > v[j]; });
    }
    return res;
}

template <class T, class U>
istream& operator>>(istream& is, pair<T, U>& p) {
    is >> p.first >> p.second;
    return is;
}

template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <class T>
istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) {
        is >> x;
    }
    return is;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    rep(i, v.size()) {
        if (i) os << ",";
        os << v[i];
    }
    os << "}";
    return os;
}

template <class T>
ostream& operator<<(ostream& os, const set<T>& ST) {
    os << "{";
    for (auto it = ST.begin(); it != ST.end(); ++it) {
        if (it != ST.begin()) os << ",";
        os << *it;
    }
    os << "}";
    return os;
}

template <class T>
ostream& operator<<(ostream& os, const multiset<T>& ST) {
    os << "{";
    for (auto it = ST.begin(); it != ST.end(); ++it) {
        if (it != ST.begin()) os << ",";
        os << *it;
    }
    os << "}";
    return os;
}

template <class T, class U>
ostream& operator<<(ostream& os, const map<T, U>& MP) {
    for (auto it = MP.begin(); it != MP.end(); ++it) {
        os << "(" << it->first << ": " << it->second << ")";
    }
    return os;
}

string to_string(__int128_t x) {
    if (x == 0) return "0";
    string result;
    if (x < 0) {
        result += "-";
        x *= -1;
    }
    string t;
    while (x) {
        t.push_back('0' + x % 10);
        x /= 10;
    }
    reverse(t.begin(), t.end());
    return result + t;
}

ostream& operator<<(ostream& o, __int128_t x) { return o << to_string(x); }

#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#define debug(...) \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

template <class T>
V<T>& operator+=(V<T>& vec, const T& v) {
    for (auto& x : vec) x += v;
    return vec;
}

template <class T>
V<T>& operator-=(V<T>& vec, const T& v) {
    for (auto& x : vec) x -= v;
    return vec;
}

// suc : 1 = newline, 2 = space
template <class T>
void print(T x, int suc = 1) {
    cout << x;
    if (suc == 1)
        cout << "\n";
    else if (suc == 2)
        cout << " ";
}

template <class T>
void print(const vector<T>& v, int suc = 1) {
    for (int i = 0; i < v.size(); ++i)
        print(v[i], i == int(v.size()) - 1 ? suc : 2);
}

template <class T>
void show(T x) {
    print(x, 1);
}

template <typename Head, typename... Tail>
void show(Head H, Tail... T) {
    print(H, 2);
    show(T...);
}

int topbit(int t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(int a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(int t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
int bit_parity(int t) { return __builtin_parity(t); }
int bit_parity(ll t) { return __builtin_parityll(t); }

struct prepare_io {
    prepare_io() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(10);
    }
} prep_io;
#pragma endregion satashun

class unionfind {
    vector<int> par, size;

   public:
    void init(int n) {
        par.resize(n);
        size.resize(n);

        for (int i = 0; i < n; i++) {
            par[i] = i;
            size[i] = 1;
        }
    }

    unionfind() {}
    unionfind(int n) { init(n); }

    int find(int x) {
        if (par[x] == x)
            return x;
        else
            return par[x] = find(par[x]);
    }

    bool unite(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) return false;
        if (size[x] < size[y]) swap(x, y);

        par[y] = x;
        size[x] += size[y];
        return true;
    }

    bool same(int x, int y) { return (find(x) == find(y)); }
    int get_size(int x) { return size[find(x)]; }
};

const ll md = TEN(9) + 7;

void slv() {
    int N;
    cin >> N;
    V<tuple<int, int, int>> es;

    rep(i, N - 1) {
        int a, b, c;
        cin >> a >> b >> c;
        --a, --b;
        es.eb(a, b, c);
    }

    ll ans = 0;
    rep(i, 30) {
        unionfind uf(N);
        for (auto [a, b, c] : es) {
            if (c >> i & 1) {
                uf.unite(a, b);
            }
        }

        map<int, int> T;
        rep(i, N) T[uf.find(i)] = uf.get_size(i);

        for (auto [_, c] : T) {
            ans += c * (c - 1) / 2 % md * (1 << i);
            ans %= md;
        }
    }
    show(ans);
}

int main() {
    int cases = 1;
    // cin >> cases;
    rep(i, cases) slv();

    return 0;
}