結果

問題 No.1207 グラフX
ユーザー carrot46
提出日時 2020-08-30 13:19:44
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 379 ms / 2,000 ms
コード長 3,843 bytes
コンパイル時間 2,078 ms
コンパイル使用メモリ 178,156 KB
実行使用メモリ 37,660 KB
最終ジャッジ日時 2024-11-15 06:36:48
合計ジャッジ時間 15,843 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 46
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll N,M,H,W,Q,K,A,B;
string S;
typedef pair<ll, ll> P;
const ll INF = (1LL<<58);
template <unsigned long long mod > class modint{
public:
ll x;
constexpr modint(){x = 0;}
constexpr modint(ll _x) : x((_x < 0 ? ((_x += (LLONG_MAX / mod) * mod) < 0 ? _x + (LLONG_MAX / mod) * mod : _x) : _x)%mod){}
constexpr modint operator-(){
return x == 0 ? 0 : mod - x;
}
constexpr modint& operator+=(const modint& a){
if((x += a.x) >= mod) x -= mod;
return *this;
}
constexpr modint operator+(const modint& a) const{
return modint(*this) += a;
}
constexpr modint& operator-=(const modint& a){
if((x -= a.x) < 0) x += mod;
return *this;
}
constexpr modint operator-(const modint& a) const{
return modint(*this) -= a;
}
constexpr modint& operator*=(const modint& a){
(x *= a.x)%=mod;
return *this;
}
constexpr modint operator*(const modint& a) const{
return modint(*this) *= a;
}
constexpr modint pow(unsigned long long pw) const{
modint res(1), comp(*this);
while(pw){
if(pw&1) res *= comp;
comp *= comp;
pw >>= 1;
}
return res;
}
//mod
constexpr modint inv() const{
return modint(*this).pow(mod - 2);
}
constexpr modint& operator/=(const modint &a){
(x *= a.inv().x)%=mod;
return *this;
}
constexpr modint operator/(const modint &a) const{
return modint(*this) /= a;
}
};
#define mod1 998244353
#define mod2 1000000007
using mint = modint<mod2>;
ostream& operator<<(ostream& os, const mint& a){
os << a.x;
return os;
}
using vm = vector<mint>;
struct edge{
int to, cost;
edge(){}
edge(int a, int c){
to = a;
cost = c;
}
};
using ve = vector<edge>;
void dfs(int v, mint &ans, vector<ve> &G, vec &size){
size[v] = 1;
for(edge e : G[v]){
if(size[e.to] == -1){
dfs(e.to, ans, G, size);
ans += mint(K).pow(e.cost) * size[e.to] * (N - size[e.to]);
size[v] += size[e.to];
}
}
}
int main() {
class union_find{
vector<long> parent, tree_size;
public:
union_find(unsigned long _n) : parent(_n), tree_size(_n, 1){
for(unsigned long i = 0; i < _n; ++i)parent[i] = i;
}
ll find(ll x){
while(parent[x] != x)x = parent[x] = parent[parent[x]];
return x;
}
bool merge(ll a, ll b){
a = find(a);
b = find(b);
if(a==b) return false;
if(tree_size[a] < tree_size[b])swap(a, b);
tree_size[a] += tree_size[b];
parent[b] = a;
return true;
}
bool same(ll a, ll b){
a = find(a);
b = find(b);
return a == b;
}
};
//uf.merge使
//ufMAX_N+10-indexed
cin>>N>>M>>K;
union_find uf(N + 10);
vector<ve> G(N, ve(0));
rep(i, M){
int x, y, z;
cin>>x>>y>>z;
--x; --y;
if(uf.merge(x, y)){
G[x].emplace_back(y, z);
G[y].emplace_back(x, z);
}
}
mint ans(0);
vec size(N, -1);
dfs(0, ans, G, size);
cout<<ans<<endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0