結果
問題 | No.2200 Weird Shortest Path |
ユーザー | 👑 OnjoujiToki |
提出日時 | 2023-02-07 04:29:17 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 213 ms / 2,000 ms |
コード長 | 4,572 bytes |
コンパイル時間 | 2,616 ms |
コンパイル使用メモリ | 135,920 KB |
実行使用メモリ | 7,168 KB |
最終ジャッジ日時 | 2023-09-18 13:37:05 |
合計ジャッジ時間 | 17,715 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 3 ms
4,376 KB |
testcase_05 | AC | 2 ms
4,376 KB |
testcase_06 | AC | 1 ms
4,376 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 3 ms
4,380 KB |
testcase_09 | AC | 2 ms
4,376 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 2 ms
4,380 KB |
testcase_12 | AC | 1 ms
4,376 KB |
testcase_13 | AC | 2 ms
4,376 KB |
testcase_14 | AC | 1 ms
4,376 KB |
testcase_15 | AC | 2 ms
4,376 KB |
testcase_16 | AC | 2 ms
4,380 KB |
testcase_17 | AC | 64 ms
4,380 KB |
testcase_18 | AC | 112 ms
5,452 KB |
testcase_19 | AC | 195 ms
6,540 KB |
testcase_20 | AC | 186 ms
6,552 KB |
testcase_21 | AC | 72 ms
4,652 KB |
testcase_22 | AC | 102 ms
4,836 KB |
testcase_23 | AC | 199 ms
6,692 KB |
testcase_24 | AC | 34 ms
4,380 KB |
testcase_25 | AC | 191 ms
6,488 KB |
testcase_26 | AC | 198 ms
6,736 KB |
testcase_27 | AC | 68 ms
4,580 KB |
testcase_28 | AC | 148 ms
5,628 KB |
testcase_29 | AC | 199 ms
6,620 KB |
testcase_30 | AC | 198 ms
6,324 KB |
testcase_31 | AC | 121 ms
5,492 KB |
testcase_32 | AC | 201 ms
7,056 KB |
testcase_33 | AC | 202 ms
7,004 KB |
testcase_34 | AC | 201 ms
6,948 KB |
testcase_35 | AC | 201 ms
6,840 KB |
testcase_36 | AC | 202 ms
6,936 KB |
testcase_37 | AC | 202 ms
6,840 KB |
testcase_38 | AC | 201 ms
7,168 KB |
testcase_39 | AC | 101 ms
5,356 KB |
testcase_40 | AC | 151 ms
6,848 KB |
testcase_41 | AC | 90 ms
5,376 KB |
testcase_42 | AC | 141 ms
6,872 KB |
testcase_43 | AC | 212 ms
6,848 KB |
testcase_44 | AC | 213 ms
6,948 KB |
testcase_45 | AC | 213 ms
7,072 KB |
ソースコード
/* 💕💕💕💕💕 💗💗💗💗💗 /)/) ( . .) ( づ💗 💗💗💗 💗💗💗 💗💗💗💗💗💗💗💗💗 💗💗💗💗💗💗💗💗💗 💗💗💗💗💗💗💗 💗💗💗💗💗 💗💗💗 💗 */ #include <algorithm> #include <array> #include <bitset> #include <cassert> #include <chrono> #include <cmath> #include <complex> #include <cstdint> #include <cstring> #include <ctime> #include <deque> #include <iomanip> #include <iostream> #include <map> #include <numeric> #include <queue> #include <set> #include <unordered_map> #include <unordered_set> #include <vector> template <int mod> struct ModInt { int x; ModInt() : x(0) {} ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} ModInt &operator+=(const ModInt &p) { if ((x += p.x) >= mod) x -= mod; return *this; } ModInt &operator-=(const ModInt &p) { if ((x += mod - p.x) >= mod) x -= mod; return *this; } ModInt &operator*=(const ModInt &p) { x = (int)(1LL * x * p.x % mod); return *this; } ModInt &operator/=(const ModInt &p) { *this *= p.inverse(); return *this; } ModInt &operator^=(long long p) { // quick_pow here:3 ModInt res = 1; for (; p; p >>= 1) { if (p & 1) res *= *this; *this *= *this; } return *this = res; } ModInt operator-() const { return ModInt(-x); } ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; } ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; } ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; } ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; } ModInt operator^(long long p) const { return ModInt(*this) ^= p; } bool operator==(const ModInt &p) const { return x == p.x; } bool operator!=(const ModInt &p) const { return x != p.x; } explicit operator int() const { return x; } // added by QCFium ModInt operator=(const int p) { x = p; return ModInt(*this); } // added by QCFium ModInt inverse() const { int a = x, b = mod, u = 1, v = 0, t; while (b > 0) { t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); } return ModInt(u); } friend std::ostream &operator<<(std::ostream &os, const ModInt<mod> &p) { return os << p.x; } friend std::istream &operator>>(std::istream &is, ModInt<mod> &a) { long long x; is >> x; a = ModInt<mod>(x); return (is); } }; using mint = ModInt<1000000007>; const int MOD = 1000000007; struct MComb { std::vector<mint> fact; std::vector<mint> inversed; MComb(int n) { // O(n+log(mod)) fact = std::vector<mint>(n + 1, 1); for (int i = 1; i <= n; i++) fact[i] = fact[i - 1] * mint(i); inversed = std::vector<mint>(n + 1); inversed[n] = fact[n] ^ (MOD - 2); for (int i = n - 1; i >= 0; i--) inversed[i] = inversed[i + 1] * mint(i + 1); } mint ncr(int n, int r) { if (n < r) return 0; return (fact[n] * inversed[r] * inversed[n - r]); } mint npr(int n, int r) { return (fact[n] * inversed[n - r]); } mint nhr(int n, int r) { assert(n + r - 1 < (int)fact.size()); return ncr(n + r - 1, r); } }; mint ncr(int n, int r) { mint res = 1; for (int i = n - r + 1; i <= n; i++) res *= i; for (int i = 1; i <= r; i++) res /= i; return res; } /* mint res = (mint(2) ^ n) - 1 - ncr(n, a) - ncr(n, b); std::cout << res << std::endl; */ template <typename T> struct DSU { std::vector<T> f, siz; DSU(int n) : f(n), siz(n, 1) { std::iota(f.begin(), f.end(), 0); } T leader(T x) { while (x != f[x]) x = f[x] = f[f[x]]; return x; } bool same(T x, T y) { return leader(x) == leader(y); } bool merge(T x, T y) { x = leader(x); y = leader(y); if (x == y) return false; siz[x] += siz[y]; f[y] = x; return true; } T size(int x) { return siz[leader(x)]; } }; void solve() { int n, m; std::cin >> n >> m; DSU<int> dsu(n); std::vector<std::tuple<long long, int, int>> edges(m); for (int i = 0; i < m; i++) { int u, v; long long w; std::cin >> u >> v >> w; u--, v--; edges[i] = {w, u, v}; } long long ans = 0; std::sort(edges.begin(), edges.end()); for (auto [w, u, v] : edges) { if (dsu.same(u, v)) continue; ans += w * dsu.size(u) * dsu.size(v); dsu.merge(u, v); } std::cout << ans << '\n'; } int main() { int t = 1; // std::cout << std::boolalpha; // std::cin >> t; while (t--) solve(); return 0; }