結果
問題 | No.1207 グラフX |
ユーザー |
|
提出日時 | 2020-08-30 13:24:42 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 900 ms / 2,000 ms |
コード長 | 3,385 bytes |
コンパイル時間 | 3,748 ms |
コンパイル使用メモリ | 210,388 KB |
最終ジャッジ日時 | 2025-01-13 21:08:31 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 46 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for(long long i=0;i<(long long)(n);i++)#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)#define all(a) a.begin(),a.end()#define pb emplace_back#define eb emplace_back#define lb(v,k) (lower_bound(all(v),k)-v.begin())#define ub(v,k) (upper_bound(all(v),k)-v.begin())#define fi first#define se second#define pi M_PI#define PQ(T) priority_queue<T>#define SPQ(T) priority_queue<T,vector<T>,greater<T>>#define dame(a) {out(a);return 0;}#define decimal cout<<fixed<<setprecision(15);#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}typedef long long ll;typedef pair<ll,ll> P;typedef tuple<ll,ll,ll> PP;typedef tuple<ll,ll,ll,ll> PPP;typedef multiset<ll> S;using vi=vector<ll>;using vvi=vector<vi>;using vvvi=vector<vvi>;using vvvvi=vector<vvvi>;using vp=vector<P>;using vvp=vector<vp>;using vb=vector<bool>;using vvb=vector<vb>;const ll inf=1001001001001001001;const ll INF=1001001001;const ll mod=1000000007;const double eps=1e-10;template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}template<class T> void out(T a){cout<<a<<'\n';}template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}template<class T> void yesno(T b){if(b)out("yes");else out("no");}template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}template<class T> void noyes(T b){if(b)out("no");else out("yes");}template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}vi parent,rankk,sz;void init(ll n){parent=vi(n);rankk=vi(n);sz=vi(n,1);rep(i,n)parent[i]=i;}ll root(ll i){if(parent[i]==i)return i;return root(parent[i]);}ll getsize(ll i){return sz[root(i)];}bool same(ll a,ll b){return root(a)==root(b);}bool heigou(ll x,ll y){x=root(x);y=root(y);if(x==y)return false;if(rankk[x]<rankk[y]){parent[x]=y;sz[y]+=sz[x];}else{parent[y]=x;sz[x]+=sz[y];}if(rankk[x]==rankk[y])rankk[x]++;return true;}vvp g;ll ans=0;vi s;ll n,m,k;void dfs(int i,int p,ll t){for(auto x:g[i])if(x.fi!=p){dfs(x.fi,i,x.se);s[i]+=s[x.fi];}if(i!=0)ans=(ans+s[i]*(n-s[i])%mod*modpow(k,t))%mod;}int main(){cin>>n>>m>>k;init(n);s=vi(n,1);g=vvp(n);vector<PP> hen(m);rep(i,m){ll a,b,c;cin>>a>>b>>c;a--;b--;hen[i]=PP(c,a,b);}sort(all(hen));rep(i,m){ll a,b,c;tie(c,a,b)=hen[i];if(heigou(a,b)){g[a].pb(b,c);g[b].pb(a,c);}}dfs(0,-1,0);out(ans);}