結果
問題 | No.1916 Making Palindrome on Gird |
ユーザー | milanis48663220 |
提出日時 | 2022-04-29 21:44:21 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 266 ms / 3,000 ms |
コード長 | 5,225 bytes |
コンパイル時間 | 1,366 ms |
コンパイル使用メモリ | 127,296 KB |
実行使用メモリ | 72,320 KB |
最終ジャッジ日時 | 2024-06-29 03:04:50 |
合計ジャッジ時間 | 6,353 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
01_ | AC * 10 |
other | AC * 23 |
ソースコード
#include <iostream>#include <algorithm>#include <iomanip>#include <vector>#include <queue>#include <deque>#include <set>#include <map>#include <tuple>#include <cmath>#include <numeric>#include <functional>#include <cassert>#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }using namespace std;typedef long long ll;template<typename T>vector<vector<T>> vec2d(int n, int m, T v){return vector<vector<T>>(n, vector<T>(m, v));}template<typename T>vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));}template<typename T>void print_vector(vector<T> v, char delimiter=' '){if(v.empty()) {cout << endl;return;}for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;cout << v.back() << endl;}const ll MOD = 1000000007;class ModInt{public:ll v;ModInt(ll _v = 0){if(_v < 0) _v = (_v%MOD)+MOD;if(_v >= MOD) _v %= MOD;v = _v;}ModInt operator+(ll n){return ModInt((v+n)%MOD);}ModInt operator-(ll n){return ModInt((v-n+MOD)%MOD);}ModInt operator*(ll n){if(n >= MOD) n %= MOD;return ModInt((v*n)%MOD);}ModInt operator/(ll n){return ModInt((ModInt(n).inv()*v).v%MOD);}ModInt &operator+=(ll n){v = (v+n)%MOD;return *this;}ModInt &operator-=(ll n){v = (v-n+MOD)%MOD;return *this;}ModInt &operator*=(ll n){v = (v*n+MOD)%MOD;return *this;}ModInt operator+(ModInt n){return ModInt((v+n.v)%MOD);}ModInt operator-(ModInt n){return ModInt((v-n.v+MOD)%MOD);}ModInt operator*(ModInt n){return ModInt((v*n.v)%MOD);}ModInt operator/(ModInt n){return ModInt((n.inv()*v).v%MOD);}ModInt &operator+=(ModInt n){v = (v+n.v)%MOD;return *this;}ModInt &operator-=(ModInt n){v = (v-n.v+MOD)%MOD;return *this;}ModInt &operator*=(ModInt n){v = (v*n.v)%MOD;return *this;}bool operator==(ModInt n){return v == n.v;}bool operator!=(ModInt n){return v != n.v;}ModInt &operator=(ll n){v = n%MOD;return *this;}ModInt inv(){if(v == 1) return ModInt(1);else return ModInt(MOD-ModInt(MOD%v).inv().v*(MOD/v)%MOD);}};ostream& operator<<(ostream& os, const ModInt& m){os << m.v;return os;}istream & operator >> (istream &in, ModInt &m){in >> m.v;return in;}ModInt pow(ModInt a, ll n) {assert(n >= 0);ModInt ans = 1;while (n > 0) {if (n&1) ans = ans*a;a = a*a;n >>= 1;}return ans;}#define N_MAX 200002ModInt inv[N_MAX],fac[N_MAX],finv[N_MAX];void init(){fac[0]=1;fac[1]=1;finv[0]=1;finv[1]=1;inv[1]=1;for(int i=2;i<N_MAX;i++){inv[i]=ModInt(MOD)-inv[MOD%i]*(MOD/i);fac[i]=fac[i-1]*(ll) i;finv[i]=finv[i-1]*inv[i];}}ModInt comb(ll n, ll r){if(n < r){return ModInt(0);}else{return fac[n]*finv[r]*finv[n-r];}}using mint = ModInt;int dx[2] = {1, 0};int dy[2] = {0, 1};int main(){ios::sync_with_stdio(false);cin.tie(0);cout << setprecision(10) << fixed;int h, w; cin >> h >> w;vector<string> s(h);for(int i = 0; i < h; i++) cin >> s[i];if(s[0][0] != s[h-1][w-1]){cout << 0 << endl;return 0;}auto dp = vec3d(h, w, h, mint(0));dp[0][0][h-1] = 1;for(int h1 = 0; h1 < h; h1++){for(int w1 = 0; w1 < w; w1++){for(int h2 = 0; h2 < h; h2++){int w2 = h+w-2 - (h1+w1) - h2;if(w2 < 0 || w2 >= w) continue;for(int i = 0; i < 2; i++){if(h1+dx[i] >= h) continue;if(w1+dy[i] >= w) continue;for(int j = 0; j < 2; j++){if(h2-dx[j] < 0) continue;if(w2-dy[j] < 0) continue;if(s[h1+dx[i]][w1+dy[i]] != s[h2-dx[j]][w2-dy[j]]) continue;dp[h1+dx[i]][w1+dy[i]][h2-dx[j]] += dp[h1][w1][h2];}}}}}mint ans = 0;for(int h1 = 0; h1 < h; h1++){for(int w1 = 0; w1 < w; w1++){for(int h2 = 0; h2 < h; h2++){int w2 = h+w-2 - (h1+w1) - h2;if(w2 < 0 || w2 >= w) continue;if(h1 == h2 && w1 == w2) ans += dp[h1][w1][h2];if(h1 == h2 && w1+1 == w2) ans += dp[h1][w1][h2];if(h1+1 == h2 && w1 == w2) ans += dp[h1][w1][h2];}}}cout << ans << endl;}