Submission #1072599

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int dp[1<<25];
int main(){
  int MOD=1000000007;
  int used[25],p[25];
  int st[5][5];
  for(int i=0;i<5;i++){
    for(int j=0;j<5;j++){
      cin>>st[i][j];
      st[i][j]--;
      if(st[i][j]<0) continue;
      used[st[i][j]]=1;
      p[st[i][j]]=i*5+j;
    }
  }
  memset(dp,0,sizeof(dp));
  dp[0]=1;
  for(int i=0;i<25;i++){
    int b=(1<<i)-1;
    while(b<(1<<25)){
      //bitset<25> bi(b);
      //cout<<bi.to_string()<<" "<<bi.count()<<" "<<dp[b]<<endl;
      if(dp[b]){
	for(int j=0;j<25;j++){
	  if((b>>j)&1) continue;
	  if(used[i]&&p[i]!=j) continue;
	  bool f=1;
	  int y=j/5,x=j%5;
	  
	  if(0<y&&y<4) f&=!(((b>>((y-1)*5+x))&1)^((b>>((y+1)*5+x))&1));
	  if(0<x&&x<4) f&=!(((b>>(y*5+x-1))&1)^((b>>(y*5+x+1))&1));
	  
	  if(f) (dp[b+(1<<j)]+=dp[b])%=MOD;
	}
      }
      if(!b) break;
      int x=b&-b;
      int y=b+x;
      b=(((b&~y)/x)>>1)|y;
    }
  }
  cout<<dp[(1<<25)-1]<<endl;
  return 0;
}

Submission Info

Judge Result