結果
問題 | No.1639 最小通信路 |
ユーザー |
![]() |
提出日時 | 2021-08-06 21:47:24 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 13 ms / 2,000 ms |
コード長 | 4,032 bytes |
コンパイル時間 | 7,492 ms |
コンパイル使用メモリ | 393,672 KB |
最終ジャッジ日時 | 2025-01-23 15:01:11 |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 43 |
ソースコード
#include <bits/stdc++.h> #define REP_(i, a_, b_, a, b, ...) \ for (int i = (a), END_##i = (b); i < END_##i; ++i) #define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__) #define ALL(x) std::begin(x), std::end(x) using i64 = long long; #include <boost/multiprecision/cpp_int.hpp> // using i128 = boost::multiprecision::checked_int128_t; // using u128 = boost::multiprecision::checked_uint128_t; using Int = boost::multiprecision::checked_cpp_int; // using Rational = boost::multiprecision::checked_cpp_rational; namespace multip = boost::multiprecision; template<typename T, typename U> inline bool chmax(T &a, U b) { return a < b and ((a = std::move(b)), true); } template<typename T, typename U> inline bool chmin(T &a, U b) { return a > b and ((a = std::move(b)), true); } template<typename T> inline int ssize(const T &a) { return (int) std::size(a); } template<typename T> std::istream &operator>>(std::istream &is, std::vector<T> &a) { for (auto &x : a) is >> x; return is; } template<typename T, typename U> std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &a) { return os << "(" << a.first << ", " << a.second << ")"; } template<typename Container> std::ostream &print_seq(const Container &a, std::string_view sep = " ", std::string_view ends = "\n", std::ostream &os = std::cout) { auto b = std::begin(a), e = std::end(a); for (auto it = std::begin(a); it != e; ++it) { if (it != b) os << sep; os << *it; } return os << ends; } template<typename T, typename = void> struct is_iterable : std::false_type {}; template<typename T> struct is_iterable<T, std::void_t<decltype(std::begin(std::declval<T>())), decltype(std::end(std::declval<T>()))>> : std::true_type { }; template<typename T, typename = std::enable_if_t< is_iterable<T>::value && !std::is_same<T, std::string_view>::value && !std::is_same<T, std::string>::value>> std::ostream &operator<<(std::ostream &os, const T &a) { return print_seq(a, ", ", "", (os << "{")) << "}"; } void print() { std::cout << "\n"; } template<class T> void print(const T &x) { std::cout << x << "\n"; } template<typename Head, typename... Tail> void print(const Head &head, Tail... tail) { std::cout << head << " "; print(tail...); } void read_from_cin() {} template<typename T, typename... Ts> void read_from_cin(T &value, Ts &...args) { std::cin >> value; read_from_cin(args...); } #define INPUT(type, ...) \ type __VA_ARGS__; \ read_from_cin(__VA_ARGS__) #ifdef MY_DEBUG #include "debug_dump.hpp" #else #define DUMP(...) #endif using namespace std; struct UnionFind { int n; mutable std::vector<int> parent; // positive: parent, negative: size int num_roots; explicit UnionFind(int sz) : n(sz), parent(sz, -1), num_roots(sz) {} bool unite(int x, int y) { x = find(x), y = find(y); if (x == y) return false; if (-parent[x] < -parent[y]) std::swap(x, y); parent[x] += parent[y]; parent[y] = x; --num_roots; return true; } int find(int v) const { if (parent[v] < 0) return v; return parent[v] = find(parent[v]); } int size(int v) const { return -parent[find(v)]; } bool same(int x, int y) const { return find(x) == find(y); } std::vector<int> roots() const { std::vector<int> res; res.reserve(num_roots); for (int i = 0; i < n; ++i) { if (parent[i] < 0) res.push_back(i); } return res; } }; auto solve() { INPUT(int, n); const int m = n * (n - 1) / 2; UnionFind uf(n); Int max_cost = -1; REP(i, m) { INPUT(int, a, b); INPUT(Int, c); --a, --b; if (uf.same(a, b)) continue; uf.unite(a, b); chmax(max_cost, c); if (uf.num_roots == 1) break; } return max_cost; } int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr); cout << std::fixed << std::setprecision(15); int t = 1; REP(test_case, t) { auto ans = solve(); print(ans); } }