結果
問題 | No.1207 グラフX |
ユーザー | suta28407928 |
提出日時 | 2020-08-30 13:32:00 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 242 ms / 2,000 ms |
コード長 | 4,321 bytes |
コンパイル時間 | 1,740 ms |
コンパイル使用メモリ | 119,464 KB |
実行使用メモリ | 46,256 KB |
最終ジャッジ日時 | 2023-08-09 11:50:49 |
合計ジャッジ時間 | 11,167 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 178 ms
26,552 KB |
testcase_01 | AC | 177 ms
26,752 KB |
testcase_02 | AC | 178 ms
26,564 KB |
testcase_03 | AC | 175 ms
26,744 KB |
testcase_04 | AC | 176 ms
26,552 KB |
testcase_05 | AC | 240 ms
46,244 KB |
testcase_06 | AC | 234 ms
46,252 KB |
testcase_07 | AC | 242 ms
46,256 KB |
testcase_08 | AC | 123 ms
19,196 KB |
testcase_09 | AC | 136 ms
22,808 KB |
testcase_10 | AC | 220 ms
37,788 KB |
testcase_11 | AC | 229 ms
46,212 KB |
testcase_12 | AC | 129 ms
19,876 KB |
testcase_13 | AC | 70 ms
9,840 KB |
testcase_14 | AC | 172 ms
25,564 KB |
testcase_15 | AC | 142 ms
21,388 KB |
testcase_16 | AC | 68 ms
10,556 KB |
testcase_17 | AC | 104 ms
17,068 KB |
testcase_18 | AC | 86 ms
16,744 KB |
testcase_19 | AC | 108 ms
14,412 KB |
testcase_20 | AC | 171 ms
26,084 KB |
testcase_21 | AC | 12 ms
4,380 KB |
testcase_22 | AC | 111 ms
17,412 KB |
testcase_23 | AC | 114 ms
19,008 KB |
testcase_24 | AC | 77 ms
14,688 KB |
testcase_25 | AC | 168 ms
25,764 KB |
testcase_26 | AC | 130 ms
20,472 KB |
testcase_27 | AC | 159 ms
23,968 KB |
testcase_28 | AC | 143 ms
22,860 KB |
testcase_29 | AC | 152 ms
23,344 KB |
testcase_30 | AC | 71 ms
12,132 KB |
testcase_31 | AC | 58 ms
8,524 KB |
testcase_32 | AC | 58 ms
11,948 KB |
testcase_33 | AC | 65 ms
11,896 KB |
testcase_34 | AC | 143 ms
20,976 KB |
testcase_35 | AC | 13 ms
4,380 KB |
testcase_36 | AC | 143 ms
22,236 KB |
testcase_37 | AC | 116 ms
18,096 KB |
testcase_38 | AC | 29 ms
7,164 KB |
testcase_39 | AC | 64 ms
13,268 KB |
testcase_40 | AC | 46 ms
6,848 KB |
testcase_41 | AC | 91 ms
14,364 KB |
testcase_42 | AC | 2 ms
4,384 KB |
testcase_43 | AC | 1 ms
4,384 KB |
testcase_44 | AC | 1 ms
4,380 KB |
testcase_45 | AC | 166 ms
26,716 KB |
testcase_46 | AC | 172 ms
26,440 KB |
testcase_47 | AC | 165 ms
26,452 KB |
testcase_48 | AC | 177 ms
26,444 KB |
ソースコード
#include <iostream> #include <string> #include <cstdlib> #include <cmath> #include <vector> #include <unordered_map> #include <map> #include <set> #include <algorithm> #include <queue> #include <stack> #include <functional> #include <bitset> #include <assert.h> #include <unordered_map> #include <fstream> #include <ctime> #include <complex> using namespace std; typedef long long ll; typedef vector<ll> vl; typedef vector<vl> vvl; typedef vector<char> vc; typedef vector<string> vs; typedef vector<bool> vb; typedef vector<double> vd; typedef pair<ll,ll> P; typedef pair<int,int> pii; typedef vector<P> vpl; typedef tuple<ll,ll,ll> tapu; #define rep(i,n) for(int i=0; i<(n); i++) #define REP(i,a,b) for(int i=(a); i<(b); i++) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() const int inf = 1<<30; const ll linf = 1LL<<62; const int MAX = 1020000; ll dy[8] = {1,-1,0,0,1,-1,1,-1}; ll dx[8] = {0,0,1,-1,1,-1,-1,1}; const double pi = acos(-1); const double eps = 1e-7; template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){ if(a>b){ a = b; return true; } else return false; } template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){ if(a<b){ a = b; return true; } else return false; } template<typename T> inline void print(T &a){ rep(i,a.size()) cout << a[i] << " "; cout << "\n"; } template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";} template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){ cout << a << " " << b << " " << c << "\n"; } ll pcount(ll x) {return __builtin_popcountll(x);} const int mod = 1e9 + 7; //const int mod = 998244353; template <std::uint_fast64_t Modulus> class modint { using u64 = std::uint_fast64_t; public: u64 a; constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {} constexpr u64 &value() noexcept { return a; } constexpr const u64 &value() const noexcept { return a; } constexpr modint operator+(const modint rhs) const noexcept { return modint(*this) += rhs; } constexpr modint operator-(const modint rhs) const noexcept { return modint(*this) -= rhs; } constexpr modint operator*(const modint rhs) const noexcept { return modint(*this) *= rhs; } constexpr modint operator/(const modint rhs) const noexcept { return modint(*this) /= rhs; } constexpr modint &operator+=(const modint rhs) noexcept { a += rhs.a; if (a >= Modulus) { a -= Modulus; } return *this; } constexpr modint &operator-=(const modint rhs) noexcept { if (a < rhs.a) { a += Modulus; } a -= rhs.a; return *this; } constexpr modint &operator*=(const modint rhs) noexcept { a = a * rhs.a % Modulus; return *this; } constexpr modint &operator/=(modint rhs) noexcept { u64 exp = Modulus - 2; while (exp) { if (exp % 2) { *this *= rhs; } rhs *= rhs; exp /= 2; } return *this; } }; using mint = modint<mod>; ll modpow(ll x, ll n, ll mod){ ll res = 1; while(n > 0){ if(n & 1) res = res * x % mod; x = x * x % mod; n >>= 1; } return res; } struct UnionFind{ vl p; vl rank; vl cnt; UnionFind(ll n){ rank.resize(n,0); p.resize(n,0); cnt.resize(n,0); rep(i,n){ p[i] = i; rank[i] = 0; cnt[i] = 1; } } ll find(ll x){ if(x != p[x]) p[x] = find(p[x]); return p[x]; } bool same(ll x, ll y){ return find(x) == find(y); } void unite(ll x, ll y){ x = find(x); y = find(y); if(x == y) return; if(rank[x] > rank[y]){ p[y] = x; cnt[x] += cnt[y]; }else{ p[x] = y; cnt[y] += cnt[x]; if(rank[x] == rank[y]) rank[y]++; } } ll size(ll x){ return cnt[find(x)]; } }; int main(){ ll n,m,x; cin >> n >> m >> x; vector<tapu> edge(m); rep(i,m){ ll x,y,z; scanf("%lld%lld%lld",&x,&y,&z); x--; y--; edge[i] = tie(z,x,y); } sort(all(edge)); UnionFind uf(n); vector<vpl> G(n); rep(i,m){ ll x,y,z; tie(z,x,y) = edge[i]; if(uf.same(x,y)) continue; uf.unite(x,y); G[x].emplace_back(y,z); G[y].emplace_back(x,z); } mint ans = 0; function<ll(ll,ll)> dfs = [&](ll u, ll p) -> ll { ll res = 1; for(auto v : G[u]){ if(v.first == p) continue; ll df = dfs(v.first,u); res += df; mint tmp = df * (n - df); ans += tmp * modpow(x,v.second,mod); } return res; }; dfs(0,-1); cout << ans.value() << "\n"; }