#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <bitset>
#include <list>
#include <map>
#include <set>
#include <iterator>
#include <algorithm>
#include <functional>
#include <utility>
#include <sstream>
#include <climits>
#include <cassert>
#define MID(x,y) ( ( x + y ) >> 1 )
#define L(x) ( x << 1 )
#define R(x) ( x << 1 | 1 )
#define BUG puts("here!!!");
#define STOP system("pause");
using namespace std;
const int N = 25;
int n, m, ans;
string mat[N];
void search(int i, int j) {
if(i < 0 || i >= m || j < 0 || j >= n || mat[i][j] == '#') {
return;
}
mat[i][j] = '#';
++ans;
search(i - 1, j);
search(i + 1, j);
search(i, j - 1);
search(i, j + 1);
}
int main() {
while(cin >> n >> m, m|n) {
int yr, yl;
for(int i = 0; i < m; i++) {
cin >> mat[i];
for(int j = 0; j < n; j++) {
if(mat[i][j] == '@') {
yr = i, yl = j;
}
}
}
ans = 0;
search(yr, yl);
cout << ans << endl;
}
return 0;
}
poj 1979 [ Basic DFS 填平代标记 ]
最新推荐文章于 2013-01-18 18:26:10 发布