結果

問題 No.1207 グラフX
ユーザー heno239heno239
提出日時 2020-08-30 13:12:26
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 234 ms / 2,000 ms
コード長 3,996 bytes
コンパイル時間 1,522 ms
コンパイル使用メモリ 123,864 KB
実行使用メモリ 45,052 KB
最終ジャッジ日時 2024-11-15 06:30:26
合計ジャッジ時間 11,190 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 170 ms
27,792 KB
testcase_01 AC 188 ms
27,792 KB
testcase_02 AC 180 ms
27,820 KB
testcase_03 AC 189 ms
27,800 KB
testcase_04 AC 182 ms
27,796 KB
testcase_05 AC 232 ms
45,052 KB
testcase_06 AC 234 ms
44,996 KB
testcase_07 AC 231 ms
44,928 KB
testcase_08 AC 144 ms
21,992 KB
testcase_09 AC 153 ms
24,680 KB
testcase_10 AC 219 ms
36,448 KB
testcase_11 AC 230 ms
44,928 KB
testcase_12 AC 136 ms
22,576 KB
testcase_13 AC 72 ms
15,488 KB
testcase_14 AC 168 ms
27,104 KB
testcase_15 AC 146 ms
23,848 KB
testcase_16 AC 76 ms
16,000 KB
testcase_17 AC 115 ms
20,636 KB
testcase_18 AC 96 ms
20,788 KB
testcase_19 AC 109 ms
18,372 KB
testcase_20 AC 174 ms
27,540 KB
testcase_21 AC 16 ms
11,840 KB
testcase_22 AC 117 ms
20,872 KB
testcase_23 AC 124 ms
22,404 KB
testcase_24 AC 83 ms
19,716 KB
testcase_25 AC 178 ms
27,344 KB
testcase_26 AC 130 ms
23,328 KB
testcase_27 AC 158 ms
25,612 KB
testcase_28 AC 154 ms
24,788 KB
testcase_29 AC 145 ms
25,412 KB
testcase_30 AC 74 ms
17,352 KB
testcase_31 AC 60 ms
14,532 KB
testcase_32 AC 61 ms
17,472 KB
testcase_33 AC 67 ms
17,348 KB
testcase_34 AC 146 ms
23,616 KB
testcase_35 AC 17 ms
12,032 KB
testcase_36 AC 146 ms
24,236 KB
testcase_37 AC 128 ms
21,396 KB
testcase_38 AC 34 ms
14,080 KB
testcase_39 AC 74 ms
18,096 KB
testcase_40 AC 48 ms
13,256 KB
testcase_41 AC 104 ms
18,432 KB
testcase_42 AC 5 ms
11,648 KB
testcase_43 AC 5 ms
11,588 KB
testcase_44 AC 5 ms
11,648 KB
testcase_45 AC 174 ms
27,908 KB
testcase_46 AC 172 ms
27,800 KB
testcase_47 AC 172 ms
27,912 KB
testcase_48 AC 171 ms
27,804 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 19;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

int gcd(int a, int b) {
	if (a < b)swap(a, b);
	while (b) {
		int r = a % b; a = b; b = r;
	}
	return a;
}
struct uf {
private:
	vector<int> par, ran;
public:
	uf(int n) {
		par.resize(n, 0);
		ran.resize(n, 0);
		rep(i, n) {
			par[i] = i;
		}
	}
	int find(int x) {
		if (par[x] == x)return x;
		else return par[x] = find(par[x]);
	}
	void unite(int x, int y) {
		x = find(x), y = find(y);
		if (x == y)return;
		if (ran[x] < ran[y]) {
			par[x] = y;
		}
		else {
			par[y] = x;
			if (ran[x] == ran[y])ran[x]++;
		}
	}
	bool same(int x, int y) {
		return find(x) == find(y);
	}
};

struct edge {
	int to, cost;
};
void solve() {
	int n, m; cin >> n >> m;
	ll x; cin >> x;
	uf u(n);
	vector<int> a(m), b(m), c(m);
	vector<vector<edge>> G(n);
	rep(i, m) {
		cin >> a[i] >> b[i] >> c[i];
		a[i]--; b[i]--;
		if (!u.same(a[i], b[i])) {
			u.unite(a[i], b[i]);
			G[a[i]].push_back({ b[i],c[i] });
			G[b[i]].push_back({ a[i],c[i] });
		}
	}
	modint ans = 0;
	function<int(int, int)> dfs = [&](int id, int fr)->int {
		int res = 1;
		for (edge e : G[id])if (e.to != fr) {
			int nex = dfs(e.to, id);
			modint num = (ll)nex * (n - nex);
			ans += num * (modint)mod_pow(x, e.cost);
			res += nex;
		}
		return res;
	}; dfs(0, -1);
	cout << ans << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(15);
	//init_f(); 
	//init();
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0