1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T46f,#include using namespace std; #define ll long long const int MX = 304, MOD = 1000000007; int R, C; ll p3[MX*(MX+1)]; char a[2][MX][MX]; ll h[2][MX][MX]; ll f(ll t) { while(t < 0) t += MOD; while(t >= MOD) t -= MOD; return t; } ll h2d(int t, ll i, ll j, ll u, ll v) { ll val = f(h[t][i][j] - h[t][u-1][j] - h[t][i][v-1] + h[t][u-1][v-1]); return (val * p3[R*C-(u*C+v)]) % MOD; } int main() { scanf("%d %d", &R, &C); for(int i=1; i<=R; i++) { scanf("%s", a[0][i] + 1); assert(strlen(a[0][i]+1) == C); } for(int i=1; i<=R; i++) { for(int j=1; j<=C; j++) { a[1][i][j] = a[0][R+1-i][C+1-j]; } } p3[0] = 1; for(int i=1; i

코드 #3540