結果

問題 No.1293 2種類の道路
ユーザー kcvlexkcvlex
提出日時 2020-11-20 22:09:44
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 111 ms / 2,000 ms
コード長 7,188 bytes
コンパイル時間 1,928 ms
コンパイル使用メモリ 160,588 KB
実行使用メモリ 22,864 KB
最終ジャッジ日時 2024-07-23 13:06:46
合計ジャッジ時間 3,996 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 2 ms
6,944 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 106 ms
22,776 KB
testcase_10 AC 104 ms
22,752 KB
testcase_11 AC 105 ms
22,700 KB
testcase_12 AC 103 ms
22,864 KB
testcase_13 AC 111 ms
22,744 KB
testcase_14 AC 81 ms
19,200 KB
testcase_15 AC 72 ms
19,328 KB
testcase_16 AC 77 ms
21,596 KB
testcase_17 AC 74 ms
21,384 KB
testcase_18 AC 50 ms
17,088 KB
testcase_19 AC 52 ms
16,088 KB
testcase_20 AC 54 ms
16,064 KB
testcase_21 AC 38 ms
10,880 KB
testcase_22 AC 39 ms
10,880 KB
testcase_23 AC 38 ms
11,264 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#include <variant>

#define endl codeforces

#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)

using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
using size_type = ssize_t;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }

template <typename T, std::size_t Head, std::size_t... Tail> 
struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };

template <typename T, std::size_t Head> 
struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };

template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;

template <typename T, typename F, typename... Args> 
void fill_seq(T &t, F f, Args... args) { 
    if constexpr (std::is_invocable<F, Args...>::value) { 
        t = f(args...); 
    } else { 
        for (size_type i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); 
    } 
}

template <typename T> vec<T> make_v(size_type sz) { return vec<T>(sz); }

template <typename T, typename... Tail> 
auto make_v(size_type hs, Tail&&... ts) { 
    auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); 
    return vec<decltype(v)>(hs, v); 
}

namespace init__ { 
struct InitIO { 
    InitIO() { 
        std::cin.tie(nullptr); 
        std::ios_base::sync_with_stdio(false); 
        std::cout << std::fixed << std::setprecision(30); 
    } 
} init_io; 
}

template <typename T>
T ceil_pow2(T bound) {
    T ret = 1;
    while (ret < bound) ret *= 2;
    return ret;
}

template <typename T>
T ceil_div(T a, T b) { return a / b + !!(a % b); }



namespace graph {

using Node = ll;
using Weight = ll;
using Edge = std::pair<Node, Weight>;

template <bool Directed>
struct Graph : public vvec<Edge> {
    using vvec<Edge>::vvec;

    void add_edge(Node f, Node t, Weight w = 1) {
        (*this)[f].emplace_back(t, w);
        if (!Directed) (*this)[t].emplace_back(f, w);
    }

    Graph<Directed> build_inv() const {
        Graph<Directed> ret(this->size());
        for (Node i = 0; i < this->size(); i++) {
            for (const Edge &e : (*this)[i]) {
                Node j;
                Weight w;
                std::tie(j, w) = e;
                if (!Directed && j < i) continue;
                ret.add_edge(j, i, w);
            }
        }

        return ret;
    }
};

template <typename Iterator>
class dst_iterator {
    Iterator ite;

public:
    dst_iterator(Iterator ite) : ite(ite) { }

    bool operator ==(const dst_iterator<Iterator> &oth) const {
        return ite == oth.ite;
    }

    bool operator !=(const dst_iterator<Iterator> &oth) const {
        return !(*this == oth);
    }

    bool operator <(const dst_iterator<Iterator> &oth) const {
        return ite < oth.ite;
    }

    bool operator >(const dst_iterator<Iterator> &oth) const {
        return ite > oth.ite;
    }

    bool operator <=(const dst_iterator<Iterator> &oth) const {
        return ite <= oth.ite;
    }

    bool operator >=(const dst_iterator<Iterator> &oth) const {
        return ite >= oth.ite;
    }

    const Node& operator *() {
        return ite->first;
    }

    const Node& operator *() const {
        return ite->first;
    }

    dst_iterator operator ++() {
        ++ite;
        return ite;
    }
};

class dst_iteration {
    using ite_type = vec<Edge>::const_iterator;
    const vec<Edge> &edges;

public:
    dst_iteration(const vec<Edge> &edges) : edges(edges) { }

    auto begin() const {
        return dst_iterator<ite_type>(edges.cbegin());
    }

    auto end() const {
        return dst_iterator<ite_type>(edges.cend());
    }
};

class dst_reverse_iteration {
    using ite_type = vec<Edge>::const_reverse_iterator;
    const vec<Edge> &edges;

public:
    dst_reverse_iteration(const vec<Edge> &edges) : edges(edges) { }

    auto begin() const {
        return dst_iterator<ite_type>(edges.crbegin());
    }

    auto end() const {
        return dst_iterator<ite_type>(edges.crend());
    }
};

dst_iteration dst(const vec<Edge> &edges) {
    return dst_iteration(edges);
}

dst_reverse_iteration rdst(const vec<Edge> &edges) {
    return dst_reverse_iteration(edges);
}

}

struct DisjointSetUnion {
    vvec<ll> set;
    vec<ll> id;

    DisjointSetUnion(ll n) : set(n), id(n) {
        for (ll i = 0; i < n; i++) {
            set[i].push_back(i);
            id[i] = i;
        }
    }

    void unit(ll x, ll y) {
        ll px = id[x], py = id[y];
        if (px == py) return;
        if (set[px].size() < set[py].size()) std::swap(px, py);
        for (ll e : set[py]) {
            set[px].push_back(e);
            id[e] = px;
        }
        set[py].clear();
    }
};

int main() {
    ll n, d, w;
    std::cin >> n >> d >> w;
    vec<pll> e1(d), e2(w);

    auto scan = [&](vec<pll> &v) {
        for (auto &[ u, v ] : v) {
            std::cin >> u >> v;
            u--; v--;
        }
    };

    scan(e1); scan(e2);

    graph::Graph<false> g(n);
    for (auto [ u, v ] : e1) g.add_edge(u, v);

    DisjointSetUnion dsu(n);
    for (auto [ u, v ] : e2) dsu.unit(u, v);

    ll ans = 0;
    vec<bool> used(n, false);
    vec<ll> used_id(n, -1);
    for (ll i = 0; i < n; i++) {
        if (used[i]) continue;
        std::queue<ll> que;
        que.push(i);
        used[i] = true;
        ll cnt1 = 0, cnt2 = 0;
        while (que.size()) {
            ll c = que.front();
            cnt1++;
            que.pop();
            ll id = dsu.id[c];
            if (used_id[id] != i) {
                used_id[id] = i;
                cnt2 += dsu.set[id].size();
            }
            for (ll nxt : graph::dst(g[c])) if (!used[nxt]) {
                used[nxt] = true;
                que.push(nxt);
            }
        }
        ans += cnt1 * cnt2;
    }

    ans -= n;
    std::cout << ans << "\n";
    return 0;
}
0