提出 #70444183

---

ソースコード 拡げる

#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector to(n, vector<int>());
	rep(i, m) {
		int u, v;
		cin >> u >> v;
		u--, v--;
		to[u].push_back(v);
		to[v].push_back(u);
	}
	string s; cin >> s;
	vector dp(n, vector<P>(2, { INF,-1 }));// dist,from
	queue<P>que;
	rep(i, n)if (s[i] == 'S') {
		dp[i][0] = { 0,i };
		que.push({ i,0 });
	}
	auto update = [&](int dist, int from, int v)->void {
		if (dp[v][0].second == from)return;
		if (dp[v][1].second == from)return;
		if (dp[v][0].first == INF) {
			dp[v][0] = { dist,from };
			que.push({ v,0 });
		}
		else if (dp[v][1].first == INF) {
			dp[v][1] = { dist,from };
			que.push({ v,1 });
		}
	};
	while (!que.empty()) {
		auto[v, idx] = que.front();
		que.pop();
		auto[dist, from] = dp[v][idx];
		for (auto nv : to[v]) {
			update(dist + 1, from, nv);
		}
	}
	rep(i, n) if (s[i] == 'D') {
		auto[d0, f0] = dp[i][0];
		auto[d1, f1] = dp[i][1];
		//	cout << d0 << " " << f0 << " " << d1 << " " << f1 << endl;
		int ans = d0 + d1;
		cout << ans << endl;
	}
	return 0;
}

提出情報

ジャッジ結果