mayan 游戏 search

纯搜索，，，模拟，，还不算太难，，就是细节略繁琐

　　首先因为题目要求保证字典序，所以显然把右边的块换到左边不如把左边的块换到右边优，

所以可以进行不小规模的剪枝，之后显然交换两块相同的色块没有意义，至此基本可以通过，在clear过程中最好对即将删除的色块打标记再统一删除，以避免出现意外情况，同时每次clear之后要在进行fall处理，因为每次操作可能引发连锁反应

　　两次没过样例， 第一次手抖把x 打成了x + 1, 第二次写fall时忘记将之前落下的删掉

　　WA掉一次，读入时以为每行最多7个数，忘记考虑结尾的0

 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 //#define debug
 //#define debug2

 const int maxn = ;
 int n;
 int m[maxn][maxn][maxn];
 int f[maxn][maxn];
 int ans[][];

 bool cl(int x) {
     memset(f, , sizeof(f));
     for (int i = ; i <= ; i++)
         for (int j = ; j <= ; j++) {
             if (m[x][i][j] == ) break;
             if (f[i][j] !=  && i >  && m[x][i-][j] == m[x][i][j] && m[x][i-][j] == m[x][i][j]) {
                 f[i-][j] = ;
                 f[i-][j] = ;
                 f[i][j] = ;
                 int cur = i + ;
                 while (cur <=  && m[x][cur][j] == m[x][i][j]) {
                     f[cur][j] = ;
                     cur++;
                 }
                 cur = i - ;
                 while (cur >  && m[x][cur][j] == m[x][i][j]) {
                     f[cur][j] = ;
                     cur--;
                 }
             }
             if (f[i][j] !=  && j >  && m[x][i][j-] == m[x][i][j] && m[x][i][j-] == m[x][i][j]) {
                 f[i][j-] = ;
                 f[i][j-] = ;
                 f[i][j] = ;
                 int cur = j + ;
                 while (cur <=  && m[x][i][cur] == m[x][i][j]) {
                     f[i][cur] = ;
                     cur++;
                 }
                 cur = j - ;
                 while (cur >  && m[x][i][cur] == m[x][i][j]) {
                     f[i][cur] = ;
                     cur--;
                 }
             }
         }
     bool is_c = ;
     for (int i = ; i <= ; i++)
         for (int j = ; j <= ; j++) {
             if (f[i][j] > ) {
                 is_c = ;
                 m[x][i][j] = ;
             }
         }
     return (is_c);
 }

 void fall(int x) {
     for (int i = ; i <= ; i++) {
         int cur = ;
         for (int j = ; j <= ; j++) {
             if (m[x][i][j] > ) {
                 cur++;
                 m[x][i][cur] = m[x][i][j];
                 if (j != cur) m[x][i][j] = ;
             }
         }
     }
 }

 void dfs(int x) {
 #ifdef debug
     for (int i = ; i <= n; i++) {
         printf("%d %d %d\n", ans[i][], ans[i][], ans[i][]);
     }
     printf("\n\n");
 #endif
 #ifdef debug2
     if (ans[][] ==  && ans[][] ==  && ans[][] == ) {
         printf("kkk\n");
     }
 #endif
     if (x == n + ) {
         fall(x);
         cl(x);
         fall(x);
         while (cl(x)) fall(x);
         for (int i = ; i <= ; i++)
             for (int j = ; j <= ; j++) {
                 if (m[x][i][j] > ) return;
             }
         for (int i = ; i <= n; i++) {
             printf("%d %d %d\n", ans[i][], ans[i][], ans[i][]);
         }
         exit();
     }
     for (int i = ; i <= ; i++)
         for (int j = ; j <= ; j++) {
             if (m[x][i][j] == ) continue;
             if (i <  && m[x][i+][j] == ) {
                 memcpy(m[x+], m[x], sizeof(m[x]));
                 m[x+][i+][j] = m[x][i][j];
                 m[x+][i][j] = ;
                 fall(x + );
                 while (cl(x + )) fall(x + );
                 ans[x][] = i - ;
                 ans[x][] = j - ;
                 ans[x][] = ;
                 dfs(x + );
             }
             if (i <  && m[x][i+][j] >  && m[x][i+][j] != m[x][i][j]) {
                 memcpy(m[x+], m[x], sizeof(m[x]));
                 m[x+][i+][j] = m[x][i][j];
                 m[x+][i][j] = m[x][i+][j];
                 fall(x + );
                 while (cl(x + )) fall(x + );
                 ans[x][] = i - ;
                 ans[x][] = j - ;
                 ans[x][] = ;
                 dfs(x + );
             }
             if (i >  && m[x][i-][j] == ) {
                 memcpy(m[x+], m[x], sizeof(m[x]));
                 m[x+][i-][j] = m[x][i][j];
                 m[x+][i][j] = ;
                 fall(x + );
                 while (cl(x + )) fall(x + );
                 ans[x][] = i - ;
                 ans[x][] = j - ;
                 ans[x][] = -;
                 dfs(x + );
             }
         }
 }

 int main () {
     scanf("%d", &n);
     for (int i = ; i <= ; i++) {
         for (int j = ; j <= ; j++) {
             scanf("%d", &m[][i][j]);
             if (m[][i][j] == ) break;
         }
     }
     dfs();
     printf("-1\n");
     return ;
 }

 /*
 1
 1 0
 2 1 0
 2 1 4 0
 3 4 0
 2 3 3 4 0
 */