Submission #3733354

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
using namespace std;
typedef long long Int;
typedef pair<Int,Int> P;
const Int inf=0xfffffffffff;
int grid[6][6]={0};
bool used[26]={0};
vector<P> nonused;
int main(){
  for(int i=0;i<5;i++){
    for(int j=0;j<5;j++){
      cin>>grid[i][j];
      used[grid[i][j]]=1;
      if(grid[i][j]==0) nonused.push_back(P(i,j));
    }
  }
  vector<int> num;
  for(int i=1;i<26;i++){
    if(used[i]==0) num.push_back(i);
  }
  Int ans=0;
  if(num.size()>0){
    do{
      int gr2[5][5];
      for(int i=0;i<5;i++){
        for(int j=0;j<5;j++) gr2[i][j]=grid[i][j];
      }
      for(int i=0;i<num.size();i++){
        gr2[nonused[i].first][nonused[i].second]=num[i];
      }
      bool f=true;
      for(int i=0;i<5;i++){
        for(int j=0;j<3;j++){
          if(gr2[i][j]>gr2[i][j+1]&&gr2[i][j+1]>gr2[i][j+2]) f=false;
          if(gr2[i][j]<gr2[i][j+1]&&gr2[i][j+1]<gr2[i][j+2]) f=false;
        }
      }
      for(int i=0;i<3;i++){
        for(int j=0;j<5;j++){
          if(gr2[i][j]>gr2[i+1][j]&&gr2[i+1][j]>gr2[i+2][j]) f=false;
          if(gr2[i][j]<gr2[i+1][j]&&gr2[i+1][j]<gr2[i+2][j]) f=false;
        }
      }
      if(f) ans++;
      ans%=1000000007;
    }while(next_permutation(num.begin(),num.end()));
  }
  else{
    bool f=true;
    int gr2[5][5];
    for(int i=0;i<5;i++){
      for(int j=0;j<5;j++) gr2[i][j]=grid[i][j];
    }
    for(int i=0;i<5;i++){
      for(int j=0;j<3;j++){
        if(gr2[i][j]>gr2[i][j+1]&&gr2[i][j+1]>gr2[i][j+2]) f=false;
        if(gr2[i][j]<gr2[i][j+1]&&gr2[i][j+1]<gr2[i][j+2]) f=false;
      }
    }
    for(int i=0;i<3;i++){
      for(int j=0;j<5;j++){
        if(gr2[i][j]>gr2[i+1][j]&&gr2[i+1][j]>gr2[i+2][j]) f=false;
        if(gr2[i][j]<gr2[i+1][j]&&gr2[i+1][j]<gr2[i+2][j]) f=false;
      }
    }
    if(f) ans=1;
  }
  cout<<ans<<endl;
}

Submission Info

Judge Result