Submission #1126835

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int zero_count=0;
int zero_ele[8];
int used[26];
int not_used[8];
int g[8];
int x[25];
int ans=0;
int is_ascend(){
  for(int p=0;p<=20;p+=5){
    for(int d=0;d<=2;d++){
      if(x[p+d]<x[p+d+1] && x[p+d+1]<x[p+d+2])return 1;
    }
  }
  for(int p=0;p<=4;p++){
    for(int d=0;d<=10;d+=5){
      if(x[p+d]<x[p+d+5] && x[p+d+5]<x[p+d+10])return 1;
    }
  }
   return 0;
}
int is_descend(){
   for(int p=0;p<=20;p+=5){
    for(int d=0;d<=2;d++){
      if(x[p+d]>x[p+d+1] && x[p+d+1]>x[p+d+2])return 1;
    }
  }
    for(int p=0;p<=4;p++){
    for(int d=0;d<=10;d+=5){
      if(x[p+d]>x[p+d+5] && x[p+d+5]>x[p+d+10])return 1;
    }
  }
   return 0;
}
void print_x(){
  for(int i=0;i<25;i++){
    cout << x[i] << " ";
    if(i%5==4)cout << endl;
  }
  cout << endl;
}
int o;
void C(int a){
  
  if(a==zero_count){
    o++;
    if(is_ascend()==0 && is_descend()==0)ans++;
    // print_x();
  }
  for(int i=0;i<zero_count;i++){
    if(x[zero_ele[a]]==0 && g[i]==0){
      g[i]=1;
      x[zero_ele[a]]=not_used[i];
      C(a+1);
      g[i]=0;
      x[zero_ele[a]]=0;
    }
  }
}
int main(){
  int j=0;
  for(int i=0;i<25;i++){
    cin >> x[i];
    if(x[i]==0)zero_ele[zero_count++]=i;
    
    else used[x[i]]=1;
  }
  for(int i=1;i<=25;i++){
    if(used[i]==0) not_used[j++]=i;
  }
  if(j>8)return 0;
  //for(int i=0;i<j;i++)cout << zero_ele[i] << " ";
  C(0);
  cout << ans << endl;
  //cout << o << endl;
  return 0;
}

Submission Info

Judge Result