結果
問題 | No.1207 グラフX |
ユーザー | chocopuu |
提出日時 | 2020-08-30 13:26:35 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 425 ms / 2,000 ms |
コード長 | 4,513 bytes |
コンパイル時間 | 3,728 ms |
コンパイル使用メモリ | 210,500 KB |
実行使用メモリ | 47,880 KB |
最終ジャッジ日時 | 2023-08-09 11:47:55 |
合計ジャッジ時間 | 18,935 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 359 ms
22,180 KB |
testcase_01 | AC | 358 ms
21,860 KB |
testcase_02 | AC | 348 ms
22,404 KB |
testcase_03 | AC | 348 ms
21,864 KB |
testcase_04 | AC | 352 ms
22,636 KB |
testcase_05 | AC | 417 ms
47,828 KB |
testcase_06 | AC | 418 ms
47,848 KB |
testcase_07 | AC | 419 ms
47,860 KB |
testcase_08 | AC | 291 ms
14,328 KB |
testcase_09 | AC | 312 ms
17,684 KB |
testcase_10 | AC | 409 ms
36,464 KB |
testcase_11 | AC | 425 ms
47,880 KB |
testcase_12 | AC | 291 ms
15,752 KB |
testcase_13 | AC | 168 ms
6,232 KB |
testcase_14 | AC | 346 ms
20,976 KB |
testcase_15 | AC | 312 ms
16,740 KB |
testcase_16 | AC | 164 ms
7,312 KB |
testcase_17 | AC | 244 ms
13,544 KB |
testcase_18 | AC | 192 ms
13,692 KB |
testcase_19 | AC | 247 ms
9,848 KB |
testcase_20 | AC | 355 ms
21,692 KB |
testcase_21 | AC | 29 ms
4,376 KB |
testcase_22 | AC | 235 ms
13,580 KB |
testcase_23 | AC | 255 ms
15,292 KB |
testcase_24 | AC | 165 ms
12,308 KB |
testcase_25 | AC | 348 ms
21,268 KB |
testcase_26 | AC | 272 ms
16,584 KB |
testcase_27 | AC | 329 ms
19,472 KB |
testcase_28 | AC | 313 ms
17,644 KB |
testcase_29 | AC | 303 ms
18,964 KB |
testcase_30 | AC | 163 ms
9,504 KB |
testcase_31 | AC | 145 ms
5,416 KB |
testcase_32 | AC | 131 ms
10,056 KB |
testcase_33 | AC | 143 ms
9,724 KB |
testcase_34 | AC | 300 ms
16,784 KB |
testcase_35 | AC | 31 ms
4,376 KB |
testcase_36 | AC | 297 ms
17,356 KB |
testcase_37 | AC | 260 ms
14,696 KB |
testcase_38 | AC | 67 ms
5,820 KB |
testcase_39 | AC | 152 ms
10,456 KB |
testcase_40 | AC | 118 ms
4,380 KB |
testcase_41 | AC | 225 ms
10,204 KB |
testcase_42 | AC | 1 ms
4,376 KB |
testcase_43 | AC | 1 ms
4,380 KB |
testcase_44 | AC | 1 ms
4,380 KB |
testcase_45 | AC | 327 ms
21,932 KB |
testcase_46 | AC | 322 ms
21,664 KB |
testcase_47 | AC | 326 ms
21,748 KB |
testcase_48 | AC | 323 ms
21,936 KB |
ソースコード
#include "bits/stdc++.h" using namespace std; #define int long long #define REP(i, n) for (int i = 0; i < (int)n; ++i) #define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i) #define FOR(i, s, n) for (int i = s; i < (int)n; ++i) #define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i) #define ALL(a) a.begin(), a.end() #define IN(a, x, b) (a <= x && x < b) template<class T>istream&operator >>(istream&is,vector<T>&vec){for(T&x:vec)is>>x;return is;} template<class T>inline void out(T t){cout << t << "\n";} template<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << " ";out(ts...);} template<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;} template<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;} constexpr int INF = 1e18; template<int MOD> struct Fp { long long val; constexpr Fp(long long v = 0) noexcept : val(v % MOD) { if (val < 0) val += MOD; } constexpr int getmod() { return MOD; } constexpr Fp operator - () const noexcept { return val ? MOD - val : 0; } constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; } constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; } constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; } constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; } constexpr Fp& operator += (const Fp& r) noexcept { val += r.val; if (val >= MOD) val -= MOD; return *this; } constexpr Fp& operator -= (const Fp& r) noexcept { val -= r.val; if (val < 0) val += MOD; return *this; } constexpr Fp& operator *= (const Fp& r) noexcept { val = val * r.val % MOD; return *this; } constexpr Fp& operator /= (const Fp& r) noexcept { long long a = r.val, b = MOD, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } val = val * u % MOD; if (val < 0) val += MOD; return *this; } constexpr bool operator == (const Fp& r) const noexcept { return this->val == r.val; } constexpr bool operator != (const Fp& r) const noexcept { return this->val != r.val; } friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept { return os << x.val; } friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept { if (n == 0) return 1; auto t = modpow(a, n / 2); t = t * t; if (n & 1) t = t * a; return t; } }; template<class T> struct BiCoef { vector<T> fact_, inv_, finv_; constexpr BiCoef() {} constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) { init(n); } constexpr void init(int n) noexcept { fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1); int MOD = fact_[0].getmod(); for(int i = 2; i < n; i++){ fact_[i] = fact_[i-1] * i; inv_[i] = -inv_[MOD%i] * (MOD/i); finv_[i] = finv_[i-1] * inv_[i]; } } constexpr T com(int n, int k) const noexcept { if (n < k || n < 0 || k < 0) return 0; return fact_[n] * finv_[k] * finv_[n-k]; } constexpr T P(int n, int k) const noexcept { if (n < k || n < 0 || k < 0) return 0; return fact_[n] * finv_[n-k]; } constexpr T fact(int n) const noexcept { if (n < 0) return 0; return fact_[n]; } constexpr T inv(int n) const noexcept { if (n < 0) return 0; return inv_[n]; } constexpr T finv(int n) const noexcept { if (n < 0) return 0; return finv_[n]; } }; const int MOD = 1000000007; // const int MOD = 998244353; using mint = Fp<MOD>; BiCoef<mint> bc; // bc.init(500050); struct UF{ vector<int>par,sz; void init(int n){ par.resize(n); sz.resize(n); for(int i=0;i<n;i++){ par[i]=i; sz[i]=1; } } int find(int x){ return x==par[x]?x:par[x]=find(par[x]); } void unite(int x,int y){ x=find(x);y=find(y); if(x==y)return; sz[x]+=sz[y]; par[y]=x; } bool same(int x,int y){ return find(x)==find(y); } int size(int x){ return sz[find(x)]; } }; signed main(){ int N, M, X; cin >> N >> M >> X; UF uf; uf.init(N); vector<vector<pair<int,int>>>g(N); REP(i, M) { int x, y, z; cin >> x >> y >> z; --x; --y; if(!uf.same(x, y)) { uf.unite(x, y); g[x].emplace_back(y, z); g[y].emplace_back(x, z); } } vector<int>sz(N, 1); mint ans = 0; auto dfs = [&](auto&&f, int now, int par) -> int { //out(now); for(auto[to, cost]: g[now]) { if(to == par) continue; sz[now] += f(f, to, now); ans += modpow((mint)X, cost) * sz[to] * (N - sz[to]); } return sz[now]; }; dfs(dfs, 0, -1); out(ans); }