uva11520 Fill the Square

题意：给定一个nXn的网格中填了一些大写字母，你的任务是把剩下的格子也填满大写字母，使得任意两个相邻格子的字母不同，如果有多种填法，则要求按从上到下，从左到右的顺序把所有格子连接起来的字母串的字典序最小

思路：要按照字典序最小的话其实很简单，只需要填字母的时候从上到下，然后从左到右填就可以了

#include <cstdio>
#include <queue>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <set>
#include <ctime>
#include <cmath>
#include <cctype>
using namespace std;
#define maxn 100
#define LL long long
int cas=1,T;
char mapp[maxn][maxn];

int main()
{
	//freopen("in","r",stdin);
	scanf("%d",&T);
	while (T--)
	{
        int n;
		scanf("%d",&n);
		for (int i = 0;i<n;i++)
			for (int j = 0;j<n;j++)
				scanf(" %c",&mapp[i][j]);

		for (int i = 0;i<n;i++)
			for (int j = 0;j<n;j++)
			{
				if (mapp[i][j]=='.')
				{
					for (char k='A';k<='Z';k++)
					{
						bool ok =true;
						if (i!=0 && mapp[i-1][j]==k)
							ok=false;
						if (i!=n-1 && mapp[i+1][j]==k)
							ok=false;
						if (j!=0 && mapp[i][j-1]==k)
							ok=false;
						if (j!=n-1&& mapp[i][j+1]==k)
							ok=false;
						if (ok)
						{
							mapp[i][j]=k;
							break;
						}
					}
				}
			}
		printf("Case %d:\n",cas++);
		for (int i = 0;i<n;i++)
		{
			for (int j = 0;j<n;j++)
				printf("%c",mapp[i][j]);
			printf("\n");
		}
	}
	//printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}

In this problem, you have to draw a square using uppercase English Alphabets.
To be more precise, you will be given a square grid with some empty blocks and others already filled
for you with some letters to make your task easier. You have to insert characters in every empty cell
so that the whole grid is filled with alphabets. In doing so you have to meet the following rules:
1. Make sure no adjacent cells contain the same letter; two cells are adjacent if they share a common
edge.
2. There could be many ways to fill the grid. You have to ensure you make the lexicographically
smallest one. Here, two grids are checked in row major order when comparing lexicographically.
Input
The first line of input will contain an integer that will determine the number of test cases. Each case
starts with an integer n (n ≤ 10), that represents the dimension of the grid. The next n lines will
contain n characters each. Every cell of the grid is either a ‘.’ or a letter from [A, Z]. Here a ‘.’
represents an empty cell.
Output
For each case, first output ‘Case #:’ (# replaced by case number) and in the next n lines output the
input matrix with the empty cells filled heeding the rules above.
Sample Input
2
3
...
...
...
3
...
A..
...

Sample Output
Case 1:
ABA
BAB
ABA
Case 2:
BAB
ABA
BAB