結果
問題 | No.2674 k-Walk on Bipartite |
ユーザー | binap |
提出日時 | 2024-03-15 22:12:23 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 363 ms / 2,000 ms |
コード長 | 3,768 bytes |
コンパイル時間 | 5,031 ms |
コンパイル使用メモリ | 280,968 KB |
実行使用メモリ | 29,936 KB |
最終ジャッジ日時 | 2024-03-15 22:12:43 |
合計ジャッジ時間 | 10,105 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,676 KB |
testcase_01 | AC | 2 ms
6,676 KB |
testcase_02 | AC | 2 ms
6,676 KB |
testcase_03 | AC | 2 ms
6,676 KB |
testcase_04 | AC | 2 ms
6,676 KB |
testcase_05 | AC | 2 ms
6,676 KB |
testcase_06 | AC | 1 ms
6,676 KB |
testcase_07 | AC | 170 ms
23,460 KB |
testcase_08 | AC | 290 ms
22,688 KB |
testcase_09 | AC | 138 ms
23,804 KB |
testcase_10 | AC | 326 ms
25,876 KB |
testcase_11 | AC | 195 ms
19,792 KB |
testcase_12 | AC | 363 ms
24,880 KB |
testcase_13 | AC | 131 ms
20,604 KB |
testcase_14 | AC | 34 ms
13,768 KB |
testcase_15 | AC | 350 ms
28,348 KB |
testcase_16 | AC | 216 ms
24,944 KB |
testcase_17 | AC | 242 ms
22,148 KB |
testcase_18 | AC | 82 ms
15,404 KB |
testcase_19 | AC | 168 ms
22,452 KB |
testcase_20 | AC | 143 ms
22,688 KB |
testcase_21 | AC | 288 ms
24,228 KB |
testcase_22 | AC | 348 ms
29,936 KB |
testcase_23 | AC | 2 ms
6,676 KB |
testcase_24 | AC | 2 ms
6,676 KB |
testcase_25 | AC | 2 ms
6,676 KB |
testcase_26 | AC | 2 ms
6,676 KB |
testcase_27 | AC | 2 ms
6,676 KB |
testcase_28 | AC | 2 ms
6,676 KB |
testcase_29 | AC | 2 ms
6,676 KB |
testcase_30 | AC | 2 ms
6,676 KB |
testcase_31 | AC | 2 ms
6,676 KB |
testcase_32 | AC | 2 ms
6,676 KB |
testcase_33 | AC | 2 ms
6,676 KB |
testcase_34 | AC | 2 ms
6,676 KB |
testcase_35 | AC | 2 ms
6,676 KB |
testcase_36 | AC | 2 ms
6,676 KB |
testcase_37 | AC | 2 ms
6,676 KB |
testcase_38 | AC | 2 ms
6,676 KB |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> #define rep(i,n) for(int i=0;i<n;i++) using namespace std; using namespace atcoder; typedef long long ll; typedef vector<int> vi; typedef vector<long long> vl; typedef vector<vector<int>> vvi; typedef vector<vector<long long>> vvl; typedef long double ld; typedef pair<int, int> P; ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;} template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;} template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;} template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;} template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;} template<typename T> void chmin(T& a, T b){a = min(a, b);} template<typename T> void chmax(T& a, T b){a = max(a, b);} template<typename T> struct Edge_Dijkstra{ int from, to; T cost; Edge_Dijkstra(int from, int to, T cost) : from(from), to(to), cost(cost) {}; }; const int INF = 1001001001; template<typename T> struct Dijkstra{ int n, m; vector<bool> initialized; vector<Edge_Dijkstra<T>> E; vector<vector<int>> G; map<int, vector<T>> dist; map<int, vector<int>> idx; Dijkstra(int _n) : n(_n), m(0), initialized(n, false), G(n){} void add_edge(int from, int to, T cost){ Edge_Dijkstra e(from, to, cost); E.push_back(e); G[from].emplace_back(m); m++; } void calc(int s){ initialized[s] = true; dist[s] = vector<T>(n, INF); idx[s] = vector<int>(n, -1); priority_queue<tuple<T, int, int>, vector<tuple<T, int, int>>, greater<tuple<T, int, int>>> pq; pq.emplace(0, s, -1); while(pq.size()){ auto [cost, from, index] = pq.top(); pq.pop(); if(dist[s][from] <= cost) continue; dist[s][from] = cost; idx[s][from] = index; for(int index : G[from]){ int to = E[index].to; T cost_plus = E[index].cost; if(dist[s][to] <= cost + cost_plus) continue; pq.emplace(cost + cost_plus, to, index); } } } int farthest(int s){ if(!initialized[s]) calc(s); int idx = 0; rep(i, n) if(dist[s][i] > dist[s][idx]) idx = i; return idx; } T get_dist(int s, int t){ if(!initialized[s]) calc(s); return dist[s][t]; } vi restore(int s, int t){ if(!initialized[s]) calc(s); if(dist[s][t] == INF) return vi(0); vi res; while(idx[s][t] != -1){ auto e = E[idx[s][t]]; res.push_back(idx[s][t]); t = e.from; } reverse(res.begin(), res.end()); return res; } }; int main(){ int n, m; cin >> n >> m; int s, t, k; cin >> s >> t >> k; s--; t--; vvi G(n); Dijkstra<int> graph(n); rep(i, m){ int u, v; cin >> u >> v; u--; v--; graph.add_edge(u, v, 1); graph.add_edge(v, u, 1); G[u].push_back(v); G[v].push_back(u); } if(n == 1){ cout << "No\n"; return 0; } if(s == t){ if(k % 2) cout << "No\n"; else{ if(G[s].size() > 0) cout << "Yes\n"; else cout << "Unknown\n"; } return 0; } if(n == 2){ assert(s != t); if(k % 2){ if(m == 1) cout << "Yes\n"; else cout << "Unknown\n"; }else cout << "No\n"; return 0; } int dist = graph.get_dist(s, t); if(dist >= INF){ cout << "Unknown\n"; }else{ int dif = abs(dist - k); if(dif % 2) cout << "No\n"; else{ if(dist <= k) cout << "Yes\n"; else cout << "Unknown\n"; } } return 0; }