結果

問題 No.1190 Points
ユーザー KoDKoD
提出日時 2020-08-22 14:02:08
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 4,224 bytes
コンパイル時間 576 ms
コンパイル使用メモリ 77,964 KB
最終ジャッジ日時 2024-04-23 08:27:48
合計ジャッジ時間 1,235 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
main.cpp:21:13: error: 'uint32_t' does not name a type
   21 |   return false;
      |             ^~~     
main.cpp:14:1: note: 'uint32_t' is defined in header '<cstdint>'; did you forget to '#include <cstdint>'?
   13 | #include <cassert>
  +++ |+#include <cstdint>
   14 | #include <queue>
main.cpp:22:13: error: 'uint64_t' does not name a type
   22 | }
      |             ^       
main.cpp:22:13: note: 'uint64_t' is defined in header '<cstdint>'; did you forget to '#include <cstdint>'?

ソースコード

diff # 

#line 1 "main.cpp"

/**
 * @title Template
 */

#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <cassert>
#include <queue>

#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/chmin_chmax.cpp"

template <class T, class U>
constexpr bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) { lhs = rhs; return true; }
  return false;
}

template <class T, class U>
constexpr bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) { lhs = rhs; return true; }
  return false;
}

/**
 * @title Chmin/Chmax
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"

#line 4 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"

class range {
public:
  class iterator {
  private:
    int64_t M_position;

  public:
    constexpr iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { ++M_position; }
    constexpr bool operator != (iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }

  };

  class reverse_iterator {
  private:
    int64_t M_position;
  
  public:
    constexpr reverse_iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { --M_position; }
    constexpr bool operator != (reverse_iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }

  };
  
private:
  const iterator M_first, M_last;

public:
  constexpr range(int64_t first, int64_t last) noexcept: M_first(first), M_last(std::max(first, last)) { }
  constexpr iterator begin() const noexcept { return M_first; }
  constexpr iterator end() const noexcept { return M_last; }
  constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator(*M_last - 1); } 
  constexpr reverse_iterator rend() const noexcept { return reverse_iterator(*M_first - 1); } 

};

/**
 * @title Range
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"

#include <type_traits>
#include <iterator>
#line 6 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"

template <class T>
class rev_impl {
public:
  using iterator = decltype(std::rbegin(std::declval<T>()));

private:
  const iterator M_begin;
  const iterator M_end;

public:
  constexpr rev_impl(T &&cont) noexcept: M_begin(std::rbegin(cont)), M_end(std::rend(cont)) { }
  constexpr iterator begin() const noexcept { return M_begin; }
  constexpr iterator end() const noexcept { return M_end; }

};

template <class T>
constexpr decltype(auto) rev(T &&cont) {
  return rev_impl<T>(std::forward<T>(cont));
}

/**
 * @title Reverser
 */
#line 18 "main.cpp"

using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;

constexpr i32 inf32 = (i32(1) << 30) - 1;
constexpr i64 inf64 = (i64(1) << 62) - 1;

int main() {
  i32 N, M, P;
  std::cin >> N >> M >> P;
  i32 S, G;
  std::cin >> S >> G;
  --S; --G;
  std::vector<std::vector<i32>> graph(N);
  for (auto i: range(0, M)) {
    i32 u, v;
    std::cin >> u >> v;
    --u; --v;
    graph[u].push_back(v);
    graph[v].push_back(u);
  }
  const auto solve = [&](const i32 src) {
    std::vector<std::array<i32, 2>> dist(N);
    for (auto &arr: dist) {
      arr.fill(inf32);
    }
    dist[src][0] = 0;
    std::queue<std::pair<i32, i32>> que;
    que.emplace(src, 0);
    while (!que.empty()) {
      const auto [u, k] = que.front();
      que.pop();
      for (auto v: graph[u]) {
        if (chmin(dist[v][k ^ 1], dist[u][k] + 1)) {
          que.emplace(v, k ^ 1);
        }
      }
    }
    return dist;
  };
  const auto st = solve(S), go = solve(G);
  std::vector<i32> ans;
  for (auto i: range(0, N)) {
    [&] {
    for (auto j: range(0, 2)) {
      for (auto k: range(0, 2)) {
        if (P % 2 == (j + k) % 2 && st[i][j] + go[i][k] <= P) {
          ans.push_back(i + 1);
          return;
        }
      }
    }
    }();
  }
  if (ans.empty()) {
    std::cout << "-1\n";
    return 0;
  }
  std::cout << ans.size() << '\n';
  for (auto x: ans) {
    std::cout << x << '\n';
  }
  return 0;
}
0