#718627 (C++17) No.1759 Silver Tour

提出ソース

結果

問題	No.1759 Silver Tour
ユーザー	heno239
提出日時	2021-11-20 16:49:11
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	16 ms / 2,000 ms
コード長	5,706 bytes
コンパイル時間	1,888 ms
コンパイル使用メモリ	155,804 KB
実行使用メモリ	20,680 KB
最終ジャッジ日時	2024-06-11 18:48:50
合計ジャッジ時間	3,489 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	13 ms 20,516 KB
testcase_01	AC	9 ms 20,428 KB
testcase_02	AC	14 ms 20,420 KB
testcase_03	AC	13 ms 20,424 KB
testcase_04	AC	13 ms 20,608 KB
testcase_05	AC	7 ms 20,568 KB
testcase_06	AC	14 ms 20,480 KB
testcase_07	AC	9 ms 20,576 KB
testcase_08	AC	8 ms 20,584 KB
testcase_09	AC	16 ms 20,556 KB
testcase_10	AC	16 ms 20,552 KB
testcase_11	AC	13 ms 20,608 KB
testcase_12	AC	14 ms 20,608 KB
testcase_13	AC	14 ms 20,428 KB
testcase_14	AC	14 ms 20,428 KB
testcase_15	AC	15 ms 20,552 KB
testcase_16	AC	13 ms 20,680 KB
testcase_17	AC	14 ms 20,552 KB
testcase_18	AC	9 ms 20,552 KB
testcase_19	AC	14 ms 20,608 KB
testcase_20	AC	14 ms 20,428 KB
testcase_21	AC	15 ms 20,424 KB
testcase_22	AC	15 ms 20,428 KB
testcase_23	AC	13 ms 20,424 KB
testcase_24	AC	9 ms 20,556 KB
testcase_25	AC	8 ms 20,520 KB
testcase_26	AC	8 ms 20,480 KB
testcase_27	AC	8 ms 20,480 KB
testcase_28	AC	7 ms 20,488 KB
testcase_29	AC	8 ms 20,608 KB
testcase_30	AC	7 ms 20,608 KB
testcase_31	AC	8 ms 20,428 KB
testcase_32	AC	8 ms 20,608 KB
testcase_33	AC	7 ms 20,608 KB
testcase_34	AC	13 ms 20,552 KB
testcase_35	AC	8 ms 20,424 KB
testcase_36	AC	14 ms 20,480 KB
testcase_37	AC	9 ms 20,424 KB
testcase_38	AC	13 ms 20,480 KB
testcase_39	AC	13 ms 20,464 KB
testcase_40	AC	14 ms 20,428 KB
testcase_41	AC	14 ms 20,424 KB
testcase_42	AC	13 ms 20,464 KB
testcase_43	AC	14 ms 20,556 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-4;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}


int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

ll gcd(ll a, ll b) {
	a = abs(a);
	b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}

template <typename T>
void fwt(vector<T>& f) {
	int n = f.size();
	for (int i = 1; i < n; i <<= 1) {
		for (int j = 0; j < n; j++) {
			if ((j & i) == 0) {
				T x = f[j], y = f[j | i];
				f[j] = x + y, f[j | i] = x - y;
			}
		}
	}
}
template <typename T>
void ifwt(vector<T>& f) {
	int n = f.size();
	for (int i = 1; i < n; i <<= 1) {
		for (int j = 0; j < n; j++) {
			if ((j & i) == 0) {
				T x = f[j], y = f[j | i];
				f[j] = (x + y) / 2, f[j | i] = (x - y) / 2;
			}
		}
	}
}

typedef vector<vector<modint>> mat;
typedef vector<modint> vec;
mat mtmul(mat& A, mat& B) {
	mat C(A.size(), vec(B[0].size()));
	rep(i, (int)A.size()) {
		rep(k, (int)B.size()) {
			rep(j, (int)B[0].size()) {
				C[i][j] += A[i][k] * B[k][j];
			}
		}
	}
	return C;
}
mat mtpow(mat A, ll n) {
	mat B(A.size(), vec(A.size()));
	rep(i, (int)A.size()) {
		B[i][i] = 1;
	}
	while (n > 0) {
		if (n & (ll)1)B = mtmul(B, A);
		A = mtmul(A, A);
		n >>= 1;
	}
	return B;
}

modint dp[30][55][55];
vector<modint> sdp[55];
void init() {
	sdp[0].push_back(1);
	sdp[0].push_back(1);
	sdp[1].push_back(1);
	sdp[1].push_back(1);
	for (int len = 2; len <= 50; len++) {
		sdp[len] = sdp[len - 1];
		if (len % 2) {
			for (int i = len - 2; i <= len; i++) {
				if (i >= sdp[len].size())sdp[len].resize(i + 1);
				sdp[len][i] += 1;
			}
		}
	}
	dp[1][0][0] = 1;
	dp[1][1][0] = 1;
	for (int w = 2; w <= 50; w++) {
		rep(loc, w) {
			//go left
			if (loc % 2 == 0) {
				dp[1][w][loc] += dp[1][w-(loc+1)][0];
			}
			//go right
			if ((w - 1 - loc) % 2 == 0) {
				dp[1][w][loc] += dp[1][loc][0];
			}
		}
	}
	//cout << dp[1][1][0] << "\n";
	for (int h = 2; h <= 25; h++) {
		for (int w = 2; w <= 50; w++) {
			rep(loc, w) {
				//go left
				if (loc % 2 == 0) {
					rep(ad, sdp[w - (loc + 1)].size()) {
						int nex = w - 1 - ad;
						if(nex>=0)dp[h][w][loc] += dp[h - 1][w][nex] * sdp[w - (loc + 1)][ad];
					}
				}
				//go right
				if ((w - 1 - loc) % 2 == 0) {
					rep(ad, sdp[loc].size()) {
						int nex = ad;
						if (nex < w)dp[h][w][loc] += dp[h - 1][w][nex] * sdp[loc][ad];
					}
				}
			}
		}
	}
}
void solve() {
	int h, w; cin >> h >> w; cin >> mod;
	if (w == 1) {
		cout << 1 << "\n"; return;
	}
	if (h % 2) {
		cout << 0 << "\n"; return;
	}
	init();
	modint ans = 0;
	rep(j, w)ans += dp[h/2][w][j];
	cout << ans << "\n";
}



signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}

yukicoder

結果

テストケース

ソースコード