結果

問題 No.1207 グラフX
ユーザー uchiiiiuchiiii
提出日時 2020-08-30 17:35:35
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 259 ms / 2,000 ms
コード長 5,645 bytes
コンパイル時間 3,163 ms
コンパイル使用メモリ 224,716 KB
実行使用メモリ 51,080 KB
最終ジャッジ日時 2023-08-09 17:26:38
合計ジャッジ時間 13,001 ms
ジャッジサーバーID
(参考情報)
judge12 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 186 ms
18,752 KB
testcase_01 AC 187 ms
18,828 KB
testcase_02 AC 184 ms
18,852 KB
testcase_03 AC 182 ms
18,840 KB
testcase_04 AC 179 ms
18,824 KB
testcase_05 AC 256 ms
51,080 KB
testcase_06 AC 256 ms
51,060 KB
testcase_07 AC 254 ms
50,968 KB
testcase_08 AC 145 ms
14,532 KB
testcase_09 AC 156 ms
17,220 KB
testcase_10 AC 245 ms
36,804 KB
testcase_11 AC 259 ms
50,964 KB
testcase_12 AC 139 ms
14,948 KB
testcase_13 AC 70 ms
10,104 KB
testcase_14 AC 175 ms
18,056 KB
testcase_15 AC 153 ms
15,880 KB
testcase_16 AC 72 ms
10,180 KB
testcase_17 AC 119 ms
13,848 KB
testcase_18 AC 101 ms
14,072 KB
testcase_19 AC 107 ms
11,796 KB
testcase_20 AC 177 ms
18,632 KB
testcase_21 AC 15 ms
8,180 KB
testcase_22 AC 120 ms
14,276 KB
testcase_23 AC 131 ms
14,804 KB
testcase_24 AC 86 ms
13,048 KB
testcase_25 AC 181 ms
18,264 KB
testcase_26 AC 143 ms
15,792 KB
testcase_27 AC 173 ms
17,172 KB
testcase_28 AC 159 ms
17,108 KB
testcase_29 AC 161 ms
17,064 KB
testcase_30 AC 86 ms
11,684 KB
testcase_31 AC 59 ms
9,548 KB
testcase_32 AC 69 ms
11,776 KB
testcase_33 AC 68 ms
11,540 KB
testcase_34 AC 145 ms
15,872 KB
testcase_35 AC 15 ms
8,264 KB
testcase_36 AC 150 ms
16,764 KB
testcase_37 AC 132 ms
14,248 KB
testcase_38 AC 35 ms
9,632 KB
testcase_39 AC 81 ms
12,596 KB
testcase_40 AC 45 ms
8,380 KB
testcase_41 AC 100 ms
12,256 KB
testcase_42 AC 5 ms
8,112 KB
testcase_43 AC 5 ms
8,088 KB
testcase_44 AC 5 ms
8,060 KB
testcase_45 AC 167 ms
18,952 KB
testcase_46 AC 169 ms
18,920 KB
testcase_47 AC 173 ms
19,388 KB
testcase_48 AC 174 ms
19,148 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define ALL(x) (x).begin(), (x).end()
constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1;
template<class T>vector<T> vec(int len, T elem) { return vector<T>(len, elem); } // auto dp = vec(52, vec(103, vec(103, INF)));
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
template<class T>inline int popcount(T a) {return __builtin_popcount(a);}
template<class T>inline T emod(T a, T p) { return (a%p + p) % p;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {os << '\n'; for (auto v : vec) os << v << ' '; os << '\n'; return os;}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
//-------------------

struct mint {
	ll x;
	mint(ll x=0):x(x%mod){}

	bool operator==(const mint a)const{return x==a.x;}
	bool operator!=(const mint a)const{return x!=a.x;}
	bool operator>=(const mint a){return (x >= a.x)? 1: 0;}
	bool operator<(const mint a){return !(*this>=a);}
	bool operator>(const mint a){return (x > a.x)? 1:0;}
	bool operator<=(const mint a){return !(*this>a);}
	mint& operator+=(const mint a) {
		if ((x += a.x) >= mod) x -= mod;
			return *this;
	}
	mint& operator-=(const mint a) {
		if ((x += mod-a.x) >= mod) x -= mod;
			return *this;
	}
	mint& operator*=(const mint a) {
		(x *= a.x) %= mod;
		return *this;
	}
	mint& operator/=(const mint a) {
		return (*this) *= a.inv();
	}
	mint operator+(const mint a) const {
		mint res(*this);
		return res+=a;
	}
	mint operator-(const mint a) const {
		mint res(*this);
		return res-=a;
	}
	mint operator*(const mint a) const {
		mint res(*this);
		return res*=a;
	}
	mint operator/(const mint a) const {
		mint res(*this);
		return res/=a;
	}
	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t>>1);
		a *= a;  //2 square
		if (t&1) a *= *this; 
		return a;
	}
	// for prime mod
	mint inv() const {
		return pow(mod-2);
	}
    friend ostream& operator<<(ostream& os, const mint& m){
        os << m.x;
        return os;
    }
};
class UnionFind {
private:
	unsigned size_; std::vector<int> par, rank; //par = root? -size: par 
public:
	UnionFind() : size_(0), par(std::vector<int>()), rank(std::vector<int>()) {};
	UnionFind(unsigned size__) : size_(size__) {
		par.resize(size_+1); rank.resize(size_+1);
		for (unsigned i = 0; i <= size_; i++) par[i] = -1, rank[i] = 0;
	}
	//unsigned size() { return size_; }
	unsigned root(unsigned x) {return par[x] < 0 ? x : par[x] = root(par[x]); }
	bool same(unsigned x, unsigned y) { return root(x) == root(y); }
	void unite(unsigned x, unsigned y) {
		x = root(x), y = root(y);
		if (x == y) return;
		if (rank[x] < rank[y])par[y] += par[x], par[x] = y;
		else if (rank[x] == rank[y])par[x] += par[y], par[y] = x, rank[x]++;
		else par[x] += par[y], par[y] = x;
	}
	int size(int x){ return -par[root(x)];} 
	bool operator==(const UnionFind &u) { return par == u.par; }
	bool operator!=(const UnionFind &u) { return par != u.par; }
};

constexpr int MX = 2e5+5;
vector<PLL> G[MX];
mint ans = 0;
ll n,m,x;
ll dfs(int c, int par) {
    ll res=0;
    for(auto [to, cost]: G[c]) {
        if(to==par) continue;
        ll cur = dfs(to, c);
        ans += mint(x).pow(cost) * (n - cur) * cur;
        // cout << cur << endl;
        res += cur; 
    }
    return res+1;
}


int main() {
    cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(15);
    cin >> n >> m >> x;
    UnionFind uf(n);
    rep(i, m) {
        int x1,y1; cin >> x1 >> y1;
        x1--; y1--;
        ll z; cin >> z;
        if(!uf.same(x1,y1)) {
            uf.unite(x1,y1);
            G[x1].emplace_back(y1, z);
            G[y1].emplace_back(x1, z);
        }
    }
    // rep(i, n) {
    //     cout << G[i] << endl;
    // }
    dfs(0, -1);
    cout << ans << endl;
    return 0;
}
0