import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String arg[]) {
Scanner scanner = new Scanner(System.in);
List<Integer[][]> maps = new ArrayList<Integer[][]>();
while (scanner.hasNext()) {
int dim = scanner.nextInt();
if (dim == 0) {
break;
}
scanner.nextLine();
Integer[][] map = new Integer[dim][dim];
for (int i = 0; i < dim; i++) {
String line = scanner.nextLine();
for (int j = 0; j < dim; j++) {
String sig = line.substring(j, j + 1);
if (".".equals(sig)) {
map[i][j] = 0;
} else if ("X".equals(sig)) {
map[i][j] = 1;
} else {
throw new RuntimeException(
"\".\" and \"X\" are expected, while get : "
+ sig);
}
}
}
maps.add(map);
}
for (Integer[][] map : maps) {
cal(map);
}
}
private static void cal(Integer[][] map) {
// int[][] map =
// // {//
// // { 0, 1, 0, 0 }, //
// // { 0, 0, 0, 0 }, //
// // { 1, 1, 0, 0 },//
// // { 0, 0, 0, 0 } };
// { { 0, 1, 0 }, { 1, 0, 1 }, { 0, 1, 0 } };
int size = map.length;
// 标记位置好坏
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++) {
if (map[i][j] == 1) {
continue;
}
for (int jj = j - 1; jj >= 0; jj--) {
if ((map[i][jj] & 1) == 1) {
map[i][j] += 0x10;
break;
}
}
for (int jj = j + 1; jj < size; jj++) {
if ((map[i][jj] & 1) == 1) {
map[i][j] += 0x10;
break;
}
}
for (int ii = i - 1; ii >= 0; ii--) {
if ((map[ii][j] & 1) == 1) {
map[i][j] += 0x10;
break;
}
}
for (int ii = i + 1; ii < size; ii++) {
if ((map[ii][j] & 1) == 1) {
map[i][j] += 0x10;
break;
}
}
}
}
/*
*
*/
for (int i = 0; i < size; i++) {
B: for (int j = 0; j < size; j++) {
if ((map[i][j] & 1) == 1) {// if wall
continue;
}
map[i][j] |= 0x100;
for (int jj = j - 1; jj >= 0; jj--) {
if ((map[i][jj] & 1) == 1) {
break;
} else {
if ((map[i][j] & 0xF0) < (map[i][jj] & 0xF0)
|| (map[i][jj] >= 0x100)) {
map[i][j] &= 0x0FF;
continue B;
}
}
}
for (int jj = j + 1; jj < size; jj++) {
if ((map[i][jj] & 1) == 1) {
break;
} else {
if ((map[i][j] & 0xF0) < (map[i][jj] & 0xF0)
|| (map[i][jj] >= 0x100)) {
map[i][j] &= 0x0FF;
continue B;
}
}
}
for (int ii = i - 1; ii >= 0; ii--) {
if ((map[ii][j] & 1) == 1) {
break;
} else {
if ((map[i][j] & 0xF0) < (map[ii][j] & 0xF0)
|| (map[ii][j] >= 0x100)) {
map[i][j] &= 0x0FF;
continue B;
}
}
}
for (int ii = i + 1; ii < size; ii++) {
if ((map[ii][j] & 1) == 1) {
break;
} else {
if ((map[i][j] & 0xF0) < (map[ii][j] & 0xF0)
|| (map[ii][j] >= 0x100)) {
map[i][j] &= 0x0FF;
continue B;
}
}
}
}
}
int max = 0;
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++) {
if ((map[i][j] & 0x100) == 0x100) {
max++;
}
}
}
System.out.println(max);
}
}1002
最新推荐文章于 2024-08-15 08:50:04 发布

523

被折叠的 条评论
为什么被折叠?



