Labyrinth （URAL 1033）

Labyrinth Time limit: 1.0 second Memory limit: 64 MB Administration of the labyrinth has decided to start a new season with new wallpapers. For this purpose they need a program to calculate the square of the walls inside the labyrinth. This job is just for you! The labyrinth is represented by a matrix  N× N (3 ≤  N ≤ 33, you see, ‘3’ is a magic digit!). Some matrix cells contain a dot character (‘.’) that denotes an empty square. Other cells contain a diesis character (‘#’) that denotes a square filled by monolith block of stone wall. All squares are of the same size 3×3 meters. The walls are constructed around the labyrinth (except for the upper left and lower right corners, which are used as entrances) and on the cells with a diesis character. No other walls are constructed. There always will be a dot character at the upper left and lower right corner cells of the input matrix. Your task is to calculate the square of visible part of the walls inside the labyrinth. In other words, the square of the walls' surface visible to a visitor of the labyrinth. Note that there's no holes to look or to move through between any two adjacent blocks of the wall. The blocks are considered to be adjacent if they touch each other in any corner. See picture for an example: visible walls inside the labyrinth are drawn with bold lines. The height of all the walls is 3 meters. Input The first line of the input contains the single number  N. The next  N lines contain  N characters each. Each line describes one row of the labyrinth matrix. In each line only dot and diesis characters will be used and each line will be finished with a new line character. There will be no spaces in the input. Output Your program should print to the output a single integer — the exact value of the square of the wallpaper needed. Sample input output 5 ..... ...## ..#.. ..### ..... 198

/****
题目的意思是，求能面对的所有墙的面积，即求出墙有多少面，然后乘以每一面墙的面积。
     对于迷宫，深度优先搜索，
     但是会出现起点到达不了终点的位置，所以，进行搜索时，需要从起点搜一次，从
     重点开始再搜一次。搜索时走过的路进行标记，对于每一步，其上下左右有几面墙，
     就计数几次。

     注意：上下左右如何实现，如下“一”处；
     注意：地图数组开打一些，防止出现越界。
****/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>

using namespace std;

int x[4]= {1,-1,0,0};//  "一"
int y[4]= {0,0,1,-1};//  "一"   实现上下左右控制的方法
int n;
char Map[35][35]= {0};  //数组开大一些
int path[35][35]= {0};
int ans=0;

void DFS(int X,int Y)
{
    int i;
    path[X][Y]=1;
    for(i=0; i<4; i++)
    {
        if(Map[X+x[i]][Y+y[i]]=='.'&&path[X+x[i]][Y+y[i]]==0)
            DFS(X+x[i],Y+y[i]);
        else if(Map[X+x[i]][Y+y[i]]=='#')
            ans++;
    }
}

void read()
{
    int j,k;
    string s;
    scanf("%d",&n);
    memset(Map,'#',sizeof(Map));
    for(j=1; j<=n; j++)
    {
        cin>>s;
        for(k=1; k<=n; k++)
            Map[j][k]=s[k-1];
    }
}

void print()
{
    //cout<<ans<<endl;
    printf("%d\n",(ans-4)*9);
}
int main()
{
    read();
    DFS(1,1);
    if(path[n][n]==0)    //如果发现终点没有走过，说明起点到达不了终点，需要从终点再搜一次
        DFS(n,n);
    print();
    return 0;
}