結果
問題 | No.1293 2種類の道路 |
ユーザー | ir5 |
提出日時 | 2024-06-21 19:48:36 |
言語 | C++23(gcc13) (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 143 ms / 2,000 ms |
コード長 | 3,634 bytes |
コンパイル時間 | 1,825 ms |
コンパイル使用メモリ | 153,712 KB |
実行使用メモリ | 12,504 KB |
最終ジャッジ日時 | 2024-06-21 19:48:42 |
合計ジャッジ時間 | 5,639 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,944 KB |
testcase_02 | AC | 1 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 1 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,944 KB |
testcase_07 | AC | 1 ms
6,940 KB |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | AC | 130 ms
10,084 KB |
testcase_10 | AC | 126 ms
10,080 KB |
testcase_11 | AC | 143 ms
10,208 KB |
testcase_12 | AC | 127 ms
10,084 KB |
testcase_13 | AC | 128 ms
10,084 KB |
testcase_14 | AC | 91 ms
12,492 KB |
testcase_15 | AC | 90 ms
12,504 KB |
testcase_16 | AC | 111 ms
11,264 KB |
testcase_17 | AC | 125 ms
11,900 KB |
testcase_18 | AC | 73 ms
11,136 KB |
testcase_19 | AC | 69 ms
11,008 KB |
testcase_20 | AC | 72 ms
11,136 KB |
testcase_21 | AC | 80 ms
6,940 KB |
testcase_22 | AC | 88 ms
6,940 KB |
testcase_23 | AC | 78 ms
6,940 KB |
ソースコード
#include <algorithm> #include <cassert> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <iostream> #include <numeric> #include <vector> #include <map> #include <set> #include <queue> #include <functional> #include <iomanip> using namespace std; using ll = long long; class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n; public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}}; template<typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; } template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template<typename T> void take(vector<T>& vec, int n) { vec.resize(n); for (int i = 0; i < n; ++i) cin >> vec[i]; } #ifdef ONLINE_JUDGE #define dump(expr) ; #else #define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; } #endif struct UnionFindWithWeights { vector<int> data, weights; UnionFindWithWeights(int n) : data(n, -1), weights(n, 1) {} int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); } bool find(int x, int y) { return root(x) == root(y); } void uni(int x, int y) { x = root(x); y = root(y); if (x != y) { int new_weight = weights[x] + weights[y]; if (data[x] < data[y]) swap(x, y); data[x] += data[y]; data[y] = x; weights[x] = new_weight; } } int weight(int x) { return weights[root(x)]; } }; namespace solver { template<typename T1, typename T2> struct In2 { T1 a; T2 b; friend std::istream& operator>>(std::istream& is, In2& obj) { T1 t1; T2 t2; is >> t1 >> t2; obj = {t1, t2}; return is; } }; template<typename T1, typename T2, typename T3> struct In3 { T1 a; T2 b; T3 c; friend std::istream& operator>>(std::istream& is, In3& obj) { T1 t1; T2 t2; T3 t3; is >> t1 >> t2 >> t3; obj = {t1, t2, t3}; return is; } }; int n, m1, m2; vector<In2<int, int>> edges1; vector<In2<int, int>> edges2; void read() { cin >> n >> m1 >> m2; take(edges1, m1); take(edges2, m2); } using RetType = ll; RetType run() { UnionFindWithWeights uf1(n + 1), uf2(n + 1); for (auto e : edges1) uf1.uni(e.a, e.b); for (auto e : edges2) uf2.uni(e.a, e.b); vector<vector<int>> members1(n + 1); for (int i : range(1, n + 1)) { members1[uf1.root(i)].push_back(i); } ll res = 0; for (int i : range(1, n + 1)) { set<int> roots; for (int j : members1[i]) { int root = uf2.root(j); if (roots.count(root)) continue; roots.insert(root); dump(i << " " << uf2.weight(root) << " " << members1[i].size()); res += (ll)uf2.weight(root) * (ll)members1[i].size(); } } res -= n; return res; } } // namespace template <typename F> void run(F f) { if constexpr (std::is_same_v<decltype(f()), void>) f(); else cout << f() << endl; } int main(int argc, char** argv) { cerr << fixed << setprecision(12); cout << fixed << setprecision(12); int testcase = 1; if (argc > 1) testcase = atoi(argv[1]); while (testcase--) { solver::read(); } run(solver::run); }