結果

問題 No.1207 グラフX
ユーザー kaagekaage
提出日時 2020-07-31 10:56:53
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 401 ms / 2,000 ms
コード長 6,255 bytes
コンパイル時間 2,680 ms
コンパイル使用メモリ 130,304 KB
実行使用メモリ 34,740 KB
最終ジャッジ日時 2023-09-20 02:56:14
合計ジャッジ時間 20,362 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 343 ms
20,844 KB
testcase_01 AC 344 ms
20,428 KB
testcase_02 AC 347 ms
20,400 KB
testcase_03 AC 348 ms
20,728 KB
testcase_04 AC 346 ms
20,520 KB
testcase_05 AC 394 ms
34,556 KB
testcase_06 AC 396 ms
34,596 KB
testcase_07 AC 396 ms
34,740 KB
testcase_08 AC 274 ms
16,040 KB
testcase_09 AC 291 ms
18,616 KB
testcase_10 AC 389 ms
27,924 KB
testcase_11 AC 401 ms
34,456 KB
testcase_12 AC 272 ms
16,632 KB
testcase_13 AC 166 ms
12,056 KB
testcase_14 AC 327 ms
20,168 KB
testcase_15 AC 287 ms
17,588 KB
testcase_16 AC 158 ms
12,124 KB
testcase_17 AC 223 ms
15,032 KB
testcase_18 AC 183 ms
14,932 KB
testcase_19 AC 230 ms
13,944 KB
testcase_20 AC 333 ms
20,132 KB
testcase_21 AC 33 ms
8,664 KB
testcase_22 AC 224 ms
16,424 KB
testcase_23 AC 244 ms
16,256 KB
testcase_24 AC 163 ms
14,336 KB
testcase_25 AC 340 ms
20,128 KB
testcase_26 AC 261 ms
16,964 KB
testcase_27 AC 314 ms
19,044 KB
testcase_28 AC 298 ms
18,720 KB
testcase_29 AC 295 ms
18,692 KB
testcase_30 AC 153 ms
12,568 KB
testcase_31 AC 145 ms
11,800 KB
testcase_32 AC 128 ms
12,344 KB
testcase_33 AC 139 ms
12,344 KB
testcase_34 AC 284 ms
17,468 KB
testcase_35 AC 33 ms
8,752 KB
testcase_36 AC 278 ms
18,432 KB
testcase_37 AC 246 ms
16,880 KB
testcase_38 AC 66 ms
10,104 KB
testcase_39 AC 146 ms
13,148 KB
testcase_40 AC 123 ms
10,896 KB
testcase_41 AC 211 ms
13,484 KB
testcase_42 AC 4 ms
8,040 KB
testcase_43 AC 5 ms
8,000 KB
testcase_44 AC 4 ms
7,996 KB
testcase_45 AC 316 ms
20,620 KB
testcase_46 AC 315 ms
20,396 KB
testcase_47 AC 314 ms
20,648 KB
testcase_48 AC 308 ms
20,496 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i,n) for(int i=0;i<(lint)(n);i++)
#define REP(i,n) for(int i=1;i<=(lint)(n);i++)
#define all(V) V.begin(),V.end()
typedef long long lint;
typedef unsigned long long ulint;
typedef std::pair<int, int> P;
typedef std::pair<lint, lint> LP;
constexpr int INF = INT_MAX/2;
constexpr lint LINF = LLONG_MAX/2;
constexpr double eps = DBL_EPSILON;
constexpr double PI=3.141592653589793238462643383279;
template<class T>
class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
	if (lhs < rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
	if (lhs > rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
inline lint gcd(lint a, lint b) {
	while (b) {
		lint c = a;
		a = b; b = c % b;
	}
	return a;
}
inline lint lcm(lint a, lint b) {
	return a / gcd(a, b) * b;
}
bool isprime(lint n) {
	if (n == 1)return false;
	for (int i = 2; i * i <= n; i++) {
		if (n % i == 0)return false;
	}
	return true;
}
template<typename T>
T mypow(T a, lint b) {
	if (!b)return T(1);
	if (b & 1)return mypow(a, b - 1) * a;
	T memo = mypow(a, b >> 1);
	return memo * memo;
}
lint modpow(lint a, lint b, lint m) {
	if (!b)return 1;
	if (b & 1)return modpow(a, b - 1, m) * a % m;
	lint memo = modpow(a, b >> 1, m);
	return memo * memo % m;
}
template<typename T>
void printArray(std::vector<T>& vec) {
	rep(i, vec.size() - 1)std::cout << vec[i] << " ";
	std::cout << vec.back() << std::endl;
}
template<typename T>
void printArray(T l, T r) {
	T rprev = r;
	rprev--;
	for (T i = l; i != rprev; i++) {
		std::cout << *i << " ";
	}
	std::cout << *rprev << std::endl;
}
#line 3 "/Users/kaage/Desktop/ProgrammingWorkspace/library/graph/UnionFind.hpp"
class UnionFind {
protected:
	std::vector<int> par, rank, size;
public:
	UnionFind(unsigned int size) {
		par.resize(size); rank.resize(size, 0); this->size.resize(size, 1);
		rep(i, size) {
			par[i] = i;
		}
	}
	int find(int n) {
		if (par[n] == n)return n;
		return par[n] = find(par[n]);
	}
	void unite(int n, int m) {
		n = find(n);
		m = find(m);
		if (n == m)return;
		if (rank[n] < rank[m]) {
			par[n] = m;
			size[m] += size[n];
		}
		else {
			par[m] = n;
			size[n] += size[m];
			if (rank[n] == rank[m])rank[n]++;
		}
	}
	bool same(int n, int m) {
		return find(n) == find(m);
	}
	int getsize(int n) {
		return size[find(n)];
	}
};
#line 3 "/Users/kaage/Desktop/ProgrammingWorkspace/library/algebraic/ModInt.hpp"
class ModInt {
    lint value;
public:
    static const unsigned int modulo;
    ModInt() : value(0) {}
    template<typename T>
    ModInt(T value = 0) : value(value) {
        if (value < 0)value = -(lint)(-value % modulo) + modulo;
        this->value = value % modulo;
    }
    inline operator int()const { return value; }
    inline ModInt& operator+=(const ModInt& x) {
        value += x.value;
        if (value >= modulo)value -= modulo;
        return *this;
    }
    inline ModInt& operator++() {
        if (value == modulo - 1)value = 0;
        else value++;
        return *this;
    }
    inline ModInt operator-()const {
        return ModInt(0) -= *this;
    }
    inline ModInt& operator-=(const ModInt& x) {
        value -= x.value;
        if (value < 0)value += modulo;
        return *this;
    }
    inline ModInt& operator--() {
        if (value == 0)value = modulo - 1;
        else value--;
        return *this;
    }
    inline ModInt& operator*=(const ModInt& x) {
        value = value * x.value % modulo;
        return *this;
    }
    inline ModInt& operator/=(ModInt rhs) {
        int exp = modulo - 2;
        while (exp) {
            if (exp & 1)*this *= rhs;
            rhs *= rhs;
            exp >>= 1;
        }
        return *this;
    }
    template<typename T> ModInt operator+(const T& rhs)const { return ModInt(*this) += rhs; }
    template<typename T> ModInt& operator+=(const T& rhs) { return operator+=(ModInt(rhs)); }
    template<typename T> ModInt operator-(const T& rhs)const { return ModInt(*this) -= rhs; }
    template<typename T> ModInt& operator-=(const T& rhs) { return operator-=(ModInt(rhs)); }
    template<typename T> ModInt operator*(const T& rhs)const { return ModInt(*this) *= rhs; }
    template<typename T> ModInt& operator*=(const T& rhs) { return operator*=(ModInt(rhs)); }
    template<typename T> ModInt operator/(const T& rhs)const { return ModInt(*this) /= rhs; }
    template<typename T> ModInt& operator/=(const T& rhs) { return operator/=(ModInt(rhs)); }
};
std::istream& operator>>(std::istream& ist, ModInt& x) {
    lint a;
    ist >> a;
    x = a;
    return ist;
}
#line 4 "main.cpp"
const unsigned int ModInt::modulo=1000000007;
int n,m,x;
ModInt ans;
std::vector<std::pair<int,P>> vec;
std::vector<P> edges[200010];
bool used[200010];
int dfs(int node){
    used[node]=true;
    int cnt=1;
    for(const P& i:edges[node]){
        if(!used[i.first]){
            int s=dfs(i.first);
            ans+=mypow(ModInt(x),i.second)*s*(n-s);
            cnt+=s;
        }
    }
    return cnt;
}
int main(){
	std::cin>>n>>m>>x;
	rep(i,m){
        int a,b,c;
        std::cin>>a>>b>>c;
        vec.push_back({c,{a,b}});
	}
    UnionFind uf(n+1);
    for(const auto& i:vec){
        if(!uf.same(i.second.first,i.second.second)){
            uf.unite(i.second.first,i.second.second);
            edges[i.second.first].emplace_back(i.second.second,i.first);
            edges[i.second.second].emplace_back(i.second.first,i.first);
        }
    }
    dfs(1);
    std::cout<<ans<<std::endl;
}
0