#1188101 (C++23) No.3723 Climb or Detour

• 問題: No.3723 Climb or Detour
• ユーザー: risujiroh
• 提出日時: 2026-09-19 13:23:03
• 言語: C++23 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: AC
• 実行時間: 2 ms / 2,000 ms
• コード長: 3,545 bytes
• コンパイル時間: 2,068 ms
• コンパイル使用メモリ: 353,396 KB
• 実行使用メモリ: 6,528 KB
• 最終ジャッジ日時: 2026-09-19 13:29:49
• 合計ジャッジ時間: 6,878 ms
• ジャッジサーバーID （参考情報）: judge4_0 / judge3_1

ファイルパターン	結果
sample	AC * 2
other	AC * 58

ソースコード

#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

void Solve() {
  int n, K;
  IN(n, K);
  int si, sj, ti, tj;
  IN(OneBased(si, sj, ti, tj));

  vector<pair<int, int>> path;
  path.emplace_back(si, sj);
  while (true) {
    auto [i, j] = path.back();
    if (i < ti)
      ++i;
    else if (i > ti)
      --i;
    else if (j < tj)
      ++j;
    else if (j > tj)
      --j;
    else
      break;
    path.emplace_back(i, j);
  }

  int d = Len(path) - 1;
  if (d <= K && K <= 2 * d && (K - d) % 2 == 0) {
  } else {
    OUT(-1);
    return;
  }

  vector<string> s(n, string(n, '?'));
  for (int i : Rep(0, n))
    for (int j : Rep(0, n))
      s[i][j] = ".#"[(i - si + j - sj) & 1];

  int cur = 2 * d;
  if (d & 1) {
    s[ti][tj] = '.';
    --cur;
  }

  for (; cur != K; cur -= 2) {
    while (true) {
      auto [i, j] = path.back();
      path.pop_back();
      if (s[i][j] == '#') {
        s[i][j] = '.';
        break;
      }
    }
  }

  ranges::for_each(s, LIFT(OUT));
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  Solve();
}

#elif __INCLUDE_LEVEL__ == 1

#include <bits/stdc++.h>

template <class T>
concept MyRange =
    std::ranges::range<T> &&
    !std::convertible_to<T, std::string_view> &&
    !std::convertible_to<T, std::filesystem::path>;

template <class T>
concept MyTuple = std::__is_tuple_like<T>::value && !MyRange<T>;

namespace std {

istream& operator>>(istream& is, MyRange auto&& r) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

istream& operator>>(istream& is, MyTuple auto&& t) {
  apply([&](auto&... xs) { (is >> ... >> xs); }, t);
  return is;
}

ostream& operator<<(ostream& os, MyRange auto&& r) {
  auto sep = "";
  for (auto&& e : r) {
    os << exchange(sep, " ") << forward<decltype(e)>(e);
  }
  return os;
}

ostream& operator<<(ostream& os, MyTuple auto&& t) {
  auto sep = "";
  apply([&](auto&... xs) { ((os << exchange(sep, " ") << xs), ...); }, t);
  return os;
}

}  // namespace std

template <class T>
class OneBased {
 public:
  explicit OneBased(T&& x) : ref_(std::forward<T>(x)) {}

  template <class... Ts>
  requires(sizeof...(Ts) > 1)
      OneBased(Ts&&... xs) : ref_(std::forward_as_tuple(std::forward<Ts>(xs)...)) {}

  friend std::istream& operator>>(std::istream& is, OneBased x) {
    if constexpr (MyRange<T>) {
      for (auto&& e : x.ref_) {
        is >> ::OneBased(e);
      }
    } else if constexpr (MyTuple<T>) {
      std::apply([&](auto&... xs) { (is >> ... >> ::OneBased(xs)); }, x.ref_);
    } else {
      is >> x.ref_;
      --x.ref_;
    }
    return is;
  }

  friend std::ostream& operator<<(std::ostream& os, OneBased x) {
    if constexpr (MyRange<T>) {
      auto f = [](auto&& e) { return ::OneBased(std::forward<decltype(e)>(e)); };
      os << (x.ref_ | std::views::transform(f));
    } else if constexpr (MyTuple<T>) {
      std::apply([&](auto&... xs) { os << std::tuple(::OneBased(xs)...); }, x.ref_);
    } else {
      os << ++x.ref_;
      --x.ref_;
    }
    return os;
  }

 private:
  T ref_;
};

template <class T>
OneBased(T&&) -> OneBased<T>;

template <class... Ts>
OneBased(Ts&&...) -> OneBased<std::tuple<Ts...>>;

using namespace std;

#define LIFT(f) ([&](auto&&... xs) -> decltype(auto) { return f(forward<decltype(xs)>(xs)...); })
#define Rep(...) [](int l, int r) { return views::iota(min(l, r), r); }(__VA_ARGS__)
#define Len(r) int(size(r))
#define IN(...) (cin >> forward_as_tuple(__VA_ARGS__))
#define OUT(...) (cout << forward_as_tuple(__VA_ARGS__) << '\n')

#endif  // __INCLUDE_LEVEL__ == 1