結果

問題 No.840 ほむほむほむら
ユーザー はまやんはまやん
提出日時 2019-06-17 20:24:10
言語 C++14
(gcc 9.2.0)
結果
AC  
実行時間 1,020 ms
コード長 3,430 Byte
コンパイル時間 1,620 ms
使用メモリ 3,496 KB
最終ジャッジ日時 2020-01-12 12:20:19

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
0_small01.txt AC 4 ms
3,268 KB
0_small02.txt AC 4 ms
3,364 KB
0_small03.txt AC 16 ms
3,460 KB
0_small04.txt AC 120 ms
3,484 KB
0_small05.txt AC 0 ms
3,432 KB
0_small06.txt AC 0 ms
3,348 KB
0_small07.txt AC 8 ms
3,356 KB
0_small08.txt AC 44 ms
3,452 KB
0_small09.txt AC 232 ms
3,476 KB
0_small10.txt AC 4 ms
3,324 KB
1_large01.txt AC 4 ms
3,300 KB
1_large02.txt AC 8 ms
3,360 KB
1_large03.txt AC 68 ms
3,448 KB
1_large04.txt AC 648 ms
3,452 KB
1_large05.txt AC 84 ms
3,464 KB
1_large06.txt AC 0 ms
3,352 KB
1_large07.txt AC 12 ms
3,360 KB
1_large08.txt AC 156 ms
3,468 KB
1_large09.txt AC 832 ms
3,432 KB
1_large10.txt AC 1,020 ms
3,464 KB
2_corner01.txt AC 0 ms
3,360 KB
2_corner02.txt AC 4 ms
3,368 KB
2_corner03.txt AC 12 ms
3,436 KB
2_corner04.txt AC 972 ms
3,464 KB
2_corner05.txt AC 16 ms
3,284 KB
3_sample01.txt AC 0 ms
3,352 KB
3_sample02.txt AC 20 ms
3,464 KB
3_sample03.txt AC 968 ms
3,496 KB
テストケース一括ダウンロード

ソースコード

diff #
#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     @hamayanhamayan
    /   \     | |
    /   / ̄ ̄ ̄ ̄/  |
  __(__ニつ/     _/ .| .|____
     \/____/ (u ⊃
---------------------------------------------------------------------------------------------------*/











int N, K;
//---------------------------------------------------------------------------------------------------
int enc(int ho, int homu, int homura) {
	return ho * K * K + homu * K + homura;
}
//---------------------------------------------------------------------------------------------------
void _main() {
	cin >> N >> K;
	Mat m(K * K * K, Vec(K * K * K, 0));
	Vec v(K * K * K, 0);

	v[enc(0, 0, 0)] = 1;
	rep(ho, 0, K) rep(homu, 0, K) rep(homura, 0, K) {
		// ほ
		m[enc((ho + 1) % K, homu, homura)][enc(ho, homu, homura)] += 1;

		// む
		m[enc(ho, (homu + ho) % K, homura)][enc(ho, homu, homura)] += 1;

		// ら
		m[enc(ho, homu, (homura + homu) % K)][enc(ho, homu, homura)] += 1;
	}

	m = fastpow(m, N);
	v = mulMatVec(m, v);
	int ans = 0;
	rep(ho, 0, K) rep(homu, 0, K) ans = (ans + v[enc(ho, homu, 0)]) % mod;
	cout << ans << endl;
}
0