結果

問題 No.2657 Falling Block Game
ユーザー risujiroh
提出日時 2024-03-01 22:14:11
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 3,983 bytes
コンパイル時間 2,913 ms
コンパイル使用メモリ 264,836 KB
実行使用メモリ 13,640 KB
最終ジャッジ日時 2024-09-29 14:15:28
合計ジャッジ時間 6,558 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 2 TLE * 1 -- * 34
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#if __INCLUDE_LEVEL__ == 0
#include __BASE_FILE__
namespace {
void solve() {
  int h, w;
  scan(h, w);
  Array2D<char> s(h, w);
  scan(s.ravel());
  std::vector<int> f(w);
  for (const int i : rep(h - 1) | views::reverse) {
    for (const int j : rep(w)) {
      if (s[i][j] == '#') {
        f[j] = inf();
      }
    }
    auto nf = f;
    for (int l = 0; l < w;) {
      int r = l + 1;
      while (r < w && s[i][l] == s[i][r]) {
        ++r;
      }
      if (s[i][l] == '#') {
        l = r;
        continue;
      }
      for (const int j : rep(l, r)) {
        if (f[j] == inf()) {
          continue;
        }
        const int L = std::max(j - f[j], l);
        const int R = std::min(j + f[j] + 1, r);
        for (const int k : rep(L, R)) {
          chmin(nf[k], f[j]);
        }
        for (const int k : rep(l, L)) {
          chmin(nf[k], j - k);
        }
        for (const int k : rep(R, r)) {
          chmin(nf[k], k - j);
        }
      }
      l = r;
    }
    f = std::move(nf);
  }
  for (const int j : rep(w)) {
    print(f[j]);
  }
}
}  // namespace
int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  std::cout << std::setprecision(DBL_DECIMAL_DIG);
  solve();
}
#else  // __INCLUDE_LEVEL__
#include <bits/stdc++.h>
template <class T>
class Array2D {
 public:
  Array2D() : Array2D(0, 0) {}
  Array2D(int rows, int cols) : rows_(rows), cols_(cols), data_(size()) {}
  Array2D(int rows, int cols, const T& value) : rows_(rows), cols_(cols), data_(size(), value) {}
  int size() const { return rows_ * cols_; }
  int rows() const { return rows_; }
  int cols() const { return cols_; }
  auto operator[](int i) { return std::span<T>(data_.data() + i * cols_, cols_); }
  auto operator[](int i) const { return std::span<const T>(data_.data() + i * cols_, cols_); }
  auto ravel() { return std::span<T>(data_); }
  auto ravel() const { return std::span<const T>(data_); }
 private:
  int rows_;
  int cols_;
  std::vector<T> data_;
};
template <class T, class U = T>
bool chmin(T& x, U&& y) {
  return y < x && (x = std::forward<U>(y), true);
}
template <class T, class U = T>
bool chmax(T& x, U&& y) {
  return x < y && (x = std::forward<U>(y), true);
}
template <std::signed_integral T = int>
T inf() {
  T ret;
  std::memset(&ret, 0x3f, sizeof(ret));
  return ret;
}
template <std::floating_point T>
T inf() {
  return std::numeric_limits<T>::infinity();
}
template <class T>
concept Range = std::ranges::range<T> && !std::convertible_to<T, std::string_view>;
template <class T>
concept Tuple = std::__is_tuple_like<T>::value && !Range<T>;
namespace std {
istream& operator>>(istream& is, Range auto&& r) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}
istream& operator>>(istream& is, Tuple auto&& t) {
  return apply([&](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}
ostream& operator<<(ostream& os, Range auto&& r) {
  for (string_view sep = ""; auto&& e : r) {
    os << exchange(sep, " ") << e;
  }
  return os;
}
ostream& operator<<(ostream& os, Tuple auto&& t) {
  const auto f = [&](auto&... xs) -> ostream& {
    [[maybe_unused]] string_view sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}
}  // namespace std
void scan(auto&&... xs) { std::cin >> std::tie(xs...); }
void print(auto&&... xs) { std::cout << std::tie(xs...) << '\n'; }
template <class F>
class fix {
 public:
  explicit fix(F f) : f_(std::move(f)) {}
  decltype(auto) operator()(auto&&... xs) const {
    return f_(std::ref(*this), std::forward<decltype(xs)>(xs)...);
  }
 private:
  F f_;
};
inline auto rep(int l, int r) { return std::views::iota(std::min(l, r), r); }
inline auto rep(int n) { return rep(0, n); }
inline auto rep1(int l, int r) { return rep(l, r + 1); }
inline auto rep1(int n) { return rep(1, n + 1); }
namespace ranges = std::ranges;
namespace views = std::views;
using i64 = std::int64_t;
#endif  // __INCLUDE_LEVEL__
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0