結果
問題 |
No.3291 K-step Navigation
|
ユーザー |
|
提出日時 | 2025-10-04 16:43:06 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,171 bytes |
コンパイル時間 | 4,984 ms |
コンパイル使用メモリ | 335,116 KB |
実行使用メモリ | 7,716 KB |
最終ジャッジ日時 | 2025-10-04 16:43:14 |
合計ジャッジ時間 | 7,217 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 45 WA * 6 |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> using namespace std; using namespace atcoder; istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; } ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); } istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; } ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); } istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; } ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } typedef long long ll; typedef vector<vector<int>> Graph; typedef pair<int, int> pii; typedef pair<ll, ll> pll; #define FOR(i,l,r) for (int i = l;i < (int)(r); i++) #define rep(i,n) for (int i = 0;i < (int)(n); i++) #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define my_sort(x) sort(x.begin(), x.end()) #define my_max(x) *max_element(all(x)) #define my_min(x) *min_element(all(x)) template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } const int INF = (1<<30) - 1; const ll LINF = (1LL<<62) - 1; const int MOD = 998244353; const int MOD2 = 1e9+7; const double PI = acos(-1); vector<int> di = {1,0,-1,0}; vector<int> dj = {0,1,0,-1}; #ifdef LOCAL # include <debug_print.hpp> # define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else # define debug(...) (static_cast<void>(0)) #endif vector<ll> bfs(int st, Graph &g){ int N = g.size(); queue<int> que; que.push(st); vector<ll> dist(N,LINF); dist[st] = 0; while(!que.empty()){ auto now = que.front();que.pop(); for(auto nxt : g[now]){ if (dist[nxt] != LINF)continue; dist[nxt] = dist[now] + 1; que.push(nxt); } } return dist; } int main(){ cin.tie(0); ios_base::sync_with_stdio(false); ll N, M, K, s, t; cin >> N >> M >> K >> s >> t; s--, t--; vector<int> u(M), v(M); Graph g(N); rep(i, M) { cin >> u[i] >> v[i]; u[i]--; v[i]--; g[u[i]].push_back(v[i]); g[v[i]].push_back(u[i]); } if (K & 1){ cout << "Yes" << endl; return 0; } if(g[s].empty() && g[t].empty()){ cout << "No" << endl; return 0; } if(g[s].size() > 1 && g[t].size() > 1){ cout << "Yes" << endl; return 0; } if((!g[s].empty() && g[s][0] != t) || (!g[t].empty() && g[t][0] != s)){ cout << "Yes" << endl; return 0; } assert(g[s][0] == t); assert(g[t][0] == s); ll L = LINF; rep(v, N){ if(v == s || v == t) continue; vector<ll> dist = bfs(v, g); vector<int> f(N + 1); rep(i, N) { if(dist[i] > N) continue; f[dist[i]] += 1; } rep(d, N + 1){ if(f[d] >= 2) { chmin(L, (ll)d); } } } cout << (K - 3 >= 2 * L + 1 ? "Yes" : "No") << endl; }