wrong answer of URAL 1802

最新推荐文章于 2020-01-27 10:07:07 发布

skyfisherman

最新推荐文章于 2020-01-27 10:07:07 发布

阅读量565

点赞数

本文链接：https://blog.youkuaiyun.com/skyfisherman/article/details/18795099

版权

本文介绍了一种用于解决三维网格中填充与空置问题的算法，通过构建网格、定义操作规则、实现填充与空置功能，并通过实例演示了如何通过特定方向进行网格状态转换，最终输出解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

# include <iostream>
# include <cstdio>
using namespace std;
const int MAXN = 21;
int A[6],B[6];
const int C[][3] = {
{0,2,4},{2,0,5},
{2,4,0},{4,2,1},
{4,0,2},{0,4,3}};
#define rep(i,n) for(int i=0;i<n;i++)


int n, c[MAXN][MAXN][MAXN];
int Grid[MAXN * MAXN * MAXN];
void init() {
	cin >> n;
    int sum = 0;


	rep(k,6) rep(i,n) rep(j,n) cin >> c[k][i][j];
	rep(k,6) rep(i,n) rep(j,n) sum += c[k][i][j];
    if(sum != n*n*n) n = 0;
	A[0] = 1; 		A[1] = -1; 
	A[2] = n; 		A[3] = -A[2];
	A[4] = n * n;	A[5] = -A[4];


	B[0] = B[2] = B[4] = 0;
	B[1] = A[0] * (n - 1);
	B[3] = A[2] * (n - 1);
	B[5] = A[4] * (n - 1);
}


# define grid Grid[I+J+K]
bool fill(int index,int A[],int B[],int c[][MAXN]){
	int i, j, k, I, J, K;
	for(i = 0, I = B[0]; i < n; i++, I += A[0])
		for(j = 0, J = B[1]; j < n; j++, J += A[1])
			for(k = 0, K = B[2]; k < c[i][j]; k++, K += A[2]) {
				if(grid) return false; grid = index;
			}
	return true;
}


void empty(int index,int A[],int B[],int c[][MAXN]){
	int i, j, k, I, J, K;
	for(i = 0, I = B[0]; i < n; i++, I += A[0])
		for(j = 0, J = B[1]; j < n; j++, J += A[1])
			for(k = 0, K = B[2]; k < c[i][j]; k++, K += A[2]) 
				if(grid == index) grid = 0;
}


bool fill(int index,int dir) {
	int ca[3], cb[3];
	rep(i,3) ca[i] = A[C[dir][i]];
	rep(i,3) cb[i] = B[C[dir][i]];
	return fill(index+1,ca,cb,c[index]);
}


void empty(int index,int dir) {
	int ca[3], cb[3];
	rep(i,3) ca[i] = A[C[dir][i]];
	rep(i,3) cb[i] = B[C[dir][i]];
	empty(index+1,ca,cb,c[index]);
}


void shift(int c[][MAXN]) {
	static int t[MAXN][MAXN];
	rep(i,n) rep(j,n) t[i][j] = c[i][j];
	rep(i,n) rep(j,n) c[i][j] = t[j][n-1-i];
}


bool used[6];
bool dfs(int dir) {
	if(dir == 6) return true;
	rep(i,6) if(!used[i])
		rep(k,4) {
			used[i] = true;
			if(fill(i,dir))
				if(dfs(dir+1))return true;
			empty(i,dir);
			shift(c[i]);
			used[i] = false;
		}
	return false;
}


void put_ans() {
	puts("Yes");
	int cnt = 0;
	for(int i=0; i<n; i++)
		for(int j=0; j<n; j++) {
            cout << Grid[cnt++];
			for(int k=1; k<n; k++)
				cout << ' ' << Grid[cnt++];
			cout << endl;
		}
}


int main() {
	init();
	fill(0,0);
	used[0] = true;
    if(n&&dfs(1))
		put_ans();
	else
		puts("No");	
	return 0;
}