結果
問題 | No.2983 Christmas Color Grid (Advent Calender ver.) |
ユーザー |
|
提出日時 | 2024-12-08 12:22:00 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 458 ms / 3,340 ms |
コード長 | 3,536 bytes |
コンパイル時間 | 3,388 ms |
コンパイル使用メモリ | 253,356 KB |
実行使用メモリ | 7,296 KB |
最終ジャッジ日時 | 2024-12-08 12:22:08 |
合計ジャッジ時間 | 7,204 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 64 |
ソースコード
#include <bits/stdc++.h> using namespace std; #include <atcoder/modint> using namespace atcoder; using mint = modint998244353; using vm = vector<mint>; using vvm = vector<vm>; inline ostream &operator<<(ostream &os, const mint x) { return os << x.val(); }; inline istream &operator>>(istream &is, mint &x) { long long v; is >> v; x = v; return is; }; struct Fast { Fast() { std::cin.tie(nullptr); ios::sync_with_stdio(false); cout << setprecision(10); } } fast; #define all(a) (a).begin(), (a).end() #define contains(a, x) ((a).find(x) != (a).end()) #define rep(i, a, b) for (int i = (a); i < (int)(b); i++) #define rrep(i, a, b) for (int i = (int)(b) - 1; i >= (a); i--) #define YN(b) cout << ((b) ? "YES" : "NO") << "\n"; #define Yn(b) cout << ((b) ? "Yes" : "No") << "\n"; #define yn(b) cout << ((b) ? "yes" : "no") << "\n"; template <class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template <class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } using ll = long long; using vb = vector<bool>; using vvb = vector<vb>; using vi = vector<int>; using vvi = vector<vi>; using vl = vector<ll>; using vvl = vector<vl>; template <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> &p) { os << "(" << p.first << "," << p.second << ")"; return os; } template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) { for (int i = 0; i < (int)vec.size(); i++) { os << vec[i] << (i + 1 == (int)vec.size() ? "" : " "); } return os; } template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (int i = 0; i < (int)vec.size(); i++) is >> vec[i]; return is; } ll floor(ll a, ll b) { return a >= 0 ? a / b : (a + 1) / b - 1; } ll ceil(ll a, ll b) { return a > 0 ? (a - 1) / b + 1 : a / b; } int dx[] = {1, 0, -1, 0}; int dy[] = {0, 1, 0, -1}; void solve() { int h, w, m; ll k; cin >> h >> w >> k >> m; if (h < w) swap(h, w); using mint = dynamic_modint<0>; mint::set_mod(m); int mask0 = (1 << w) - 1; int mask1 = 0; rep(i, 0, h) mask1 |= 1 << (w * i); int mask2 = mask0 << ((h - 1) * w); int mask3 = mask1 << (w - 1); int mask_all = (1 << (h * w)) - 1; auto gd = [&](int bit) { return mask_all & (((bit & ~mask0) >> w) | ((bit & ~mask2) << w) | ((bit & ~mask1) >> 1) | ((bit & ~mask3) << 1)); }; vector<bool> ok(1 << (h * w), false); auto dfs = [&](auto dfs, int f) -> void { ok[f] = true; rep(i, 0, h * w) { if ((f >> i) & 1) continue; if (!((gd(f) >> i) & 1)) continue; int nf = f | (1 << i); if (ok[nf]) continue; ok[nf] = true; dfs(dfs, nf); } }; rep(i, 0, h * w) dfs(dfs, 1 << i); vector<mint> cnt(h * w + 1, 0); rep(bit, 1, 1 << (h * w)) { if (!ok[bit]) continue; int pc = __builtin_popcount(bit); int nbit = gd(bit); int c = __builtin_popcount((~bit) & nbit); cnt[pc] += 1 << (h * w - pc - c); } mint ans = 0; rep(i, 0, h * w + 1) ans += mint(i).pow(k) * cnt[i]; mint p = 0; rep(i, 1, h * w + 1) p += mint(i).inv(); ans *= p; ans *= mint(2).inv().pow(h * w); cout << ans.val() << "\n"; } int main() { int t = 1; // cin >> t; while (t--) solve(); }