結果
問題 | No.1207 グラフX |
ユーザー |
![]() |
提出日時 | 2020-08-30 14:24:02 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 350 ms / 2,000 ms |
コード長 | 4,719 bytes |
コンパイル時間 | 1,965 ms |
コンパイル使用メモリ | 132,204 KB |
最終ジャッジ日時 | 2025-01-13 21:48:03 |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 46 |
ソースコード
#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<complex>#include<bitset>#include<stack>#include<unordered_map>#include<utility>#include<tuple>#include<cassert>using namespace std;typedef long long ll;typedef unsigned int ui;const ll mod = 1000000007;const ll INF = (ll)1000000007 * 1000000007;#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 Per(i,sta,n) for(int i=n-1;i>=sta;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++)typedef long double ld;const ld eps = 1e-8;const ld pi = acos(-1.0);typedef pair<ll, ll> LP;int dx[4]={1,-1,0,0};int dy[4]={0,0,1,-1};struct UnionFind {private:vector<int> par,ran;vector<int> edge,size;int n;public:UnionFind(int x){n=x;par.resize(n,0);ran.resize(n,0);edge.resize(n,0);size.resize(n,1);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){edge[x]++;return;}if (ran[x]<ran[y]) {par[x]=y;size[y]+=size[x];edge[y]+=edge[x]+1;}else {par[y]=x;size[x]+=size[y];edge[x]+=edge[y]+1;if (ran[x]==ran[y])ran[x]++;}}bool same(int x,int y) {return find(x)==find(y);}int getSize(int x){return size[find(x)];}int getEdge(int x){return edge[find(x)];}};template<int mod>struct ModInt {long long x;ModInt() : x(0) {}ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}explicit operator int() const {return x;}ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}ModInt &operator*=(const ModInt &p) {x = (int)(1LL * x * p.x % mod);return *this;}ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}ModInt operator-() const { return ModInt(-x); }ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }bool operator==(const ModInt &p) const { return x == p.x; }bool operator!=(const ModInt &p) const { return x != p.x; }ModInt inverse() const{int a = x, b = mod, u = 1, v = 0, t;while(b > 0) {t = a / b;a -= t * b;swap(a, b);u -= t * v;swap(u, v);}return ModInt(u);}ModInt power(long long p) const{int a = x;if (p==0) return 1;if (p==1) return ModInt(a);if (p%2==1) return (ModInt(a)*ModInt(a)).power(p/2)*ModInt(a);else return (ModInt(a)*ModInt(a)).power(p/2);}ModInt power(const ModInt p) const{return ((ModInt)x).power(p.x);}friend ostream &operator<<(ostream &os, const ModInt<mod> &p) {return os << p.x;}friend istream &operator>>(istream &is, ModInt<mod> &a) {long long x;is >> x;a = ModInt<mod>(x);return (is);}};using modint = ModInt<mod>;typedef pair<int, modint> P;int n,m;modint x;vector<P> G[200010];int siz[200010];modint ans=0;void dfs(int s,int par){siz[s]=1;for(P p:G[s]){int t=p.first;modint z=p.second;if(t==par) continue;dfs(t,s);siz[s]+=siz[t];ans+=(modint)siz[t]*(modint)(n-siz[t])*z;}}void solve(){cin >> n >> m;cin >> x;UnionFind uf(n);rep(i,m){int a,b,c;cin >> a >> b >> c;a--;b--;if(uf.same(a,b)) continue;uf.unite(a,b);modint z=x.power(c);G[a].push_back(P(b,z));G[b].push_back(P(a,z));}dfs(0,-1);cout << ans << endl;}int main(){ios::sync_with_stdio(false);cin.tie(0);cout << fixed << setprecision(50);solve();}