結果

問題 No.1916 Making Palindrome on Gird
ユーザー kiyoshi0205kiyoshi0205
提出日時 2022-04-29 22:14:16
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
RE  
実行時間 -
コード長 5,484 bytes
コンパイル時間 8,820 ms
コンパイル使用メモリ 352,652 KB
実行使用メモリ 67,516 KB
最終ジャッジ日時 2024-06-29 03:45:37
合計ジャッジ時間 19,437 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,812 KB
testcase_02 AC 3 ms
6,940 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 RE -
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 2 ms
6,944 KB
testcase_12 AC 2 ms
6,940 KB
testcase_13 AC 17 ms
12,852 KB
testcase_14 AC 11 ms
8,364 KB
testcase_15 AC 84 ms
18,960 KB
testcase_16 RE -
testcase_17 AC 164 ms
32,168 KB
testcase_18 AC 475 ms
46,348 KB
testcase_19 AC 454 ms
46,172 KB
testcase_20 AC 453 ms
46,952 KB
testcase_21 AC 459 ms
46,496 KB
testcase_22 AC 462 ms
46,992 KB
testcase_23 AC 2 ms
6,940 KB
testcase_24 AC 2 ms
6,944 KB
testcase_25 AC 2 ms
6,940 KB
testcase_26 AC 2 ms
6,940 KB
testcase_27 AC 2 ms
6,944 KB
testcase_28 AC 1,404 ms
67,452 KB
testcase_29 AC 1,395 ms
67,516 KB
testcase_30 AC 1,396 ms
67,020 KB
testcase_31 AC 1,396 ms
66,356 KB
testcase_32 AC 1,406 ms
66,568 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// using cint=multiprecisioninteger::cpp_int;
using namespace std;
using ll=long long;
using datas=pair<ll,ll>;
using ddatas=pair<long double,long double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define uniq(v) vsort(v),(v).erase(unique(all(v)),(v).end())
#define endl "\n"
#define popcount __builtin_popcountll
#define eb emplace_back
#define print(x) cout<<x<<endl
#define printyes print("Yes")
#define printno print("No")
#define printYES print("YES")
#define printNO print("NO")
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
// constexpr ll mod=1000000007;
constexpr ll mod=998244353;
constexpr ll inf=1LL<<60;
constexpr long double eps=1e-9;
const long double PI=acosl(-1);
template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";}
template<class T> ostream& operator<<(ostream& os,const vector<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> ostream& operator<<(ostream& os,const set<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> ostream& operator<<(ostream& os,const multiset<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T,class E> ostream& operator<<(ostream& os,const map<T,E>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> inline bool chmax(T& a,const T b){bool x=a<b;if(x)a=b;return x;}
template<class T> inline bool chmin(T& a,const T b){bool x=a>b;if(x)a=b;return x;}
#ifdef DEBUG
void debugg(){cout<<endl;}
template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);}
#define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif

inline void startupcpp(void) noexcept{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(15);
}

ll modinv(ll a,const ll m=mod) noexcept{
  ll b=m,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+m)%m;
}

ll moddevide(const ll a,const ll b) noexcept{return (a*modinv(b))%mod;}

vec modncrlistp,modncrlistm;

ll modncr(const ll n,const ll r) noexcept{
  if(n<r||r<0)return 0;
  ll i,size=modncrlistp.size();
  if(size<=n){
    modncrlistp.resize(n+1);
    modncrlistm.resize(n+1);
    if(!size){
      modncrlistp[0]=modncrlistm[0]=1;
      size++;
    }
    For(i,size,n+1)modncrlistp[i]=modncrlistp[i-1]*i%mod;
    modncrlistm[n]=modinv(modncrlistp[n]);
    for(i=n;i>size;--i)modncrlistm[i-1]=modncrlistm[i]*i%mod;
  }
  return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;
}

ll modpow(ll a,ll n,const ll m=mod){
  if(n<0)return 0;
  ll res=1;
  while(n>0){
    if(n&1)res=res*a%m;
    a=a*a%m;
    n>>=1;
  }
  return res;
}

constexpr ll gcd(const ll a,const ll b) noexcept{return (!b)?abs(a):(a%b==0)?abs(b):gcd(b,a%b);}
constexpr ll lcm(const ll a,const ll b) noexcept{return a/gcd(a,b)*b;}

#include<atcoder/all>
using mint=atcoder::modint1000000007;
ostream& operator<<(ostream& os,const mint& v){
  return os<<v.val();
}

int H,W;
int main(){
  startupcpp();
  int i,j,a,b;
  cin>>H>>W;
  vector<string> g(H);
  rep(i,H){
    cin>>g[i];
  }
  if(g[0][0]!=g[H-1][W-1]){
    print(0);
    return 0;
  }
  vector<tuple<int,int,int,int>> getid;
  getid.reserve(H*W*min(H,W));
  rep(i,H)rep(j,W)rep(a,H){
    b=H+W-2-i-j-a;
    if(b<0||b>=W||i+j>a+b)continue;
    if(g[i][j]==g[a][b])getid.emplace_back(i,j,a,b);
  }
  vector<mint> dp(getid.size(),0);
  vector<int> vis(getid.size(),0);
  i=lower_bound(all(getid),make_tuple(0,0,H-1,W-1))-getid.begin();
  dp[i]=1;
  queue<int> que;
  que.emplace(i);
  vis[i]=1;
  mint ans=0;
  while(!que.empty()){
    auto id=que.front();que.pop();
    tie(i,j,a,b)=getid[id];
    if(i+j==a+b||i+j+1==a+b){
      if(i==a||j==b)ans+=dp[id];
      continue;
    }
    for(auto [x1,y1]:{make_pair(i+1,j),make_pair(i,j+1)}){
      if(x1==H||y1==W)continue;
      for(auto [x2,y2]:{make_pair(a-1,b),make_pair(a,b-1)}){
        if(a==-1||b==-1)continue;
        if(g[x1][y1]==g[x2][y2]){
          size_t nxtid=lower_bound(all(getid),make_tuple(x1,y1,x2,y2))-getid.begin();
          if(nxtid<=getid.size()){
            dp[nxtid]+=dp[id];
            if(chmax(vis[nxtid],1))que.emplace(nxtid);
          }
        }
      }
    }
  }
  print(ans);
}
0