結果
問題 | No.2457 Stampaholic (Easy) |
ユーザー |
![]() |
提出日時 | 2023-09-01 22:51:40 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2,176 ms / 4,000 ms |
コード長 | 2,908 bytes |
コンパイル時間 | 4,520 ms |
コンパイル使用メモリ | 266,248 KB |
最終ジャッジ日時 | 2025-02-16 17:08:58 |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 19 |
ソースコード
#include<bits/stdc++.h>using namespace std;//* ATCODER#include<atcoder/all>using namespace atcoder;typedef modint998244353 mint;//*//* BOOST MULTIPRECISION#include<boost/multiprecision/cpp_int.hpp>using namespace boost::multiprecision;//*/typedef long long ll;#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)template <typename T> bool chmin(T &a, const T &b) {if (a <= b) return false;a = b;return true;}template <typename T> bool chmax(T &a, const T &b) {if (a >= b) return false;a = b;return true;}template <typename T> T max(vector<T> &a){assert(!a.empty());T ret = a[0];for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);return ret;}template <typename T> T min(vector<T> &a){assert(!a.empty());T ret = a[0];for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);return ret;}template <typename T> T sum(vector<T> &a){T ret = 0;for (int i=0; i<(int)a.size(); i++) ret += a[i];return ret;}int main(){int h, w, n, k; cin >> h >> w >> n >> k;mint r = mint(h-k+1) * (w-k+1);mint rinv = r.inv();set<pair<int,int>> s;mint ans = 0;{rep(i,0,k){rep(j,0,k){if (s.find(pair(i, j)) != s.end()) continue;s.insert(pair(i, j));ans += ((r - mint(min(h-k+1,i+1)) * (min(w-k+1,j+1))) * rinv).pow(n);}}}{rep(i,0,k){rep(j,0,k){if (s.find(pair(h-1-i, j)) != s.end()) continue;s.insert(pair(h-1-i, j));ans += ((r - mint(min(h-k+1,i+1)) * (min(w-k+1,j+1))) * rinv).pow(n);}}}{rep(i,0,k){rep(j,0,k){if (s.find(pair(i, w-1-j)) != s.end()) continue;s.insert(pair(i, w-1-j));ans += ((r - mint(min(h-k+1,i+1)) * (min(w-k+1,j+1))) * rinv).pow(n);}}}{rep(i,0,k){rep(j,0,k){if (s.find(pair(h-1-i, w-1-j)) != s.end()) continue;s.insert(pair(h-1-i, w-1-j));ans += ((r - mint(min(h-k+1,i+1)) * (min(w-k+1,j+1))) * rinv).pow(n);}}}set<int> s2;{mint hir = max(0,w - 2*k);rep(i,0,k){if (s2.find(i) != s2.end()) continue;s2.insert(i);ans += hir * ((r - mint(k) * min(h-k+1,i+1)) * rinv).pow(n);}}{mint hir = max(0,w - 2*k);rep(i,0,k){if (s2.find(h-1-i) != s2.end()) continue;s2.insert(h-1-i);ans += hir * ((r - mint(k) * min(h-k+1,i+1)) * rinv).pow(n);}}set<int> s3;{mint hir = max(0,h - 2*k);rep(i,0,k){if (s3.find(i) != s3.end()) continue;s3.insert(i);ans += hir * ((r - mint(k) * min(w-k+1,i+1)) * rinv).pow(n);}}{mint hir = max(0,h - 2*k);rep(i,0,k){if (s3.find(w-1-i) != s3.end()) continue;s3.insert(w-1-i);ans += hir * ((r - mint(k) * min(w-k+1,i+1)) * rinv).pow(n);}}{mint hir = mint(max(0,h - 2*k)) * (max(0,w - 2*k));ans += hir * ((r - mint(k) * k) * rinv).pow(n);}ans = mint(h) * w - ans;cout << ans.val() << '\n';}