#909616 (C++23) No.2457 Stampaholic (Easy)

• 問題: No.2457 Stampaholic (Easy)
• ユーザー: risujiroh
• 提出日時: 2023-09-01 21:34:14
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 604 ms / 4,000 ms
• コード長: 3,509 bytes
• コンパイル時間: 3,079 ms
• コンパイル使用メモリ: 259,748 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-06-11 03:09:46
• 合計ジャッジ時間: 8,233 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	147 ms; 5,376 KB
testcase_02	AC	65 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	604 ms; 5,376 KB
testcase_06	AC	54 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	66 ms; 5,376 KB
testcase_09	AC	39 ms; 5,376 KB
testcase_10	AC	100 ms; 5,376 KB
testcase_11	AC	145 ms; 5,376 KB
testcase_12	AC	217 ms; 5,376 KB
testcase_13	AC	296 ms; 5,376 KB
testcase_14	AC	466 ms; 5,376 KB
testcase_15	AC	594 ms; 5,376 KB
testcase_16	AC	595 ms; 5,376 KB
testcase_17	AC	555 ms; 5,376 KB
testcase_18	AC	46 ms; 5,376 KB
testcase_19	AC	2 ms; 5,376 KB
testcase_20	AC	3 ms; 5,376 KB
testcase_21	AC	30 ms; 5,376 KB

ソースコード

#if __INCLUDE_LEVEL__ == 0

#include <bits/stdc++.h>

using namespace std;

#include __BASE_FILE__

namespace {

using Fp = atcoder::modint998244353;

void solve() {
  int h, w, n, k;
  cin >> tie(h, w, n, k);
  Fp ans = 0;
  Fp inv = Fp(h - k + 1) * (w - k + 1);
  inv = inv.inv();
  vector<int> ph;
  for (int i : rep1(0, k)) {
    ph.push_back(i);
  }
  for (int i : rep1(max(k + 1, h - k), h)) {
    ph.push_back(i);
  }
  vector<int> pw;
  for (int j : rep1(0, k)) {
    pw.push_back(j);
  }
  for (int j : rep1(max(k + 1, w - k), w)) {
    pw.push_back(j);
  }
  for (int pi : rep(1, ph.size())) {
    for (int pj : rep(1, pw.size())) {
      int i = ph[pi - 1];
      int j = pw[pj - 1];
      Fp numer = min({i + 1, h - i, k, h - k + 1});
      numer *= min({j + 1, w - j, k, w - k + 1});
      ans += (1 - numer * inv).pow(n) * (ph[pi] - ph[pi - 1]) *
             (pw[pj] - pw[pj - 1]);
    }
  }
  ans = Fp(h) * w - ans;
  print(ans);
}

}  // namespace

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

  solve();
}

#else  // __INCLUDE_LEVEL__

#undef assert
#define assert(expr) (expr) || (__builtin_unreachable(), 0)

#include <atcoder/modint>

template <class T, class U = T>
bool chmin(T& x, U&& y) {
  return y < x && (x = forward<U>(y), true);
}

template <class T, class U = T>
bool chmax(T& x, U&& y) {
  return x < y && (x = forward<U>(y), true);
}

namespace std {

template <class T1, class T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
  return is >> p.first >> p.second;
}

template <class... Ts>
istream& operator>>(istream& is, tuple<Ts...>& t) {
  return apply([&is](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}

template <class... Ts>
istream& operator>>(istream& is, tuple<Ts&...>&& t) {
  return is >> t;
}

template <class R, enable_if_t<!is_convertible_v<R, string>>* = nullptr>
auto operator>>(istream& is, R&& r) -> decltype(is >> *begin(r)) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
  return os << p.first << ' ' << p.second;
}

template <class... Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
  auto f = [&os](const auto&... xs) -> ostream& {
    [[maybe_unused]] auto sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}

template <class R, enable_if_t<!is_convertible_v<R, string_view>>* = nullptr>
auto operator<<(ostream& os, R&& r) -> decltype(os << *begin(r)) {
  auto sep = "";
  for (auto&& e : r) {
    os << exchange(sep, " ") << e;
  }
  return os;
}

}  // namespace std

namespace atcoder {

template <class T, internal::is_modint_t<T>* = nullptr>
istream& operator>>(istream& is, T& x) {
  int v;
  is >> v;
  x = T::raw(v);
  return is;
}

template <class T, internal::is_modint_t<T>* = nullptr>
ostream& operator<<(ostream& os, const T& x) {
  return os << x.val();
}

}  // namespace atcoder

template <class... Ts>
void print(Ts&&... xs) {
  cout << tie(xs...) << '\n';
}

inline auto rep(int l, int r) { return views::iota(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); }
inline auto per(int l, int r) { return rep(l, r) | views::reverse; }
inline auto per(int n) { return per(0, n); }
inline auto per1(int l, int r) { return per(l, r + 1); }
inline auto per1(int n) { return per(1, n + 1); }

#endif  // __INCLUDE_LEVEL__