panyanyany 发表于 2013-1-26 12:35:15

杭电 hdu 1035 Robot Motion

嘿嘿,一次AC……哦耶~~~

总得来说不算是难题,不过在处理坐标的时候出了问题,呃,这个代码中会有略微提到,因为比较简单,就不多说了,相信通过自己测试数据,也能理解的。

/* THE PROGRAM IS MADE BY PYY *//*----------------------------------------------------------------------------//Copyright (c) 2011 panyanyany All rights reserved.URL   : http://acm.hdu.edu.cn/showproblem.php?pid=1035Name: 1035 Robot MotionDate: Wednesday, August 10, 2011Time Stage : 2 hoursResult:43819362011-08-10 21:22:25 Accepted 1035 0MS 212K 1666 B C++ pyyTest Data:Review://----------------------------------------------------------------------------*/#include <stdio.h>#include <string.h>#define infinity0x7f7f7f7f#define minus_inf0x8f8f8f8f#define MAXSIZE 11char c ;int row, col, start, step, loop ;char grip, used ;int route ;void dfs (int x, int y){++step ;if (used){loop = step - route ;step = route - 1 ;}else if (1 <= x && x <= col && 1 <= y && y <= row){used = 1 ;route = step ;if ((c = grip) == 'E')dfs (x+1, y) ;else if (c == 'W')dfs (x-1, y) ;else if (c == 'S')dfs (x, y+1) ;else if (c == 'N')dfs (x, y-1) ;}else{--step ;}}int main (){int i, j ;while (scanf ("%d%d%d", &row, &col, &start), row | col | start){getchar () ;for (i = 1 ; i <= row ; ++i){for (j = 1 ; j <= col ; ++j)scanf ("%c", &grip) ; // 此处注意j 和i 的顺序scanf ("%c", &c) ;}memset (used, 0, sizeof (used)) ;step = loop = 0 ;dfs (start, 1) ;printf ("%d step(s) ", step) ;if (loop)printf ("before a loop of %d step(s)\n", loop) ;else printf ("to exit\n") ;}return 0 ;}
页: [1]
查看完整版本: 杭电 hdu 1035 Robot Motion