結果

問題 No.2674 k-Walk on Bipartite
ユーザー stoqstoq
提出日時 2024-03-15 22:48:52
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 8,233 bytes
コンパイル時間 5,117 ms
コンパイル使用メモリ 282,760 KB
実行使用メモリ 31,612 KB
最終ジャッジ日時 2024-09-30 02:17:32
合計ジャッジ時間 7,557 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 14 ms
9,216 KB
testcase_01 AC 16 ms
9,088 KB
testcase_02 AC 14 ms
9,216 KB
testcase_03 AC 15 ms
9,216 KB
testcase_04 AC 14 ms
9,216 KB
testcase_05 AC 14 ms
9,088 KB
testcase_06 AC 14 ms
9,088 KB
testcase_07 AC 94 ms
27,472 KB
testcase_08 AC 104 ms
24,364 KB
testcase_09 AC 80 ms
27,444 KB
testcase_10 AC 125 ms
27,420 KB
testcase_11 AC 83 ms
23,800 KB
testcase_12 AC 135 ms
25,216 KB
testcase_13 AC 73 ms
25,180 KB
testcase_14 AC 38 ms
19,456 KB
testcase_15 AC 170 ms
29,280 KB
testcase_16 AC 105 ms
28,632 KB
testcase_17 AC 104 ms
23,712 KB
testcase_18 AC 51 ms
20,360 KB
testcase_19 AC 92 ms
26,488 KB
testcase_20 AC 85 ms
26,796 KB
testcase_21 AC 108 ms
25,144 KB
testcase_22 AC 160 ms
31,612 KB
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 AC 14 ms
9,216 KB
testcase_28 AC 15 ms
9,216 KB
testcase_29 AC 15 ms
9,216 KB
testcase_30 AC 13 ms
9,088 KB
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 AC 15 ms
9,088 KB
testcase_36 AC 14 ms
9,216 KB
testcase_37 AC 14 ms
9,088 KB
testcase_38 AC 14 ms
9,216 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define MOD_TYPE 1

#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
// #include <atcoder/lazysegtree>
// #include <atcoder/modint>
// #include <atcoder/segtree>
using namespace atcoder;
#if 0
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif
#if 0
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template <typename T>
using extset =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#endif
#if 1
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#pragma region Macros
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;
#if MOD_TYPE == 1
constexpr ll MOD = ll(1e9 + 7);
#else
#if MOD_TYPE == 2
constexpr ll MOD = 998244353;
#else
constexpr ll MOD = 1000003;
#endif
#endif
using mint = static_modint<MOD>;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
const double PI = acos(-1.0);
constexpr ld EPS = 1e-10;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};
#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define RREP(i, m, n) for (ll i = n - 1; i >= m; i--)
#define rrep(i, n) RREP(i, 0, n)
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";
#define UNIQUE(v) v.erase(unique(all(v)), v.end())
struct io_init {
  io_init() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(20) << setiosflags(ios::fixed);
  };
} io_init;
template <typename T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
inline ll floor(ll a, ll b) {
  if (b < 0) a *= -1, b *= -1;
  if (a >= 0) return a / b;
  return -((-a + b - 1) / b);
}
inline ll ceil(ll a, ll b) { return floor(a + b - 1, b); }
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
  fill((T *)array, (T *)(array + N), val);
}
template <typename T>
vector<T> compress(vector<T> &v) {
  vector<T> val = v;
  sort(all(val)), val.erase(unique(all(val)), val.end());
  for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin();
  return val;
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept {
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept {
  os << p.first << " " << p.second;
  return os;
}
ostream &operator<<(ostream &os, mint m) {
  os << m.val();
  return os;
}
ostream &operator<<(ostream &os, modint m) {
  os << m.val();
  return os;
}
template <typename T>
constexpr istream &operator>>(istream &is, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++) is >> v[i];
  return is;
}
template <typename T>
constexpr ostream &operator<<(ostream &os, vector<T> &v) noexcept {
  for (int i = 0; i < v.size(); i++)
    os << v[i] << (i + 1 == v.size() ? "" : " ");
  return os;
}
template <typename T>
constexpr void operator--(vector<T> &v, int) noexcept {
  for (int i = 0; i < v.size(); i++) v[i]--;
}
random_device seed_gen;
mt19937_64 engine(seed_gen());
inline ll randInt(ll l, ll r) { return engine() % (r - l + 1) + l; }
struct BiCoef {
  vector<mint> fact_, inv_, finv_;
  BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
    fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
    for (int i = 2; i < n; i++) {
      fact_[i] = fact_[i - 1] * i;
      inv_[i] = -inv_[MOD % i] * (MOD / i);
      finv_[i] = finv_[i - 1] * inv_[i];
    }
  }
  mint C(ll n, ll k) const noexcept {
    if (n < k || n < 0 || k < 0) return 0;
    return fact_[n] * finv_[k] * finv_[n - k];
  }
  mint P(ll n, ll k) const noexcept { return C(n, k) * fact_[k]; }
  mint H(ll n, ll k) const noexcept { return C(n + k - 1, k); }
  mint Ch1(ll n, ll k) const noexcept {
    if (n < 0 || k < 0) return 0;
    mint res = 0;
    for (int i = 0; i < n; i++)
      res += C(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1);
    return res;
  }
  mint fact(ll n) const noexcept {
    if (n < 0) return 0;
    return fact_[n];
  }
  mint inv(ll n) const noexcept {
    if (n < 0) return 0;
    return inv_[n];
  }
  mint finv(ll n) const noexcept {
    if (n < 0) return 0;
    return finv_[n];
  }
};
BiCoef bc(500010);
#pragma endregion

// -------------------------------

struct UnionFind {
 public:
  UnionFind() : _n(0) {}
  UnionFind(int n) : _n(n), parent_or_size(n, -1) {}

  int unite(int a, int b) {
    assert(0 <= a && a < _n);
    assert(0 <= b && b < _n);
    int x = root(a), y = root(b);
    if (x == y) return x;
    if (-parent_or_size[x] < -parent_or_size[y]) swap(x, y);
    parent_or_size[x] += parent_or_size[y];
    parent_or_size[y] = x;
    return x;
  }

  bool same(int a, int b) {
    assert(0 <= a && a < _n);
    assert(0 <= b && b < _n);
    return root(a) == root(b);
  }

  int root(int a) {
    assert(0 <= a && a < _n);
    if (parent_or_size[a] < 0) return a;
    return parent_or_size[a] = root(parent_or_size[a]);
  }

  int size(int a) {
    assert(0 <= a && a < _n);
    return -parent_or_size[root(a)];
  }

  vector<vector<int>> groups() {
    vector<int> leader_buf(_n), group_size(_n);
    for (int i = 0; i < _n; i++) {
      leader_buf[i] = root(i);
      group_size[leader_buf[i]]++;
    }
    vector<vector<int>> result(_n);
    for (int i = 0; i < _n; i++) {
      result[i].reserve(group_size[i]);
    }
    for (int i = 0; i < _n; i++) {
      result[leader_buf[i]].push_back(i);
    }
    result.erase(remove_if(result.begin(), result.end(),
                           [&](const vector<int> &v) { return v.empty(); }),
                 result.end());
    return result;
  }

 private:
  int _n;
  vector<int> parent_or_size;
};

struct BFS {
  vector<int> d;
  vector<vector<pair<int, int>>> E;
  BFS(int V) : d(V, INF), E(V) {}

  void add_edge(int u, int v, bool c, bool directed = true) {
    E[u].push_back({v, c});
    if (!directed) E[v].push_back({u, c});
  }

  void calc(int s) {
    d[s] = 0;
    deque<int> que;
    que.push_front(s);
    while (!que.empty()) {
      int u = que.front();
      que.pop_front();
      for (auto [v, c] : E[u]) {
        if (d[v] <= d[u] + c) continue;
        d[v] = d[u] + c;
        if (!c)
          que.push_front(v);
        else
          que.push_back(v);
      }
    }
  }
};

void solve() {
  int n, m, s, t, k;
  cin >> n >> m >> s >> t >> k;
  s--, t--;

  vector<vector<int>> G(n);
  BFS bfs(n);
  rep(i, m) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    G[a].push_back(b);
    G[b].push_back(a);
    bfs.add_edge(a, b, 1, false);
  }

  UnionFind uf(n * 2 + 1);
  rep(i, n) {
    for (auto j : G[i]) {
      uf.unite(i, j + n);
      uf.unite(i + n, j);
    }
  }
  bfs.calc(s);
  int d = bfs.d[t];

  if (n == 1) {
    Yes(0);
    return;
  } else if (n == 2) {
    if (m == 0) {
      cout << (k % 2 == 1 ? "Unknown" : "No") << "\n";
    } else {
      cout << (k % 2 == 1 ? "Yes" : "No") << "\n";
    }
    return;
  }

  if (uf.same(s, t)) {  // 連結かつ同じ色
    if (k % 2 == 1) {
      Yes(0);
      return;
    }
    cout << (d <= k ? "Yes" : "Unknown") << "\n";
  } else if (uf.same(s, t + n)) {  // 連結かつ違う色
    if (k % 2 == 0) {
      Yes(0);
      return;
    }
    cout << (d <= k ? "Yes" : "Unknown") << "\n";
  } else {
    cout << "Unknown"
         << "\n";
  }
}

int main() { solve(); }
0