#898382 (C++17) No.2403 "Eight" Bridges of Königsberg

• 問題: No.2403 "Eight" Bridges of Königsberg
• ユーザー: kaikey
• 提出日時: 2023-08-04 21:58:57
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 35 ms / 2,000 ms
• コード長: 7,110 bytes
• コンパイル時間: 2,680 ms
• コンパイル使用メモリ: 225,548 KB
• 実行使用メモリ: 9,088 KB
• 最終ジャッジ日時: 2024-11-26 17:47:45
• 合計ジャッジ時間: 4,067 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	16 ms; 5,248 KB
testcase_05	AC	29 ms; 5,248 KB
testcase_06	AC	33 ms; 5,248 KB
testcase_07	AC	19 ms; 5,248 KB
testcase_08	AC	23 ms; 5,248 KB
testcase_09	AC	35 ms; 5,248 KB
testcase_10	AC	31 ms; 5,248 KB
testcase_11	AC	25 ms; 5,248 KB
testcase_12	AC	33 ms; 5,248 KB
testcase_13	AC	24 ms; 5,248 KB
testcase_14	AC	2 ms; 5,248 KB
testcase_15	AC	2 ms; 5,248 KB
testcase_16	AC	2 ms; 5,248 KB
testcase_17	AC	2 ms; 5,248 KB
testcase_18	AC	2 ms; 5,248 KB
testcase_19	AC	7 ms; 9,088 KB
testcase_20	AC	3 ms; 5,248 KB
testcase_21	AC	5 ms; 6,272 KB
testcase_22	AC	6 ms; 8,448 KB
testcase_23	AC	6 ms; 8,320 KB
testcase_24	AC	5 ms; 7,424 KB
testcase_25	AC	5 ms; 7,168 KB
testcase_26	AC	2 ms; 5,248 KB
testcase_27	AC	7 ms; 8,704 KB
testcase_28	AC	6 ms; 7,680 KB
testcase_29	AC	3 ms; 5,248 KB
testcase_30	AC	4 ms; 5,504 KB
testcase_31	AC	7 ms; 8,832 KB
testcase_32	AC	3 ms; 5,248 KB
testcase_33	AC	4 ms; 5,248 KB
testcase_34	AC	4 ms; 5,248 KB

ソースコード

#include "bits/stdc++.h"
#include <random>
#include <chrono>
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;++i)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;--i)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define endk '\n'
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef double ld; typedef pair<lint, lint> plint; typedef pair<ld, ld> pld;
struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(30); }; } fast_ios_;
template<class T> auto add = [](T a, T b) -> T { return a + b; };
template<class T> auto mul = [](T a, T b) -> T { return a * b; };
template<class T> auto f_max = [](T a, T b) -> T { return max(a, b); };
template<class T> auto f_min = [](T a, T b) -> T { return min(a, b); };
template<class T> using V = vector<T>;
using Vl = V<lint>; using VVl = V<Vl>; using VVVl = V<V<Vl>>;
template< typename T > ostream& operator<<(ostream& os, const vector< T >& v) {
    for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 != v.size() ? " " : "");
    return os;
}
template< typename T >istream& operator>>(istream& is, vector< T >& v) {
    for (T& in : v) is >> in;
    return is;
}
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template <class T>
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}
template <class F> struct rec {
    F f;
    rec(F&& f_) : f(std::forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&... args) const {
        return f(*this, std::forward<Args>(args)...);
    }
};
lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); }
lint digit(lint a) { return (lint)log10(a); }
lint e_dist(plint a, plint b) { return abs(a.first - b.first) * abs(a.first - b.first) + abs(a.second - b.second) * abs(a.second - b.second); }
lint m_dist(plint a, plint b) { return abs(a.first - b.first) + abs(a.second - b.second); }
bool check_overflow(lint a, lint b, lint limit) { if (b == 0) return false; return a > limit / b; } // a * b > c => true
void Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); }
const long long MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 1e18;
lint dx[8] = { 0, 1, 0, -1, 1, -1, 1, -1 }, dy[8] = { 1, 0, -1, 0, -1, -1, 1, 1 };
bool YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endk; return flag; }
struct Edge {
    lint from, to;
    lint cost;
    Edge() {

    }
    Edge(lint u, lint v, lint c) {
        cost = c;
        from = u;
        to = v;
    }
    bool operator<(const Edge& e) const {
        return cost < e.cost;
    }
};
struct WeightedEdge {
    lint to;
    lint cost;
    WeightedEdge(lint v, lint c) {
        to = v;
        cost = c;
    }
    bool operator<(const WeightedEdge& e) const {
        return cost < e.cost;
    }
};
using WeightedGraph = V<V<WeightedEdge>>;
typedef pair<lint, plint> tlint;
typedef pair<ld, ld> pld;
typedef pair<plint, plint> qlint;
typedef pair<Edge, lint> pEd;
typedef pair<lint, Vl> vVl;
typedef pair<set<lint>, set<lint>> pset;

struct UnionFind {
public:
    UnionFind() : _n(0) {}
    UnionFind(int n) : _n(n), parent_or_size(n, -1) {}

    int merge(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        int x = leader(a), y = leader(b);
        if (x == y) return x;
        if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
        if (used_count) {
            if (count_in_set[x].size() < count_in_set[y].size()) {
                std::swap(count_in_set[x], count_in_set[y]);
            }
            for (auto p : count_in_set[y]) {
                count_in_set[x][p.first] += p.second;
            }
        }
        if (set_operate) {
            root_values[x] = f(root_values[y], root_values[x]);
        }
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;

        return x;
    }

    bool same(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        return leader(a) == leader(b);
    }

    int leader(int a) {
        assert(0 <= a && a < _n);
        if (parent_or_size[a] < 0) return a;
        return parent_or_size[a] = leader(parent_or_size[a]);
    }

    int size(int a) {
        assert(0 <= a && a < _n);
        return -parent_or_size[leader(a)];
    }

    std::vector<std::vector<int>> groups() {
        std::vector<int> leader_buf(_n), group_size(_n);
        for (int i = 0; i < _n; i++) {
            leader_buf[i] = leader(i);
            group_size[leader_buf[i]]++;
        }
        std::vector<std::vector<int>> result(_n);
        for (int i = 0; i < _n; i++) {
            result[i].reserve(group_size[i]);
        }
        for (int i = 0; i < _n; i++) {
            result[leader_buf[i]].push_back(i);
        }
        result.erase(
            std::remove_if(result.begin(), result.end(),
                [&](const std::vector<int>& v) { return v.empty(); }),
            result.end());
        return result;
    }
    //update root calc
    //set by set operations
    void set_operate_and_value(std::vector<lint> array, function<lint(lint, lint)> _f) {
        f = _f;
        root_values = array;
        set_operate = true;
    }
    lint get_set_value(int a) {
        return root_values[leader(a)];
    }

    //regist count
    void regist_count(int a, int label) {
        if (!used_count) {
            used_count = true;
            count_in_set.assign(_n, std::map<int, int>());
        }
        count_in_set[leader(a)][label]++;
    }

    int get_count(int a, int label) {
        if (!used_count) return -1;
        return count_in_set[leader(a)][label];
    }

private:
    int _n;
    std::vector<int> parent_or_size;
    std::vector<std::map<int, int>> count_in_set;
    bool used_count = false;
    std::vector<lint> root_values;
    function<lint(lint, lint)> f;
    bool set_operate = false;
};

int main() {
    lint N, M;
    cin >> N >> M;
    Vl ideg(N), odeg(N);
    UnionFind tree(N);
    Vl need(N), sum(N);
    REP(i, M) {
        lint u, v;
        cin >> u >> v; u--; v--;
        ideg[u]++;
        odeg[v]++;
        tree.merge(u, v);
        need[u] = 1;
        need[v] = 1;
    }

    lint ans = 0;
    set<lint> st;
    REP(i, N) {
        if (!need[i]) continue;
        sum[tree.leader(i)] += max(0ll, ideg[i] - odeg[i]);
        st.insert(tree.leader(i));
    }

    REP(i, N) {
        if (sum[i] == 0) continue;
        ans += max(0ll, sum[i] - 1);
    }
    ans += SZ(st) - 1;
    cout << ans << endk;
}