結果

問題 No.1207 グラフX
ユーザー 👑 emthrmemthrm
提出日時 2020-08-30 13:26:11
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 306 ms / 2,000 ms
コード長 5,574 bytes
コンパイル時間 2,141 ms
コンパイル使用メモリ 212,128 KB
実行使用メモリ 33,756 KB
最終ジャッジ日時 2024-04-27 06:53:44
合計ジャッジ時間 13,163 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 238 ms
17,360 KB
testcase_01 AC 265 ms
17,236 KB
testcase_02 AC 238 ms
17,264 KB
testcase_03 AC 244 ms
17,364 KB
testcase_04 AC 259 ms
17,356 KB
testcase_05 AC 304 ms
33,756 KB
testcase_06 AC 306 ms
33,732 KB
testcase_07 AC 304 ms
33,708 KB
testcase_08 AC 176 ms
11,380 KB
testcase_09 AC 196 ms
14,384 KB
testcase_10 AC 290 ms
25,196 KB
testcase_11 AC 296 ms
33,656 KB
testcase_12 AC 181 ms
12,272 KB
testcase_13 AC 80 ms
6,940 KB
testcase_14 AC 240 ms
16,748 KB
testcase_15 AC 195 ms
13,268 KB
testcase_16 AC 80 ms
6,944 KB
testcase_17 AC 150 ms
10,664 KB
testcase_18 AC 131 ms
11,176 KB
testcase_19 AC 126 ms
7,936 KB
testcase_20 AC 238 ms
17,160 KB
testcase_21 AC 12 ms
6,940 KB
testcase_22 AC 150 ms
11,032 KB
testcase_23 AC 162 ms
12,156 KB
testcase_24 AC 114 ms
10,312 KB
testcase_25 AC 230 ms
16,856 KB
testcase_26 AC 175 ms
13,344 KB
testcase_27 AC 216 ms
15,056 KB
testcase_28 AC 198 ms
14,460 KB
testcase_29 AC 209 ms
15,136 KB
testcase_30 AC 93 ms
7,756 KB
testcase_31 AC 64 ms
6,940 KB
testcase_32 AC 88 ms
8,312 KB
testcase_33 AC 89 ms
7,936 KB
testcase_34 AC 184 ms
13,256 KB
testcase_35 AC 14 ms
6,940 KB
testcase_36 AC 190 ms
14,316 KB
testcase_37 AC 162 ms
11,444 KB
testcase_38 AC 40 ms
6,940 KB
testcase_39 AC 94 ms
8,868 KB
testcase_40 AC 44 ms
6,944 KB
testcase_41 AC 121 ms
8,192 KB
testcase_42 AC 2 ms
6,940 KB
testcase_43 AC 1 ms
6,940 KB
testcase_44 AC 2 ms
6,944 KB
testcase_45 AC 226 ms
17,228 KB
testcase_46 AC 232 ms
17,484 KB
testcase_47 AC 228 ms
17,380 KB
testcase_48 AC 231 ms
17,348 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int mod = MOD;
struct ModInt {
  unsigned val;
  ModInt(): val(0) {}
  ModInt(ll x) : val(x >= 0 ? x % mod : x % mod + mod) {}
  ModInt pow(ll exponent) const {
    ModInt tmp = *this, res = 1;
    while (exponent > 0) {
      if (exponent & 1) res *= tmp;
      tmp *= tmp;
      exponent >>= 1;
    }
    return res;
  }
  ModInt &operator+=(const ModInt &x) { if((val += x.val) >= mod) val -= mod; return *this; }
  ModInt &operator-=(const ModInt &x) { if((val += mod - x.val) >= mod) val -= mod; return *this; }
  ModInt &operator*=(const ModInt &x) { val = static_cast<unsigned long long>(val) * x.val % mod; return *this; }
  ModInt &operator/=(const ModInt &x) {
    // assert(__gcd(static_cast<int>(x.val), mod) == 1);
    unsigned a = x.val, b = mod; int u = 1, v = 0;
    while (b) {
      unsigned tmp = a / b;
      swap(a -= tmp * b, b);
      swap(u -= tmp * v, v);
    }
    return *this *= u;
  }
  bool operator==(const ModInt &x) const { return val == x.val; }
  bool operator!=(const ModInt &x) const { return val != x.val; }
  bool operator<(const ModInt &x) const { return val < x.val; }
  bool operator<=(const ModInt &x) const { return val <= x.val; }
  bool operator>(const ModInt &x) const { return val > x.val; }
  bool operator>=(const ModInt &x) const { return val >= x.val; }
  ModInt &operator++() { if (++val == mod) val = 0; return *this; }
  ModInt operator++(int) { ModInt res = *this; ++*this; return res; }
  ModInt &operator--() { val = (val == 0 ? mod : val) - 1; return *this; }
  ModInt operator--(int) { ModInt res = *this; --*this; return res; }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { return ModInt(val ? mod - val : 0); }
  ModInt operator+(const ModInt &x) const { return ModInt(*this) += x; }
  ModInt operator-(const ModInt &x) const { return ModInt(*this) -= x; }
  ModInt operator*(const ModInt &x) const { return ModInt(*this) *= x; }
  ModInt operator/(const ModInt &x) const { return ModInt(*this) /= x; }
  friend ostream &operator<<(ostream &os, const ModInt &x) { return os << x.val; }
  friend istream &operator>>(istream &is, ModInt &x) { ll val; is >> val; x = ModInt(val); return is; }
};
ModInt abs(const ModInt &x) { return x; }
struct Combinatorics {
  int val; // "val!" and "mod" must be disjoint.
  vector<ModInt> fact, fact_inv, inv;
  Combinatorics(int val = 10000000) : val(val), fact(val + 1), fact_inv(val + 1), inv(val + 1) {
    fact[0] = 1;
    FOR(i, 1, val + 1) fact[i] = fact[i - 1] * i;
    fact_inv[val] = ModInt(1) / fact[val];
    for (int i = val; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i;
    FOR(i, 1, val + 1) inv[i] = fact[i - 1] * fact_inv[i];
  }
  ModInt nCk(int n, int k) const {
    if (n < 0 || n < k || k < 0) return ModInt(0);
    // assert(n <= val && k <= val);
    return fact[n] * fact_inv[k] * fact_inv[n - k];
  }
  ModInt nPk(int n, int k) const {
    if (n < 0 || n < k || k < 0) return ModInt(0);
    // assert(n <= val);
    return fact[n] * fact_inv[n - k];
  }
  ModInt nHk(int n, int k) const {
    if (n < 0 || k < 0) return ModInt(0);
    return k == 0 ? ModInt(1) : nCk(n + k - 1, k);
  }
};

struct UnionFind {
  UnionFind(int n) : data(n, -1) {}

  int root(int ver) { return data[ver] < 0 ? ver : data[ver] = root(data[ver]); }

  bool unite(int u, int v) {
    u = root(u);
    v = root(v);
    if (u == v) return false;
    if (data[u] > data[v]) swap(u, v);
    data[u] += data[v];
    data[v] = u;
    return true;
  }

  bool same(int u, int v) { return root(u) == root(v); }

  int size(int ver) { return -data[root(ver)]; }

private:
  vector<int> data;
};

using CostType = int;
struct Edge {
  int src, dst; CostType cost;
  Edge(int src, int dst, CostType cost = 0) : src(src), dst(dst), cost(cost) {}
  inline bool operator<(const Edge &x) const {
    return cost != x.cost ? cost < x.cost : dst != x.dst ? dst < x.dst : src < x.src;
  }
  inline bool operator<=(const Edge &x) const { return !(x < *this); }
  inline bool operator>(const Edge &x) const { return x < *this; }
  inline bool operator>=(const Edge &x) const { return !(*this < x); }
};

int main() {
  int n, m, x; cin >> n >> m >> x;
  UnionFind uf(n);
  vector<vector<Edge>> graph(n);
  while (m--) {
    int x, y, z; cin >> x >> y >> z; --x; --y;
    if (uf.unite(x, y)) {
      graph[x].emplace_back(x, y, z);
      graph[y].emplace_back(y, x, z);
    }
  }
  ModInt ans = 0;
  function<int(int, int)> dfs = [&](int par, int ver) {
    int sub = 1;
    for (const Edge &e : graph[ver]) {
      if (e.dst == par) continue;
      int d = dfs(ver, e.dst);
      ans += ModInt(x).pow(e.cost) * d * (n - d);
      sub += d;
    }
    return sub;
  };
  dfs(-1, 0);
  cout << ans << '\n';
  return 0;
}
0