题意:
给一个n*n的矩阵,含小数点及A-Z的字母,让你使用A-Z的字母填充小数点使得矩阵每个位置的字母与它的上下左右的字母都不相等,且字典序最小,输出填充后的矩阵。
思路:
枚举26个字母A-Z,依次判断是否可以填入矩阵的位置,保证了字典序的最小
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int n;
char grid[15][15];
int main() {
int cas, index=0;
scanf("%d", &cas);
while (cas--) {
scanf("%d", &n);
getchar();
memset(grid, '.', sizeof(grid));
int i, j;
for (i = 1; i <= n; i++) {
for ( j = 1; j <= n; j++) {
scanf("%c",&grid[i][j]);
}
getchar();
}
char ch;
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
if (grid[i][j] == '.') {
for (ch = 'A'; ch <= 'Z'; ch++) {
bool ok = true;
if (i > 1 && grid[i - 1][j] == ch)
ok = false;
if (j > 1 && grid[i][j-1] == ch)
ok = false;
if (i < n && grid[i +1][j] == ch)
ok = false;
if (j < n && grid[i][j + 1] == ch)
ok = false;
if (ok) {
grid[i][j] = ch;
break;
}
}
}
}
}
printf("Case %d:\n", ++index);
for (i = 1; i <= n; i++) {
for ( j = 1; j <= n; j++)
printf("%c", grid[i][j]);
printf("\n");
}
}
return 0;
}