LA 2995 Image Is Everything *

题目地址：http://vjudge.net/problem/UVALive-2995

用个pos数组保存每一个小正方形的假设颜色

view表示在k面，i行j列看到的颜色，假如一个小正方形从一个面看到的颜色和另外一个面的颜色并不一样

那么这个小正方形肯定没有，直接删去，反复此操作，直到所有的颜色从各个面看过来都一样

#include <bits/stdc++.h>
using namespace std;
const int maxn=10+1;
#define REP(i,n) for(int i=0;i<(n);i++)
int n;
char pos[maxn][maxn][maxn];
char view[6][maxn][maxn];
//view[k][i][j] k面，i行，j列
char inline read(){
	char ch;
	do{
		ch=getchar();
	}while(ch!='.'&&!isalpha(ch));
	return ch;
}
void get(int k,int i,int j,int len,int& x,int& y,int& z){
	if(k==0) x=len,y=j,z=i;         else
	if(k==1) x=n-1-j,y=len,z=i;     else
	if(k==2) x=n-1-len,y=n-1-j,z=i; else
	if(k==3) x=j,y=n-1-len,z=i;     else
	if(k==4) x=n-1-i,y=j,z=len;     else
	         x=i,y=j,z=n-1-len;
}
int main(int argc, char const *argv[])
{
	int x,y,z;
	while(scanf("%d",&n)==1&&n)
	{
		REP(i,n) REP(k,6) REP(j,n) view[k][i][j]=read();
		REP(i,n) REP(j,n) REP(k,n) pos[i][j][k]='#';  //means donot know the color of the block

		REP(k,6) REP(i,n) REP(j,n) if(view[k][i][j]=='.')
		REP(deep,n) {
			get(k,i,j,deep,x,y,z);
			pos[x][y][z]='.';   //means block isnot exist
		} 

		bool done;
		for(;;)
		{
			done=true;
			REP(k,6) REP(i,n) REP(j,n)
			if(view[k][i][j]!='.'){  //if there's a block
				REP(deep,n){
					get(k,i,j,deep,x,y,z);
					if(pos[x][y][z]=='.') continue;
					if(pos[x][y][z]=='#') {pos[x][y][z]=view[k][i][j]; break;} 
					//update the color
					if(pos[x][y][z]==view[k][i][j]) break;
					pos[x][y][z]='.'; //delete the block
					done=false;
				}
			}
			if(done) break;
		}

		int ans=0;
		REP(i,n) REP(j,n) REP(k,n)
		if(pos[i][j][k]!='.') ans++;

		printf("Maximum weight: %d gram(s)\n", ans);
	}
	return 0;
}