ZOJ1047 Image Perimeters

 #include<iostream>

#include<queue>

using namespace std;

int row,column,r_click,c_click;

char rec[21][21];

bool flag[21][21];

int sum;

//8个方向

int h[8]={1,1,1,0,0,-1,-1,-1};

int s[8]={1,0,-1,1,-1,1,0,-1};

struct node{

int r;

int c;

node(int x,int y){

r=x;

c=y;

};

};

queue<node> myqueue;

//计算某个‘X’周围的边长

int calForOne(int r,int c)

{

int lineNum=0;

if(r==1 || rec[r-1][c]=='.')

lineNum++;

if(r==row || rec[r+1][c]=='.')

lineNum++;

if(c==1 || rec[r][c-1]=='.')

lineNum++;

if(c==column || rec[r][c+1]=='.')

lineNum++;

return lineNum;

}

bool IsnotVisited(int r,int c)

{

if(r>0 && r<=row && c>0 && c<=column){

if(rec[r][c]=='X' && flag[r][c]==false) //好未被计算过

return true;

}

return false;

}

void calSum(int r,int c)

{

if(IsnotVisited(r,c)){

flag[r][c]=true;  //标志已经被计算过

sum+=calForOne(r,c);

myqueue.push(node(r,c));

}

while(!myqueue.empty()){

//枚举8个周围的格子

int i,j;

for(i=0;i<8;i++){

for(j=0;j<8;j++){

int a=myqueue.front().r;

int b=myqueue.front().c;

if(IsnotVisited(a+h[i],b+s[i])){

flag[a+h[i]][b+s[i]]=true;

sum+=calForOne(a+h[i],b+s[i]);

myqueue.push(node(a+h[i],b+s[i]));

}

}

}

myqueue.pop();

}

}

int main()

{

int i,j;

while(cin>>row>>column>>r_click>>c_click)

{

memset(flag,false,sizeof(flag));

if(row==0 && column==0 && r_click==0 && c_click==0)

break;

for(i=1;i<=row;i++){

for(j=1;j<=column;j++){

cin>>rec[i][j];

}

}

sum=0;

calSum(r_click,c_click);

cout<<sum<<endl;

}

return 0;

}