Submission #23263864

---

Source Code Expand

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
int mod = 998244353;
int add(int x, int y) { return (x += y) >= mod ? x - mod : x; }
template<class... T> int add(int x, T... y) { return add(x, add(y...)); }
int mul(int x, int y) { return 1LL * x * y % mod; }
template<class... T> int mul(int x, T... y) { return mul(x, mul(y...)); }
int sub(int x, int y) { return add(x, mod - y); }
int modpow(int a, long long b) {
    int ret = 1; while (b > 0) {
        if (b & 1) ret = 1LL * ret * a % mod; a = 1LL * a * a % mod; b >>= 1;
    } return ret;
}
int modinv(int a) { return modpow(a, mod - 2); }
typedef vector<int> Vec;
typedef vector<Vec> Mat;
Vec mulMatVec(Mat a, Vec b)
{
    int n = b.size(); Vec ret(n, 0);
    rep(i, 0, n) rep(j, 0, n) ret[i] = add(ret[i], mul(a[i][j], b[j]));
    return ret;
}
Mat mulMatMat(Mat a, Mat b)
{
    int n = a.size(); Mat ret(n, Vec(n, 0));
    rep(i, 0, n) rep(j, 0, n) rep(k, 0, n) ret[i][j] = add(ret[i][j], mul(a[i][k], b[k][j]));
    return ret;
}
Mat fastpow(Mat x, ll n)
{
    Mat ret(x.size(), Vec(x.size(), 0));
    rep(i, 0, x.size()) ret[i][i] = 1;
    while (0 < n) { if ((n % 2) == 0) { x = mulMatMat(x, x); n >>= 1; } else { ret = mulMatMat(ret, x); --n; } }
    return ret;
}
void printVec(Vec a) { cout << "[\t"; rep(i, 0, a.size()) cout << a[i] << "\t"; cout << "]" << endl; }
void printMat(Mat a) { rep(i, 0, a.size()) printVec(a[i]); }
/*---------------------------------------------------------------------------------------------------
　　　　　　　　　　　 ∧＿∧
　　　　　 ∧＿∧ 　（´<_｀ ）　 Welcome to My Coding Space!
　　　　 （ ´_ゝ`）　/　 ⌒i     @hamayanhamayan0
　　　　／　　　＼　 　  |　|
　　　 /　　 /￣￣￣￣/　　|
　 ＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿
　 　　　＼/＿＿＿＿/　（u　⊃
---------------------------------------------------------------------------------------------------*/














int H; ll W;
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> H >> W;

    Mat m(1 << H, Vec(1 << H, 0));
    Vec v(1 << H, 0);

    Vec init(1 << H, 0);
    rep(msk, 0, 1 << H) {
        bool nextPlace = false;
        bool ok = true;
        rep(i, 0, H) {
            if (nextPlace) {
                if (msk & (1 << i)) nextPlace = false;
                else ok = false;
            }
            else {
                if (msk & (1 << i)) nextPlace = true;
            }
        }
        if (nextPlace) ok = false;
        if (ok) {
            init[msk] = 1;
        }
    }

    rep(msk, 0, 1 << H) v[msk] = init[msk];

    rep(from, 0, 1 << H) rep(to, 0, 1 << H) {
        rep(used, 0, 1 << H) {
            bool ok = true;
            rep(i, 0, H) if (used & (1 << i)) {
                if ((from & (1 << i)) || (to & (1 << i))) ok = false;
            }
            if (ok) {
                int to2 = to;
                rep(i, 0, H) if (used & (1 << i)) to2 += 1 << i;
                m[to2][from] = add(m[to2][from], init[to]);
            }
        }
    }

    m = fastpow(m, W - 1);
    v = mulMatVec(m, v);

    int ans = 0;
    rep(msk, 0, 1 << H) ans = add(ans, v[msk]);
    cout << ans << endl;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int modpow(int, long long int)’:
./Main.cpp:21:9: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
   21 |         if (b & 1) ret = 1LL * ret * a % mod; a = 1LL * a * a % mod; b >>= 1;
      |         ^~
./Main.cpp:21:47: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’
   21 |         if (b & 1) ret = 1LL * ret * a % mod; a = 1LL * a * a % mod; b >>= 1;
      |                                               ^
./Main.cpp: In function ‘Mat fastpow(Mat, ll)’:
./Main.cpp:2:33: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<std::vector<int> >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
    2 | #define rep(i,a,b) for(int i=a;i<b;i++)
......
   42 |     rep(i, 0, x.size()) ret[i][i] = 1;
      |         ~~~~~~~~~~~~~~           
./Main.cpp:42:5: note: in expansion of macro ‘rep’
   42 |     rep(i, 0, x.size()) ret[i][i] = 1;
      |     ^~~
./Main.cpp: In function ‘void printVec(Vec)’:
./Main.cpp:2:33: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
    2 | #define rep(i,a,b) for(int i=a;i<b;i++)
......
   46 | void printVec(Vec a) { cout << "[\t"; rep(i, 0, a.size()) cout << a[i] << "\t"; cout << "]" << endl; }
      |                                           ~~~~~~~~~~~~~~
./Main.cpp:46:39: note: in expansion of macro ‘rep’
   46 | void printVec(Vec a) { cout << "[\t"; rep(i, 0, a.size()) cout << a[i] << "\t"; cout << "]" << endl; }
      |                                       ^~~
./Main.cpp: In function ‘void printMat(Mat)’:
./Main.cpp:2:33: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<std::vector<int> >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
    2 | #define rep(i,a,b) for(int i=a;i<b;i++)
......
   47 | void printMat(Mat a) { rep(i, 0, ...

Judge Result