結果

問題 No.1207 グラフX
ユーザー yosupotyosupot
提出日時 2020-08-30 13:35:09
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 201 ms / 2,000 ms
コード長 8,830 bytes
コンパイル時間 1,763 ms
コンパイル使用メモリ 135,616 KB
実行使用メモリ 29,184 KB
最終ジャッジ日時 2024-11-15 06:50:41
合計ジャッジ時間 8,935 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 128 ms
18,004 KB
testcase_01 AC 123 ms
17,992 KB
testcase_02 AC 123 ms
18,036 KB
testcase_03 AC 125 ms
18,016 KB
testcase_04 AC 126 ms
18,008 KB
testcase_05 AC 199 ms
29,032 KB
testcase_06 AC 197 ms
28,888 KB
testcase_07 AC 201 ms
29,184 KB
testcase_08 AC 98 ms
12,100 KB
testcase_09 AC 106 ms
15,552 KB
testcase_10 AC 193 ms
24,448 KB
testcase_11 AC 197 ms
28,956 KB
testcase_12 AC 97 ms
12,940 KB
testcase_13 AC 31 ms
5,760 KB
testcase_14 AC 120 ms
17,312 KB
testcase_15 AC 109 ms
14,108 KB
testcase_16 AC 36 ms
6,528 KB
testcase_17 AC 80 ms
11,316 KB
testcase_18 AC 64 ms
11,460 KB
testcase_19 AC 60 ms
8,576 KB
testcase_20 AC 124 ms
17,608 KB
testcase_21 AC 5 ms
5,248 KB
testcase_22 AC 80 ms
11,532 KB
testcase_23 AC 87 ms
12,924 KB
testcase_24 AC 58 ms
10,592 KB
testcase_25 AC 128 ms
17,528 KB
testcase_26 AC 92 ms
13,716 KB
testcase_27 AC 116 ms
15,840 KB
testcase_28 AC 107 ms
15,520 KB
testcase_29 AC 108 ms
15,836 KB
testcase_30 AC 50 ms
8,164 KB
testcase_31 AC 23 ms
5,248 KB
testcase_32 AC 43 ms
8,516 KB
testcase_33 AC 47 ms
8,364 KB
testcase_34 AC 100 ms
13,892 KB
testcase_35 AC 5 ms
5,248 KB
testcase_36 AC 100 ms
15,168 KB
testcase_37 AC 86 ms
12,036 KB
testcase_38 AC 17 ms
5,632 KB
testcase_39 AC 49 ms
9,396 KB
testcase_40 AC 13 ms
5,248 KB
testcase_41 AC 63 ms
8,924 KB
testcase_42 AC 2 ms
5,248 KB
testcase_43 AC 2 ms
5,248 KB
testcase_44 AC 2 ms
5,248 KB
testcase_45 AC 126 ms
18,068 KB
testcase_46 AC 126 ms
17,916 KB
testcase_47 AC 125 ms
18,124 KB
testcase_48 AC 125 ms
17,960 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
//#undef LOCAL




#include <algorithm>

#include <array>

#include <bitset>

#include <cassert>

#include <complex>

#include <cstdio>

#include <cstring>

#include <iostream>

#include <map>

#include <numeric>

#include <queue>

#include <set>

#include <string>

#include <unordered_map>

#include <unordered_set>

#include <vector>

using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;



#include <unistd.h>

struct Scanner {
    int fd = -1;
    char line[(1 << 15) + 1];
    size_t st = 0, ed = 0;
    void reread() {
        memmove(line, line + st, ed - st);
        ed -= st;
        st = 0;
        ed += ::read(fd, line + ed, (1 << 15) - ed);
        line[ed] = '\0';
    }
    bool succ() {
        while (true) {
            if (st == ed) {
                reread();
                if (st == ed) return false;
            }
            while (st != ed && isspace(line[st])) st++;
            if (st != ed) break;
        }
        if (ed - st <= 50) {
            bool sep = false;
            for (size_t i = st; i < ed; i++) {
                if (isspace(line[i])) {
                    sep = true;
                    break;
                }
            }
            if (!sep) reread();
        }
        return true;
    }
    template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
    bool read_single(T& ref) {
        if (!succ()) return false;
        while (true) {
            size_t sz = 0;
            while (st + sz < ed && !isspace(line[st + sz])) sz++;
            ref.append(line + st, sz);
            st += sz;
            if (!sz || st != ed) break;
            reread();
        }
        return true;
    }
    template <class T, enable_if_t<is_integral<T>::value>* = nullptr>
    bool read_single(T& ref) {
        if (!succ()) return false;
        bool neg = false;
        if (line[st] == '-') {
            neg = true;
            st++;
        }
        ref = T(0);
        while (isdigit(line[st])) {
            ref = 10 * ref + (line[st++] & 0xf);
        }
        if (neg) ref = -ref;
        return true;
    }
    template <class T> bool read_single(V<T>& ref) {
        for (auto& d : ref) {
            if (!read_single(d)) return false;
        }
        return true;
    }
    void read() {}
    template <class H, class... T> void read(H& h, T&... t) {
        bool f = read_single(h);
        assert(f);
        read(t...);
    }
    int read_unsafe() { return 0; }
    template <class H, class... T> int read_unsafe(H& h, T&... t) {
        bool f = read_single(h);
        if (!f) return 0;
        return 1 + read_unsafe(t...);
    }
    Scanner(FILE* fp) : fd(fileno(fp)) {}
};

struct Printer {
  public:
    template <bool F = false> void write() {}
    template <bool F = false, class H, class... T>
    void write(const H& h, const T&... t) {
        if (F) write_single(' ');
        write_single(h);
        write<true>(t...);
    }
    template <class... T> void writeln(const T&... t) {
        write(t...);
        write_single('\n');
    }

    Printer(FILE* _fp) : fp(_fp) {}
    ~Printer() { flush(); }

  private:
    static constexpr size_t SIZE = 1 << 15;
    FILE* fp;
    char line[SIZE], small[50];
    size_t pos = 0;
    void flush() {
        fwrite(line, 1, pos, fp);
        pos = 0;
    }
    void write_single(const char& val) {
        if (pos == SIZE) flush();
        line[pos++] = val;
    }
    template <class T, enable_if_t<is_integral<T>::value>* = nullptr>
    void write_single(T val) {
        if (pos > (1 << 15) - 50) flush();
        if (val == 0) {
            write_single('0');
            return;
        }
        if (val < 0) {
            write_single('-');
            val = -val; // todo min
        }
        size_t len = 0;
        while (val) {
            small[len++] = char(0x30 | (val % 10));
            val /= 10;
        }
        for (size_t i = 0; i < len; i++) {
            line[pos + i] = small[len - 1 - i];
        }
        pos += len;
    }
    void write_single(__int128 val) {
        if (pos > (1 << 15) - 50) flush();
        if (val == 0) {
            write_single('0');
            return;
        }
        if (val < 0) {
            write_single('-');
            val = -val; // todo min
        }
        size_t len = 0;
        while (val) {
            small[len++] = char(0x30 | (val % 10));
            val /= 10;
        }
        for (size_t i = 0; i < len; i++) {
            line[pos + i] = small[len - 1 - i];
        }
        pos += len;
    }

    void write_single(const string& s) {
        for (char c : s) write_single(c);
    }
    void write_single(const char* s) {
        size_t len = strlen(s);
        for (size_t i = 0; i < len; i++) write_single(s[i]);
    }
    template <class T> void write_single(const V<T>& val) {
        auto n = val.size();
        for (size_t i = 0; i < n; i++) {
            if (i) write_single(' ');
            write_single(val[i]);
        }
    }
};

Scanner sc = Scanner(stdin);
Printer pr = Printer(stdout);

struct dsu {
  public:
    dsu() : _n(0) {}
    dsu(int n) : _n(n), parent_or_size(n, -1) {}

    int merge(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        int x = leader(a), y = leader(b);
        if (x == y) return x;
        if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        return x;
    }

    bool same(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        return leader(a) == leader(b);
    }

    int leader(int a) {
        assert(0 <= a && a < _n);
        if (parent_or_size[a] < 0) return a;
        return parent_or_size[a] = leader(parent_or_size[a]);
    }

    int size(int a) {
        assert(0 <= a && a < _n);
        return -parent_or_size[leader(a)];
    }

    std::vector<std::vector<int>> groups() {
        std::vector<std::vector<int>> buf(_n);
        for (int i = 0; i < _n; i++) {
            buf[leader(i)].push_back(i);
        }
        std::vector<std::vector<int>> result;
        for (auto v : buf) {
            if (v.empty()) continue;
            result.push_back(v);
        }
        return result;
    }

  private:
    int _n;
    // root node: -1 * component size
    // otherwise: parent
    std::vector<int> parent_or_size;
};




template <uint MD> struct ModInt {
    using M = ModInt;
    static constexpr uint get_mod() { return MD; }
    const static M G;
    uint v;
    ModInt(ll _v = 0) { set_v(uint(_v % MD + MD)); }
    M& set_v(uint _v) {
        v = (_v < MD) ? _v : _v - MD;
        return *this;
    }
    explicit operator bool() const { return v != 0; }
    M operator-() const { return M() - *this; }
    M operator+(const M& r) const { return M().set_v(v + r.v); }
    M operator-(const M& r) const { return M().set_v(v + MD - r.v); }
    M operator*(const M& r) const { return M().set_v(uint(ull(v) * r.v % MD)); }
    M operator/(const M& r) const { return *this * r.inv(); }
    M& operator+=(const M& r) { return *this = *this + r; }
    M& operator-=(const M& r) { return *this = *this - r; }
    M& operator*=(const M& r) { return *this = *this * r; }
    M& operator/=(const M& r) { return *this = *this / r; }
    bool operator==(const M& r) const { return v == r.v; }
    M pow(ll n) const {
        M x = *this, r = 1;
        while (n) {
            if (n & 1) r *= x;
            x *= x;
            n >>= 1;
        }
        return r;
    }
    M inv() const { return pow(MD - 2); }
    friend ostream& operator<<(ostream& os, const M& r) { return os << r.v; }
};
// using Mint = ModInt<998244353>;
// template<> const Mint Mint::G = Mint(3);
using Mint = ModInt<TEN(9) + 7>;

int main() {
    int n, m;
    ll _x;
    sc.read(n, m, _x);
    Mint f = Mint(_x);

    struct E {
        int to;
        ll dist;
    };
    VV<E> g(n);
    auto d = dsu(n);
    for (int i = 0; i < m; i++) {
        int x, y; ll z;
        sc.read(x, y, z); x--; y--;
        if (d.same(x, y)) continue;
        d.merge(x, y);
        g[x].push_back({y, z});
        g[y].push_back({x, z});
    }
    Mint ans = 0;
    auto dfs = [&](auto self, int p, int b) -> int {
        int ch = 1;
        for (auto e: g[p]) {
            int d = e.to;
            if (d == b) continue;
            int w = self(self, d, p);
                          ;
            ans += Mint(w) * Mint(n - w) * f.pow(e.dist);
            ch += w;
        }
        return ch;
    };
    dfs(dfs, 0, -1);
    pr.writeln(ans.v);

    return 0;
}
0