杭电 hdu 1312 Red and Black

来源:互联网 发布:danee的发展前景知乎 编辑:程序博客网 时间:2024/05/21 10:17
/* THE PROGRAM IS MADE BY PYY *//*----------------------------------------------------------------------------//Copyright (c) 2011 panyanyany All rights reserved.URL   : http://acm.hdu.edu.cn/showproblem.php?pid=1312Name  : 1312 Red and BlackDate  :Sunday, August 14, 2011Time Stage : half an hourResult:44124182011-08-14 15:52:18 Accepted 1312 15MS 196K 1248 B C++ pyyTest Data:Review:这个……水题啊水题~~~//----------------------------------------------------------------------------*/#include <stdio.h>#include <string.h>#include <conio.h>#define max(a, b) (((a) > (b)) ? (a) : (b))#define min(a, b) (((a) < (b)) ? (a) : (b))#define infinity0x7f7f7f7f#define minus_inf0x80808080#define MAXSIZE 22int w, h, startx, starty, cnt ;char map[MAXSIZE][MAXSIZE] ;void dfs (int x, int y){if (map[x][y] != '.' || x < 1 || x > h || y < 1 || y > w)return ;++cnt ;map[x][y] = '#' ;dfs (x-1, y) ;dfs (x, y-1) ;dfs (x+1, y) ;dfs (x, y+1) ;}int main (){int i, j ;while (scanf ("%d%d", &w, &h), w+h){getchar () ;for (i = 1 ; i <= h ; ++i){for (j = 1 ; j <= w ; ++j){scanf ("%c", &map[i][j]) ;if (map[i][j] == '@'){startx = i ;starty = j ;map[i][j] = '.' ;}}getchar () ;}cnt = 0 ;dfs (startx, starty) ;printf ("%d\n", cnt) ;}return 0 ;}

原创粉丝点击