提出 #70442586

---

ソースコード 拡げる

#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = std::forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = std::forward<U>(y), true); }

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

using namespace std;

using ll = long long;

constexpr int INF = 1e9;

void solve() {
    int N, M;
    cin >> N >> M;
    vector<vector<int>> G(N);
    for (; M--;) {
        int U, V;
        cin >> U >> V;
        U--, V--;
        G[U].emplace_back(V);
        G[V].emplace_back(U);
    }
    string S;
    cin >> S;

    vector dp(N, vector<pair<int, int>>(2, {INF, -1}));
    priority_queue<tuple<int, int, int, int>> pq;
    for (int i = 0; i < N; i++) {
        if (S[i] == 'S') {
            dp[i][0] = {0, i};
            pq.emplace(-dp[i][0].first, dp[i][0].second, i, 0);
        }
    }
    while (not pq.empty()) {
        auto [val, pre, v, p] = pq.top();
        pq.pop();
        val *= -1;
        if (dp[v][p].first != val or dp[v][p].second != pre) {
            continue;
        }
        int nval = val + 1;
        for (int u : G[v]) {
            if (nval <= dp[u][0].first) {
                if (dp[u][0].second == pre) {
                    if (dp[u][0].first == nval) {
                        continue;
                    }
                    dp[u][0] = {nval, pre};
                    pq.emplace(-nval, pre, u, 0);
                } else {
                    dp[u][1] = dp[u][0];
                    dp[u][0] = {nval, pre};
                    pq.emplace(-dp[u][1].first, dp[u][1].second, u, 1);
                    pq.emplace(-nval, pre, u, 0);
                }
            } else if (dp[u][0].second != pre and nval < dp[u][1].first) {
                dp[u][1] = {nval, pre};
                pq.emplace(-nval, pre, u, 1);
            }
        }
    }

    for (int i = 0; i < N; i++) {
        if (S[i] == 'D') {
            int ans = dp[i][0].first + dp[i][1].first;
            cout << ans << "\n";
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    solve();
    return 0;
}

提出情報

ジャッジ結果