#757462 (C++17) No.1916 Making Palindrome on Gird

• 問題: No.1916 Making Palindrome on Gird
• ユーザー: inksamurai
• 提出日時: 2022-04-30 20:04:44
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 195 ms / 3,000 ms
• コード長: 3,003 bytes
• コンパイル時間: 2,335 ms
• コンパイル使用メモリ: 215,208 KB
• 実行使用メモリ: 69,632 KB
• 最終ジャッジ日時: 2024-06-30 00:51:44
• 合計ジャッジ時間: 5,729 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	3 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	32 ms; 37,504 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	61 ms; 35,584 KB
testcase_14	AC	31 ms; 17,920 KB
testcase_15	AC	74 ms; 37,376 KB
testcase_16	AC	70 ms; 50,944 KB
testcase_17	AC	141 ms; 65,024 KB
testcase_18	AC	160 ms; 69,632 KB
testcase_19	AC	165 ms; 69,632 KB
testcase_20	AC	162 ms; 69,504 KB
testcase_21	AC	169 ms; 69,632 KB
testcase_22	AC	169 ms; 69,504 KB
testcase_23	AC	52 ms; 68,352 KB
testcase_24	AC	52 ms; 68,224 KB
testcase_25	AC	52 ms; 68,224 KB
testcase_26	AC	53 ms; 69,504 KB
testcase_27	AC	53 ms; 68,864 KB
testcase_28	AC	187 ms; 69,504 KB
testcase_29	AC	181 ms; 69,632 KB
testcase_30	AC	184 ms; 69,632 KB
testcase_31	AC	190 ms; 69,632 KB
testcase_32	AC	195 ms; 69,632 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,x,n) for(int i=x;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3k5NXAD ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e

//snuke's mod int
template <ll mod>
struct modint{
	ll x; // typedef long long ll;
	modint(ll x=0):x((x%mod+mod)%mod){}
	modint operator-()const{return modint(-x);}
	modint& operator+=(const modint a){if((x+=a.x)>=mod) x-=mod; return *this;}
	modint& operator-=(const modint a){if((x+=mod-a.x)>=mod) x-=mod; return *this;}
	modint& operator*=(const modint a){(x*=a.x)%=mod; return *this;}
	modint operator+(const modint a)const{modint res(*this); return res+=a;}
	modint operator-(const modint a)const{modint res(*this); return res-=a;}
	modint operator*(const modint a)const{modint res(*this); return res*=a;}
	modint pow(ll n)const{
		modint res=1,x(*this);
		while(n){
			if(n&1)res*=x;
			x*=x;
			n>>=1;
		}
		return res;
	}
	modint inv()const{return pow(mod-2);}
};

using mint=modint<1000'000'007>;

signed main(){
_3k5NXAD;
	int h,w;
	std::cin>>h>>w;
	vec(string) a;
	rep(i,h){
		string s;
		std::cin>>s;
		a.emplace_back(s);
	}
	vec(vec(vec(mint))) dp(w+2,vec(vec(mint))(w+2,vec(mint)((h+w)/2+2)));
	if(a[0][0]!=a[h-1][w-1]){
		print(0);
		return 0;
	}
	if(h==1 and w==1){
		print(1);
		return 0;
	}
	dp[0][0][0]=1;
	rep(k,(h+w)/2+1){
		rep(i,w+1){
			if(i>k) break;
			rep(j,w+1){
				if(j>k) break;
				int sh=k-i,sw=i;
				int th=h-1-(k-j),tw=w-1-j;
				if(sh<0 or sh>=h or sw<0 or sw>=w) continue;
				if(th<0 or th>=h or tw<0 or tw>=w) continue;
				//rl
				if(sw+1<w and tw-1>=0 and a[sh][sw+1]==a[th][tw-1]){
					dp[i+1][j+1][k+1]+=dp[i][j][k];
				}
				//dl
				if(sh+1<h and tw-1>=0 and a[sh+1][sw]==a[th][tw-1]){
					dp[i][j+1][k+1]+=dp[i][j][k];
				}
				//ru
				if(sw+1<w and th-1>=0 and a[sh][sw+1]==a[th-1][tw]){
					dp[i+1][j][k+1]+=dp[i][j][k];
				}
				// du
				if(sh+1<h and th-1>=0 and a[sh+1][sw]==a[th-1][tw]){
					dp[i][j][k+1]+=dp[i][j][k];
				}
			}
		}
	}
	const int di[]={1,-1,0,0};
	const int dj[]={0,0,1,-1};
	auto adj=[&](int sx,int sy,int tx,int ty)->bool{
		rep(dir,4){
			int nx=sx+di[dir],ny=sy+dj[dir];
			if(nx==tx and ny==ty){
				return 1;
			}
		}
		return 0;
	};
	mint ans=0;
	int k=(h+w-1)/2-1;
	rep(i,w+1){
		rep(j,w+1){
			int sh=k-i,sw=i;
			int th=h-1-(k-j),tw=w-1-j;
			if(sh<0 or sh>=h or sw<0 or sw>=w) continue;
			if(th<0 or th>=h or tw<0 or tw>=w) continue;
			if((h+w-1)%2==0){
				if(adj(sh,sw,th,tw)){
					ans+=dp[i][j][k];
				}
			}else{
				rep(dir,4){
					int nx=sh+di[dir],ny=sw+dj[dir];
					if(adj(nx,ny,th,tw)){
						ans+=dp[i][j][k];
					}
				}
			}
		}
	}
	print(ans.x);
//
	return 0;
}