zoukankan      html  css  js  c++  java
  • 1010:Tempter of the Bone

    Problem Description
    The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He realized that the bone was a trap, and he tried desperately to get out of this maze.

    The maze was a rectangle with sizes N by M. There was a door in the maze. At the beginning, the door was closed and it would open at the T-th second for a short period of time (less than 1 second). Therefore the doggie had to arrive at the door on exactly the T-th second. In every second, he could move one block to one of the upper, lower, left and right neighboring blocks. Once he entered a block, the ground of this block would start to sink and disappear in the next second. He could not stay at one block for more than one second, nor could he move into a visited block. Can the poor doggie survive? Please help him.
     
    Input
    The input consists of multiple test cases. The first line of each test case contains three integers N, M, and T (1 < N, M < 7; 0 < T < 50), which denote the sizes of the maze and the time at which the door will open, respectively. The next N lines give the maze layout, with each line containing M characters. A character is one of the following:

    'X': a block of wall, which the doggie cannot enter; 
    'S': the start point of the doggie; 
    'D': the Door; or
    '.': an empty block.

    The input is terminated with three 0's. This test case is not to be processed.
     
    Output
    For each test case, print in one line "YES" if the doggie can survive, or "NO" otherwise.
     
    Sample Input
    4 4 5 S.X. ..X. ..XD .... 3 4 5 S.X. ..X. ...D 0 0 0
     
    Sample Output
    NO YES

     醉了,,用广搜弄了半天,后面发现居然是第t秒到达;

    痛苦,虽然错了,但还是保存一下代码吧;

     wrong answer代码::::注意
    1
    #include<iostream> 2 #include<cstdio> 3 #include<queue> 4 using namespace std; 5 #define inf 1000000000 6 typedef pair<int, int > P; 7 int N, M, t, dis[1000][1000]; 8 int bx, by, ex, ey; 9 char a[1000][1000]; 10 int dd[4][2] = { {0,1},{1,0},{-1,0},{0,-1} }; 11 int dfs() 12 { 13 for (int i = 0; i < N; i++) 14 for (int j = 0; j < M; j++) dis[i][j] = inf; 15 queue<P> p; 16 dis[bx][by] = 0; 17 p.push(P(bx, by)); 18 while (p.size()) 19 { 20 P te = p.front(); p.pop(); 21 if (te.first == ex && te.second == ey) break; 22 for (int i = 0; i < 4; i++) 23 { 24 int xx = te.first + dd[i][0], yy = te.second+ dd[i][1]; 25 if (xx >= 0 && xx < N &&yy >= 0 && yy < M&&a[xx][yy]!='X'&&dis[xx][yy] == inf) 26 { 27 dis[xx][yy] = dis[te.first][te.second] + 1; 28 p.push(P(xx, yy)); 29 } 30 } 31 } 32 return dis[ex][ey]; 33 } 34 int main() 35 { 36 int mis; 37 while (cin >> N >> M >> mis,N!=0&&M!=0&&mis!=0) 38 { 39 for(int i = 0;i<N ;i++) 40 for (int j = 0; j < M; j++) 41 { 42 cin >> a[i][j]; 43 if (a[i][j] == 'S') 44 bx = i, by = j; 45 if (a[i][j] == 'D') 46 ex = i, ey = j; 47 } 48 if (dfs() <= mis) 49 cout <<dfs() << endl; 50 else 51 cout << "NO" << endl; 52 } 53 return 0; 54 }
  • 相关阅读:
    CSS3—— 2D转换 3D转换 过渡 动画
    CSS3——边框 圆角 背景 渐变 文本效果
    CSS3——表单 计数器 网页布局 应用实例
    CSS3——提示工具 图片廓 图像透明 图像拼接技术 媒体类型 属性选择器
    CSS3——对齐 组合选择符 伪类 伪元素 导航栏 下拉菜单
    CSS3——分组和嵌套 尺寸 display显示 position定位 overflow float浮动
    CSS3——盒子模型 border(边框) 轮廓(outline)属性 margin外边距 padding填充
    Eclipse连接数据库报错Local variable passwd defined in an enclosing scope must be final or effectively final
    数据库——单表查询
    数据库——添加,修改,删除
  • 原文地址:https://www.cnblogs.com/kangdong/p/8873914.html
Copyright © 2011-2022 走看看