BZOJ 1501 智慧珠游戏

Description

Input

文件中包含初始的盘件描述，一共有10行，第i行有i个字符。如果第i行的第j个字符是字母”A”至”L”中的一个，则表示第i行第j列的格子上已经放了零件，零件的编号为对应的字母。如果第i行的第j个字符是”.”，则表示第i行第j列的格子上没有放零件。输入保证预放的零件已摆放在盘件中。

Output

如果能找到解，向输出文件打印10行，为放完全部12个零件后的布局。其中，第i行应包含i个字符，第i行的第j个字符表示第i行第j列的格子上放的是哪个零件。如果无解，输出单独的一个字符串‘No solution’(不要引号，请注意大小写)。所有的数据保证最多只有一组解。

Sample Input

.
..
...
....
.....
.....C
...CCC.
EEEHH...
E.HHH....
E.........

Sample Output

B
BK
BKK
BJKK
JJJDD
GJGDDC
GGGCCCI
EEEHHIIA
ELHHHIAAF
ELLLLIFFFF

HINT

 

Source

暴搜+打表+卡时大法好，哈哈！！！这题老师居然把他当noip模拟题来考，也是醉了～考完后对着数据调也是一晚上和半上午的。。。

 #include<cstdio>
 #include<cstdlib>
 #include<cstring>

 using namespace std;

 int s[][],times;
 int mod[][][][],have[],num[]={,,,,,,,,,,,,};
 bool use[];

 inline void finish()
 {
     for (int i = ;i <= ;++i)
     {
         for (int j = ;j <= i;++j)
             printf("%c",s[i][j]+'A'-);
         putchar('\n');
     }
 }

 inline bool okay(int a,int b,int x,int y)
 {
     int t = num[a],i;
     for (i = ;i <= t;++i)
     {
         int tx = x + mod[a][b][i][];
         int ty = y + mod[a][b][i][];
         if (tx <  || tx > ) return false;
         if (ty <  || ty > tx) return false;
         if (s[tx][ty] != ) return false;
     }
     return true;
 }

 inline void give(int a,int b,int x,int y)
 {
     int t = num[a],i;
     for (i = ;i <= t;++i)
     {
         int tx = x + mod[a][b][i][];
         int ty = y + mod[a][b][i][];
         s[tx][ty] = a;
     }
 }

 inline void ready()
 {
     have[] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = -;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = -;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;

     //////////////////////////////////////////////////
     have[] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;

     //////////////////////////////////////////////////
     have[] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = -;
     mod[][][][] = ; mod[][][][] = -;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = -;

     //////////////////////////////////////////////////
     have[] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;

     ///////////////////////////////////////////////////
     have[] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = -;
     mod[][][][] = ; mod[][][][] = -;

     ////////////////////////////////////////////
     have[] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = -;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = -;
     mod[][][][] = ; mod[][][][] = -;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = -;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = -;
     mod[][][][] = ; mod[][][][] = -;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = -;
     mod[][][][] = ; mod[][][][] = ;

     ///////////////////////////////////////////////////////////
     have[] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;

     ////////////////////////////////////////////////////////////
     have[] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = -;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = -;
     mod[][][][] = ; mod[][][][] = -;

     /////////////////////////////////////////////
     have[] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = -;
     mod[][][][] = ; mod[][][][] = -;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = -;
     mod[][][][] = ; mod[][][][] = -;
     mod[][][][] = ; mod[][][][] = -;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = -;
     mod[][][][] = ; mod[][][][] = -;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = -;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;

     ////////////////////////////////////////////////////////////
     have[] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = -;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;

     ////////////////////////////////////////////////////////////
     have[] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = -;
     mod[][][][] = ; mod[][][][] = -;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = -;
     mod[][][][] = ; mod[][][][] = -;
     mod[][][][] = ; mod[][][][] = -;

     /////////////////////////////////////////////////////////
     have[] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = -;
     mod[][][][] = ; mod[][][][] = -;
     mod[][][][] = ; mod[][][][] = -;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     //
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = ;
     mod[][][][] = ; mod[][][][] = -;
 }

 inline void next(int,int);

 inline void dfs(int,int);

 inline void att(int,int);

 int main()
 {
     freopen("1501.in","r",stdin);
     freopen("1501.out","w",stdout);
     for (int i = ;i <= ;++i)
     {
         for (int j = ;j <= i;++j)
         {
             char c= getchar();
             if (c == '.') s[i][j] = ;
             else s[i][j] = c-'A'+,use[c-'A'+] = true;
         }
         getchar();
     }
     ready();
     dfs(,);
     printf("No solution");
     fclose(stdin); fclose(stdout);
     return ;
 }

 inline void next(int x,int y)
 {
     if (y == x)
         dfs(x+,);
     else dfs(x,y+);
 }

 inline void dfs(int x,int y)
 {
     if (x > )
     {
         finish(),exit();
         return;
     }
     if (times > ) return;
     times++;
     if (s[x][y] == )
         att(x,y);
     else next(x,y);
 }

 inline void att(int x,int y)
 {
     int temp[][];
     memcpy(temp,s,sizeof(temp));
     int i,j;
     for (i = ;i>=;--i)
     {
         if (use[i]) continue;
         for (j = ;j <= have[i];++j)
             if (okay(i,j,x,y))
             {
                 use[i] = true;
                 give(i,j,x,y);
                 next(x,y);
                 memcpy(s,temp,sizeof(s));
                 use[i] = false;
             }
     }
 }