結果
| 問題 |
No.1759 Silver Tour
|
| コンテスト | |
| ユーザー |
 tokusakurai
|
| 提出日時 | 2021-11-19 08:43:12 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,176 bytes |
| コンパイル時間 | 2,668 ms |
| コンパイル使用メモリ | 198,424 KB |
| 最終ジャッジ日時 | 2025-01-25 19:31:14 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 28 WA * 12 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define each(e, v) for (auto &e : v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
template <typename T>
bool chmax(T &x, const T &y) {
return (x < y) ? (x = y, true) : false;
}
template <typename T>
bool chmin(T &x, const T &y) {
return (x > y) ? (x = y, true) : false;
}
template <typename T>
int flg(T x, int i) {
return (x >> i) & 1;
}
template <typename T>
void print(const vector<T> &v, T x = 0) {
int n = v.size();
for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
if (v.empty()) cout << '\n';
}
template <typename T>
void printn(const vector<T> &v, T x = 0) {
int n = v.size();
for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}
template <typename T>
int lb(const vector<T> &v, T x) {
return lower_bound(begin(v), end(v), x) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, T x) {
return upper_bound(begin(v), end(v), x) - begin(v);
}
template <typename T>
void rearrange(vector<T> &v) {
sort(begin(v), end(v));
v.erase(unique(begin(v), end(v)), end(v));
}
template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
int n = v.size();
vector<int> ret(n);
iota(begin(ret), end(ret), 0);
sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
return ret;
}
template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
return make_pair(p.first + q.first, p.second + q.second);
}
template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
return make_pair(p.first - q.first, p.second - q.second);
}
template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
S a;
T b;
is >> a >> b;
p = make_pair(a, b);
return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
return os << p.first << ' ' << p.second;
}
struct io_setup {
io_setup() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(15);
}
} io_setup;
const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
const int MOD = 1000000007;
// const int MOD = 998244353;
struct Runtime_Mod_Int {
int x;
Runtime_Mod_Int() : x(0) {}
Runtime_Mod_Int(long long y) {
x = y % get_mod();
if (x < 0) x += get_mod();
}
static inline int &get_mod() {
static int mod = 0;
return mod;
}
static void set_mod(int md) { get_mod() = md; }
Runtime_Mod_Int &operator+=(const Runtime_Mod_Int &p) {
if ((x += p.x) >= get_mod()) x -= get_mod();
return *this;
}
Runtime_Mod_Int &operator-=(const Runtime_Mod_Int &p) {
if ((x += get_mod() - p.x) >= get_mod()) x -= get_mod();
return *this;
}
Runtime_Mod_Int &operator*=(const Runtime_Mod_Int &p) {
x = (int)(1LL * x * p.x % get_mod());
return *this;
}
Runtime_Mod_Int &operator/=(const Runtime_Mod_Int &p) {
*this *= p.inverse();
return *this;
}
Runtime_Mod_Int &operator++() { return *this += Runtime_Mod_Int(1); }
Runtime_Mod_Int operator++(int) {
Runtime_Mod_Int tmp = *this;
++*this;
return tmp;
}
Runtime_Mod_Int &operator--() { return *this -= Runtime_Mod_Int(1); }
Runtime_Mod_Int operator--(int) {
Runtime_Mod_Int tmp = *this;
--*this;
return tmp;
}
Runtime_Mod_Int operator-() const { return Runtime_Mod_Int(-x); }
Runtime_Mod_Int operator+(const Runtime_Mod_Int &p) const { return Runtime_Mod_Int(*this) += p; }
Runtime_Mod_Int operator-(const Runtime_Mod_Int &p) const { return Runtime_Mod_Int(*this) -= p; }
Runtime_Mod_Int operator*(const Runtime_Mod_Int &p) const { return Runtime_Mod_Int(*this) *= p; }
Runtime_Mod_Int operator/(const Runtime_Mod_Int &p) const { return Runtime_Mod_Int(*this) /= p; }
bool operator==(const Runtime_Mod_Int &p) const { return x == p.x; }
bool operator!=(const Runtime_Mod_Int &p) const { return x != p.x; }
Runtime_Mod_Int inverse() const {
assert(*this != Runtime_Mod_Int(0));
return pow(get_mod() - 2);
}
Runtime_Mod_Int pow(long long k) const {
Runtime_Mod_Int now = *this, ret = 1;
for (; k > 0; k >>= 1, now *= now) {
if (k & 1) ret *= now;
}
return ret;
}
friend ostream &operator<<(ostream &os, const Runtime_Mod_Int &p) { return os << p.x; }
friend istream &operator>>(istream &is, Runtime_Mod_Int &p) {
long long a;
is >> a;
p = Runtime_Mod_Int(a);
return is;
}
};
using mint = Runtime_Mod_Int;
int main() {
int H, W, M;
cin >> H >> W >> M;
mint::set_mod(M);
if (H & 1) {
cout << "0\n";
return 0;
}
vector<vector<mint>> dp(H, vector<mint>(W, 0));
rep(i, W) dp[0][i] = 1;
rep(i, H / 2) {
rep(j, W) {
if (j % 2 == 0) {
for (int k = W - 1; k > j; k -= 2) dp[2 * i + 1][k] += dp[2 * i][j];
if (j == W - 1) dp[2 * i + 1][j] += dp[2 * i][j];
}
if ((W - 1 - j) % 2 == 0) {
for (int k = 0; k < j; k += 2) dp[2 * i + 1][k] += dp[2 * i][j];
if (j == 0) dp[2 * i + 1][j] += dp[2 * i][j];
}
}
if (i < (H / 2) - 1) {
rep(j, W) {
rep2(k, -1, 1) {
if (j + k < 0 || j + k >= W) continue;
dp[2 * i + 2][j + k] += dp[2 * i + 1][j];
}
}
}
}
cout << accumulate(all(dp[H - 1]), mint(0)) << '\n';
}