Fill the Square UVA - 11520 填充正方形

版权声明：本文为博主原创文章，未经博主允许不得转载，欢迎添加友链。 https://blog.csdn.net/qq_42835910/article/details/89762779

     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 lledfor you with some letters to make your task easier. You have to insert characters in every empty cell so that the whole grid is lled 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 commonedge.
2. There could be many ways to ll the grid. You have to ensure you make the lexicographicallysmallest one. Here, two grids are checked in row major order when comparing lexicographically.

分析：字典序遍历即可

#include <cstdio>
#include <cstring>
using namespace std;
const int N = 15;
char grid[N][N];

int main(int argc, char** argv) {
	int T;
	scanf("%d",&T);
	for(int kase = 1; kase <= T; kase++){
		int n;
		scanf("%d",&n);
		for(int i = 1; i <= n; i++)
			scanf("%s",grid[i]+1);

		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= n; j++){
				if(grid[i][j] == '.'){ 
					for(char c = 'A'; c <= 'Z'; c++){
						if(grid[i-1][j] == c) continue; //字母冲突 
						if(grid[i+1][j] == c) continue;
						if(grid[i][j-1] == c) continue;
						if(grid[i][j+1] == c) continue;
						grid[i][j] = c;
						break; 
					}
				}
			}
		}
		printf("Case %d:\n", kase);
		for(int i = 1; i <= n; i++)
			printf("%s\n",grid[i]+1);
	}
	return 0;
}

Input
The rst 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, rst output `Case #:' (# replaced by case number) and in the next n lines output the
input matrix with the empty cells lled heeding the rules above.
Sample Input
2
3
...
...
...
3
...
A..
...
Sample Output
Case 1:
ABA
BAB
ABA
Case 2:
BAB
ABA
BAB