Submission #434075

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <climits>
#include <vector>
#include <numeric>
#include <complex>
#include <map>
#include <bitset>
using namespace std;

//#define __int64 long long
#define long __int64
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
const int Vecy[4] = {0,-1,0,1};
const int Vecx[4] = {1,0,-1,0};

//部分点のみ
int main(){
	int x[5][5];
	bool use[26] = {false};
	int pointy[8] = {0};
	int pointx[8] = {0};
	int index[8] = {0,1,2,3,4,5,6,7};
	int ans = 0;
	int number[8];
	int aki = 0;
	bool flg;
	
	for(int iy=0; iy<5; iy++){
		for(int ix=0; ix<5; ix++){
			cin >> x[iy][ix];
			use[ x[iy][ix] ] = true;
		}
	}
	
	for(int iy=0; iy<5; iy++){
		for(int ix=0; ix<5; ix++){
			if(x[iy][ix] == 0){
				pointy[aki] = iy;
				pointx[aki] = ix;
				aki ++;
			}
		}
	}
	
	int aa = 0;
	for(int i=1; i<=25; i++){
		if(!use[i]){
			number[aa] = i;
			aa ++;
		}
	}
	
	if(aa > 8){
		cout << "muri";
		return 0;
	}
	
	do {
		//入れてみる
		for(int i=0; i<aki; i++){
			x[pointy[i]][pointx[i]] = number[ index[i] ];
		}
		
		//横テスト
		flg = true;
		for(int iy=0; iy<5; iy++){
			for(int ix=1; ix<=3; ix++){
				if(x[iy][ix-1] < x[iy][ix] && x[iy][ix] < x[iy][ix+1]){
					flg = false;
					break;
				}
				if(x[iy][ix-1] > x[iy][ix] && x[iy][ix] > x[iy][ix+1]){
					flg = false;
				}
			}
		}
		
		if(!flg){
			continue;
		}
		
		//縦テスト
		for(int iy=1; iy<=3; iy++){
			for(int ix=0; ix<5; ix++){
				if(x[iy-1][ix] < x[iy][ix] && x[iy][ix] < x[iy+1][ix]){
					flg = false;
					break;
				}
				if(x[iy-1][ix] > x[iy][ix] && x[iy][ix] > x[iy+1][ix]){
					flg = false;
					break;
				}
			}
		}
		
		if(flg){
			ans ++;
		}
		
		
	} while( next_permutation(index, index + aki ));     // 次の順列を生成
	
	cout << ans << endl;
    
    return 0;
}

Submission Info

Judge Result