#1150234 (C++23) No.3463 Beltway

• 問題: No.3463 Beltway
• ユーザー: だれ
• 提出日時: 2026-02-28 14:31:05
• 言語: C++23 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 193 ms / 2,000 ms
• コード長: 9,549 bytes
• コンパイル時間: 6,283 ms
• コンパイル使用メモリ: 340,072 KB
• 実行使用メモリ: 26,128 KB
• 最終ジャッジ日時: 2026-02-28 15:51:22
• 合計ジャッジ時間: 8,627 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

ファイルパターン	結果
sample	AC * 1
other	AC * 17

ソースコード

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_set>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
namespace atcoder {
ostream& operator<<(ostream& os, modint x) { return os << x.val(); }
template <int N>
ostream& operator<<(ostream& os, static_modint<N> x) {
    return os << x.val();
}
istream& operator>>(istream& is, modint x) {
    long long a;
    is >> a;
    x = a;
    return is;
}
template <int N>
istream& operator>>(istream& is, static_modint<N> x) {
    long long a;
    is >> a;
    x = a;
    return is;
}
}  // namespace atcoder
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define UNIQUE(x)                      \
    std::sort((x).begin(), (x).end()); \
    (x).erase(std::unique((x).begin(), (x).end()), (x).end())
using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned int;
using i32 = int;
using ld = long double;
using f64 = double;
template <class T, class U>
bool chmin(T& a, const U& b) {
    return (b < a) ? (a = b, true) : false;
}
template <class T, class U>
bool chmax(T& a, const U& b) {
    return (b > a) ? (a = b, true) : false;
}
template <class T = std::string, class U = std::string>
inline void YesNo(bool f = 0, const T yes = "Yes", const U no = "No") {
    if (f)
        std::cout << yes << "\n";
    else
        std::cout << no << "\n";
}
namespace io {

template <class T, class U>
istream& operator>>(istream& i, pair<T, U>& p) {
    i >> p.first >> p.second;
    return i;
}

template <class T, class U>
ostream& operator<<(ostream& o, pair<T, U>& p) {
    o << p.first << " " << p.second;
    return o;
}

template <typename T>
istream& operator>>(istream& i, vector<T>& v) {
    rep(j, v.size()) i >> v[j];
    return i;
}
template <typename T>
string join(vector<T>& v) {
    stringstream s;
    rep(i, v.size()) s << ' ' << v[i];
    return s.str().substr(1);
}
template <typename T>
ostream& operator<<(ostream& o, vector<T>& v) {
    if (v.size()) o << join(v);
    return o;
}
template <typename T>
string join(vector<vector<T>>& vv) {
    string s = "\n";
    rep(i, vv.size()) s += join(vv[i]) + "\n";
    return s;
}
template <typename T>
ostream& operator<<(ostream& o, vector<vector<T>>& vv) {
    if (vv.size()) o << join(vv);
    return o;
}

void OUT() { std::cout << "\n"; }

template <class Head, class... Tail>
void OUT(Head&& head, Tail&&... tail) {
    std::cout << head;
    if (sizeof...(tail)) std::cout << ' ';
    OUT(std::forward<Tail>(tail)...);
}

void OUTL() { std::cout << std::endl; }

template <class Head, class... Tail>
void OUTL(Head&& head, Tail&&... tail) {
    std::cout << head;
    if (sizeof...(tail)) std::cout << ' ';
    OUTL(std::forward<Tail>(tail)...);
}

void IN() {}

template <class Head, class... Tail>
void IN(Head&& head, Tail&&... tail) {
    cin >> head;
    IN(std::forward<Tail>(tail)...);
}

}  // namespace io
using namespace io;

namespace useful {
long long modpow(long long a, long long b, long long mod) {
    long long res = 1;
    while (b) {
        if (b & 1) res *= a, res %= mod;
        a *= a;
        a %= mod;
        b >>= 1;
    }
    return res;
}

bool is_pow2(long long x) { return x > 0 && (x & (x - 1)) == 0; }

template <class T>
void rearrange(vector<T>& a, vector<int>& p) {
    vector<T> b = a;
    for (int i = 0; i < int(a.size()); i++) {
        a[i] = b[p[i]];
    }
    return;
}

template <std::forward_iterator I>
std::vector<std::pair<typename std::iterator_traits<I>::value_type, int>>
run_length_encoding(I s, I t) {
    if (s == t) return {};
    std::vector<std::pair<typename std::iterator_traits<I>::value_type, int>>
        res;
    res.emplace_back(*s, 1);
    for (auto it = ++s; it != t; it++) {
        if (*it == res.back().first)
            res.back().second++;
        else
            res.emplace_back(*it, 1);
    }
    return res;
}

vector<int> linear_sieve(int n) {
    vector<int> primes;
    vector<int> res(n + 1);
    iota(all(res), 0);
    for (int i = 2; i <= n; i++) {
        if (res[i] == i) primes.emplace_back(i);
        for (auto j : primes) {
            if (j * i > n) break;
            res[j * i] = j;
        }
    }
    return res;
    // return primes;
}

template <class T>
vector<long long> dijkstra(vector<vector<pair<int, T>>>& graph, int start) {
    int n = graph.size();
    vector<long long> res(n, 2e18);
    res[start] = 0;
    priority_queue<pair<long long, int>, vector<pair<long long, int>>,
                   greater<pair<long long, int>>>
        que;
    que.push({0, start});
    while (!que.empty()) {
        auto [c, v] = que.top();
        que.pop();
        if (res[v] < c) continue;
        for (auto [nxt, cost] : graph[v]) {
            auto x = c + cost;
            if (x < res[nxt]) {
                res[nxt] = x;
                que.push({x, nxt});
            }
        }
    }
    return res;
}

}  // namespace useful
using namespace useful;

template <class T, T l, T r>
struct RandomIntGenerator {
    std::random_device seed;
    std::mt19937_64 engine;
    std::uniform_int_distribution<T> uid;

    RandomIntGenerator() {
        engine = std::mt19937_64(seed());
        uid = std::uniform_int_distribution<T>(l, r);
    }

    T gen() { return uid(engine); }
};

#include <algorithm>
#include <vector>

struct IncrementalBridgeConnectivity {
    struct UnionFind {
        vector<int> par;
        UnionFind() {}
        UnionFind(int n) : par(n, -1) {}

        int find(int x) {
            if (par[x] < 0) return x;
            return par[x] = find(par[x]);
        }

        void merge(int a, int b) {
            a = find(a);
            b = find(b);
            if (a == b) return;
            if (par[a] > par[b]) swap(a, b);
            par[a] += par[b];
            par[b] = a;
            return;
        }

        bool same(int a, int b) { return find(a) == find(b); }

        int size(int x) { return -par[find(x)]; }

        vector<vector<int>> groups() {
            vector<vector<int>> res(par.size());
            for (int i = 0; i < (int)par.size(); i++) {
                res[find(i)].emplace_back(i);
            }
            res.erase(remove_if(res.begin(), res.end(),
                                [](const vector<int>& v) { return v.empty(); }),
                      res.end());
            return res;
        }
    };

    UnionFind cc, bcc;
    vector<int> par;
    IncrementalBridgeConnectivity() {}
    IncrementalBridgeConnectivity(int n) : cc(n), bcc(n), par(n, -1) {}

    int lca(int a, int b) {
        unordered_set<int> visited;
        while (true) {
            if (a >= 0) {
                if (visited.contains(a)) return a;
                visited.emplace(a);
                a = par[a];
            }
            swap(a, b);
        }
    }

    void reverse_path(int v) {
        if (par[v] < 0) return;
        reverse_path(par[v]);
        par[par[v]] = v;
    }

    void compress_path(int v, int l) {
        while (v != l) {
            bcc.merge(v, par[v]);
            v = par[v];
        }
    }

    void add_edge(int u, int v) {
        if (bcc.same(u, v)) return;
        if (cc.same(u, v)) {
            int l = lca(u, v);
            compress_path(u, l);
            compress_path(v, l);
        } else {
            if (cc.size(u) < cc.size(v)) swap(u, v);
            reverse_path(v);
            par[v] = u;
            cc.merge(u, v);
        }
    }

    bool connected(int u, int v) { return cc.same(u, v); }

    bool bridge_connected(int u, int v) { return bcc.same(u, v); }

    vector<vector<int>> bc_groups() { return bcc.groups(); }
};

int main() {
    std::cout << fixed << setprecision(15);
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, m, s, d;
    IN(n, m, s, d);
    s--, d--;
    IncrementalBridgeConnectivity IBC(n);
    vector<vector<int>> g(n);
    rep(i, m) {
        int a, b;
        IN(a, b);
        a--, b--;
        g[a].emplace_back(b);
        g[b].emplace_back(a);
        IBC.add_edge(a, b);
    }
    vector<int> dist(n, 1e8);
    dist[s] = 0;
    queue<int> que;
    que.emplace(s);
    while (que.size()) {
        auto v = que.front();
        que.pop();
        for (auto j : g[v]) {
            if (chmin(dist[j], dist[v] + 1)) que.emplace(j);
        }
    }
    vector<int> dist2(n, 1e8);
    dist2[d] = 0;
    que.emplace(d);
    while (que.size()) {
        auto v = que.front();
        que.pop();
        for (auto j : g[v]) {
            if (chmin(dist2[j], dist2[v] + 1)) que.emplace(j);
        }
    }
    vector<int> p(n);
    iota(all(p), 0);
    sort(all(p), [&](int i, int j) { return dist[i] < dist[j]; });
    vector<int> dp(n, -1);
    dp[s] = 0;
    for (int i : p) {
        for (auto j : g[i]) {
            if (dist[j] != dist[i] - 1) continue;
            if (dist[j] + 1 + dist2[i] != dist[d]) continue;
            if (IBC.bridge_connected(i, j))
                chmax(dp[i], dp[j] + 1);
            else
                chmax(dp[i], dp[j]);
        }
    }
    OUT(dp[d]);
}