結果
問題 | No.1207 グラフX |
ユーザー | Mister |
提出日時 | 2020-08-30 16:20:38 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 221 ms / 2,000 ms |
コード長 | 4,477 bytes |
コンパイル時間 | 1,613 ms |
コンパイル使用メモリ | 90,960 KB |
実行使用メモリ | 25,604 KB |
最終ジャッジ日時 | 2023-08-09 15:04:40 |
合計ジャッジ時間 | 11,494 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 175 ms
17,880 KB |
testcase_01 | AC | 168 ms
18,120 KB |
testcase_02 | AC | 159 ms
17,988 KB |
testcase_03 | AC | 168 ms
17,912 KB |
testcase_04 | AC | 173 ms
17,880 KB |
testcase_05 | AC | 221 ms
25,200 KB |
testcase_06 | AC | 207 ms
25,080 KB |
testcase_07 | AC | 208 ms
25,380 KB |
testcase_08 | AC | 125 ms
11,748 KB |
testcase_09 | AC | 148 ms
15,060 KB |
testcase_10 | AC | 203 ms
20,908 KB |
testcase_11 | AC | 216 ms
25,604 KB |
testcase_12 | AC | 134 ms
12,496 KB |
testcase_13 | AC | 64 ms
5,344 KB |
testcase_14 | AC | 168 ms
17,212 KB |
testcase_15 | AC | 139 ms
13,704 KB |
testcase_16 | AC | 62 ms
6,264 KB |
testcase_17 | AC | 104 ms
10,900 KB |
testcase_18 | AC | 86 ms
11,636 KB |
testcase_19 | AC | 96 ms
7,996 KB |
testcase_20 | AC | 168 ms
17,548 KB |
testcase_21 | AC | 11 ms
4,380 KB |
testcase_22 | AC | 105 ms
11,172 KB |
testcase_23 | AC | 115 ms
12,564 KB |
testcase_24 | AC | 74 ms
10,444 KB |
testcase_25 | AC | 154 ms
17,516 KB |
testcase_26 | AC | 121 ms
13,512 KB |
testcase_27 | AC | 150 ms
15,528 KB |
testcase_28 | AC | 153 ms
15,180 KB |
testcase_29 | AC | 144 ms
15,660 KB |
testcase_30 | AC | 67 ms
7,916 KB |
testcase_31 | AC | 51 ms
4,572 KB |
testcase_32 | AC | 57 ms
8,476 KB |
testcase_33 | AC | 59 ms
8,072 KB |
testcase_34 | AC | 136 ms
13,412 KB |
testcase_35 | AC | 11 ms
4,380 KB |
testcase_36 | AC | 137 ms
14,460 KB |
testcase_37 | AC | 115 ms
11,516 KB |
testcase_38 | AC | 27 ms
5,380 KB |
testcase_39 | AC | 60 ms
9,064 KB |
testcase_40 | AC | 39 ms
4,376 KB |
testcase_41 | AC | 85 ms
8,524 KB |
testcase_42 | AC | 2 ms
4,380 KB |
testcase_43 | AC | 2 ms
4,384 KB |
testcase_44 | AC | 2 ms
4,376 KB |
testcase_45 | AC | 155 ms
17,948 KB |
testcase_46 | AC | 158 ms
18,048 KB |
testcase_47 | AC | 165 ms
17,928 KB |
testcase_48 | AC | 158 ms
18,020 KB |
ソースコード
#include <iostream> #include <numeric> #include <vector> template <int MOD> struct ModInt { using lint = long long; int val; // constructor ModInt(lint v = 0) : val(v % MOD) { if (val < 0) val += MOD; }; // unary operator ModInt operator+() const { return ModInt(val); } ModInt operator-() const { return ModInt(MOD - val); } ModInt inv() const { return this->pow(MOD - 2); } // arithmetic ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; } ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; } ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; } ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; } ModInt pow(lint n) const { auto x = ModInt(1); auto b = *this; while (n > 0) { if (n & 1) x *= b; n >>= 1; b *= b; } return x; } // compound assignment ModInt& operator+=(const ModInt& x) { if ((val += x.val) >= MOD) val -= MOD; return *this; } ModInt& operator-=(const ModInt& x) { if ((val -= x.val) < 0) val += MOD; return *this; } ModInt& operator*=(const ModInt& x) { val = lint(val) * x.val % MOD; return *this; } ModInt& operator/=(const ModInt& x) { return *this *= x.inv(); } // compare bool operator==(const ModInt& b) const { return val == b.val; } bool operator!=(const ModInt& b) const { return val != b.val; } bool operator<(const ModInt& b) const { return val < b.val; } bool operator<=(const ModInt& b) const { return val <= b.val; } bool operator>(const ModInt& b) const { return val > b.val; } bool operator>=(const ModInt& b) const { return val >= b.val; } // I/O friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept { lint v; is >> v; x = v; return is; } friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; } }; template <class Cost = int> struct Edge { int src, dst; Cost cost; Edge(int src = -1, int dst = -1, Cost cost = 1) : src(src), dst(dst), cost(cost){}; bool operator<(const Edge<Cost>& e) const { return this->cost < e.cost; } bool operator>(const Edge<Cost>& e) const { return this->cost > e.cost; } }; template <class Cost = int> struct Graph { std::vector<std::vector<Edge<Cost>>> graph; Graph(int n = 0) : graph(n) {} void span(bool direct, int src, int dst, Cost cost = 1) { graph[src].emplace_back(src, dst, cost); if (!direct) graph[dst].emplace_back(dst, src, cost); } int size() const { return graph.size(); } void clear() { graph.clear(); } void resize(int n) { graph.resize(n); } std::vector<Edge<Cost>>& operator[](int v) { return graph[v]; } std::vector<Edge<Cost>> operator[](int v) const { return graph[v]; } }; struct UnionFind { std::vector<int> par, sz; int gnum; explicit UnionFind(int n) : par(n), sz(n, 1), gnum(n) { std::iota(par.begin(), par.end(), 0); } int find(int v) { return (par[v] == v) ? v : (par[v] = find(par[v])); } void unite(int u, int v) { u = find(u), v = find(v); if (u == v) return; if (sz[u] < sz[v]) std::swap(u, v); sz[u] += sz[v]; par[v] = u; --gnum; } bool same(int u, int v) { return find(u) == find(v); } bool ispar(int v) { return v == find(v); } int size(int v) { return sz[find(v)]; } }; constexpr int MOD = 1000000007; using mint = ModInt<MOD>; void solve() { int n, m; mint x; std::cin >> n >> m >> x; Graph<int> graph(n); UnionFind uf(n); while (m--) { int u, v, w; std::cin >> u >> v >> w; if (uf.same(--u, --v)) continue; uf.unite(u, v); graph.span(false, u, v, w); } mint ans = 0; auto dfs = [&](auto f, int v, int p) -> int { int sz = 1; for (auto e : graph[v]) { int u = e.dst; if (u == p) continue; int csz = f(f, u, v); ans += x.pow(e.cost) * csz * (n - csz); sz += csz; } return sz; }; dfs(dfs, 0, -1); std::cout << ans << "\n"; } int main() { std::cin.tie(nullptr); std::ios::sync_with_stdio(false); solve(); return 0; }