結果

問題 No.1207 グラフX
ユーザー sten_san
提出日時 2023-04-22 19:43:44
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 168 ms / 2,000 ms
コード長 3,559 bytes
コンパイル時間 2,278 ms
コンパイル使用メモリ 213,040 KB
最終ジャッジ日時 2025-02-12 13:08:22
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 46
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return vector(arg, init);
    else return vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename Container>
auto distance(const Container &c, decltype(begin(c)) iter) {
    return distance(begin(c), iter);
}

template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>
auto isort(RIter first, RIter last, Compare comp = Compare()) {
    vector<int> i(distance(first, last));
    iota(begin(i), end(i), 0);
    sort(begin(i), end(i), [&](auto x, auto y) {
        return comp(*(first + x), *(first + y));
    });
    return i;
}

template <typename, template <typename> typename, typename = void_t<>>
struct detect : false_type {};
template <typename T, template <typename> typename Check>
struct detect<T, Check, void_t<Check<T>>> : true_type {};
template <typename T, template <typename> typename Check>
constexpr inline bool detect_v = detect<T, Check>::value;

template <typename T>
using has_member_sort = decltype(declval<T>().sort());

template <typename Container, typename Compare = less<typename Container::value_type>>
auto sorted(Container c, Compare comp = Compare()) {
    if constexpr (detect_v<Container, has_member_sort>) {
        c.sort(comp);
        return c;
    }
    else {
        sort(begin(c), end(c), comp);
        return c;
    }
}

template <typename Container, typename Compare = equal_to<typename Container::value_type>>
auto uniqued(Container c, Compare comp = Compare()) {
    c.erase(unique(begin(c), end(c), comp), end(c));
    return c;
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

template <typename F>
constexpr auto fix(F &&f) noexcept {
    return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable {
        return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
    };
}

#include <atcoder/dsu>
#include <atcoder/modint>
using mint = atcoder::modint1000000007;

int main() {
    int n, m, x; cin >> n >> m >> x;

    atcoder::dsu dsu(n);

    auto g = vec<array<int, 2>>(uns, n, 0);
    for (int i = 0; i < m; ++i) {
        int x, y, z; cin >> x >> y >> z; --x; --y;

        if (!dsu.same(x, y)) {
            g[x].push_back({ y, z });
            g[y].push_back({ x, z });
            dsu.merge(x, y);
        }
    }

    auto sub = vec<int>(uns, n);
    fix([&](auto f, int v, int p = -1) -> int {
        sub[v] = 1;
        for (auto [u, _] : g[v]) {
            if (u == p) {
                continue;
            }
            sub[v] += f(u, v);
        }
        return sub[v];
    })(0);

    mint ans = 0;

    fix([&](auto f, int v, int p = -1, int z = -1) -> void {
        if (0 <= p) {
            ans += mint(x).pow(z) * sub[v] * (n - sub[v]);
        }

        for (auto [u, w] : g[v]) {
            if (u == p) {
                continue;
            }
            f(u, v, w);
        }
    })(0);

    cout << ans.val() << endl;
}
0