結果
問題 | No.1207 グラフX |
ユーザー | sten_san |
提出日時 | 2023-04-22 19:43:44 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 189 ms / 2,000 ms |
コード長 | 3,559 bytes |
コンパイル時間 | 2,522 ms |
コンパイル使用メモリ | 213,804 KB |
実行使用メモリ | 23,936 KB |
最終ジャッジ日時 | 2024-04-24 22:24:36 |
合計ジャッジ時間 | 12,453 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 133 ms
17,352 KB |
testcase_01 | AC | 157 ms
17,484 KB |
testcase_02 | AC | 134 ms
17,380 KB |
testcase_03 | AC | 127 ms
17,364 KB |
testcase_04 | AC | 134 ms
17,492 KB |
testcase_05 | AC | 185 ms
23,680 KB |
testcase_06 | AC | 185 ms
23,936 KB |
testcase_07 | AC | 189 ms
23,936 KB |
testcase_08 | AC | 109 ms
11,428 KB |
testcase_09 | AC | 115 ms
13,880 KB |
testcase_10 | AC | 166 ms
20,352 KB |
testcase_11 | AC | 175 ms
23,808 KB |
testcase_12 | AC | 105 ms
12,360 KB |
testcase_13 | AC | 63 ms
5,504 KB |
testcase_14 | AC | 137 ms
16,740 KB |
testcase_15 | AC | 114 ms
13,504 KB |
testcase_16 | AC | 58 ms
6,144 KB |
testcase_17 | AC | 92 ms
11,012 KB |
testcase_18 | AC | 72 ms
11,180 KB |
testcase_19 | AC | 89 ms
8,192 KB |
testcase_20 | AC | 132 ms
17,024 KB |
testcase_21 | AC | 11 ms
5,376 KB |
testcase_22 | AC | 104 ms
11,008 KB |
testcase_23 | AC | 101 ms
12,408 KB |
testcase_24 | AC | 61 ms
10,316 KB |
testcase_25 | AC | 141 ms
16,852 KB |
testcase_26 | AC | 100 ms
13,336 KB |
testcase_27 | AC | 147 ms
15,276 KB |
testcase_28 | AC | 122 ms
13,940 KB |
testcase_29 | AC | 121 ms
15,132 KB |
testcase_30 | AC | 67 ms
7,808 KB |
testcase_31 | AC | 55 ms
5,376 KB |
testcase_32 | AC | 54 ms
8,444 KB |
testcase_33 | AC | 59 ms
8,064 KB |
testcase_34 | AC | 120 ms
13,364 KB |
testcase_35 | AC | 12 ms
5,376 KB |
testcase_36 | AC | 113 ms
13,928 KB |
testcase_37 | AC | 103 ms
11,456 KB |
testcase_38 | AC | 29 ms
5,376 KB |
testcase_39 | AC | 64 ms
8,732 KB |
testcase_40 | AC | 41 ms
5,376 KB |
testcase_41 | AC | 77 ms
8,192 KB |
testcase_42 | AC | 2 ms
5,376 KB |
testcase_43 | AC | 1 ms
5,376 KB |
testcase_44 | AC | 2 ms
5,376 KB |
testcase_45 | AC | 126 ms
17,476 KB |
testcase_46 | AC | 133 ms
17,220 KB |
testcase_47 | AC | 127 ms
17,348 KB |
testcase_48 | AC | 123 ms
17,348 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; struct iofast_t { iofast_t() { ios::sync_with_stdio(false); cin.tie(nullptr); } } iofast; struct uns_t {} uns; template <typename Element, typename Head, typename ...Args> auto vec(Element init, Head arg, Args ...args) { if constexpr (sizeof...(Args) == 0) return vector(arg, init); else return vector(arg, vec(init, args...)); } template <typename Element, typename Head, typename ...Args> auto vec(uns_t, Head arg, Args ...args) { return vec(Element(), arg, args...); } template <typename Container> auto distance(const Container &c, decltype(begin(c)) iter) { return distance(begin(c), iter); } template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>> auto isort(RIter first, RIter last, Compare comp = Compare()) { vector<int> i(distance(first, last)); iota(begin(i), end(i), 0); sort(begin(i), end(i), [&](auto x, auto y) { return comp(*(first + x), *(first + y)); }); return i; } template <typename, template <typename> typename, typename = void_t<>> struct detect : false_type {}; template <typename T, template <typename> typename Check> struct detect<T, Check, void_t<Check<T>>> : true_type {}; template <typename T, template <typename> typename Check> constexpr inline bool detect_v = detect<T, Check>::value; template <typename T> using has_member_sort = decltype(declval<T>().sort()); template <typename Container, typename Compare = less<typename Container::value_type>> auto sorted(Container c, Compare comp = Compare()) { if constexpr (detect_v<Container, has_member_sort>) { c.sort(comp); return c; } else { sort(begin(c), end(c), comp); return c; } } template <typename Container, typename Compare = equal_to<typename Container::value_type>> auto uniqued(Container c, Compare comp = Compare()) { c.erase(unique(begin(c), end(c), comp), end(c)); return c; } template <typename T, typename Compare = less<T>> T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); } template <typename T, typename Compare = less<T>> T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); } template <typename F> constexpr auto fix(F &&f) noexcept { return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable { return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...); }; } #include <atcoder/dsu> #include <atcoder/modint> using mint = atcoder::modint1000000007; int main() { int n, m, x; cin >> n >> m >> x; atcoder::dsu dsu(n); auto g = vec<array<int, 2>>(uns, n, 0); for (int i = 0; i < m; ++i) { int x, y, z; cin >> x >> y >> z; --x; --y; if (!dsu.same(x, y)) { g[x].push_back({ y, z }); g[y].push_back({ x, z }); dsu.merge(x, y); } } auto sub = vec<int>(uns, n); fix([&](auto f, int v, int p = -1) -> int { sub[v] = 1; for (auto [u, _] : g[v]) { if (u == p) { continue; } sub[v] += f(u, v); } return sub[v]; })(0); mint ans = 0; fix([&](auto f, int v, int p = -1, int z = -1) -> void { if (0 <= p) { ans += mint(x).pow(z) * sub[v] * (n - sub[v]); } for (auto [u, w] : g[v]) { if (u == p) { continue; } f(u, v, w); } })(0); cout << ans.val() << endl; }