nyoj-483--Nightmare--BFS+允许回头

题目链接：准备好了吗here~~~


#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,-1,1};
int map[10][10];
int n,m;
struct Nightmare
{int x,y;int step;//前进的步数int time;//每走一步剩余时间
};
int bfs(int a,int b)
{queue<Nightmare> Q;Nightmare  q,p;p.x=a;p.y=b;p.step=0;p.time=6;Q.push(p);while(!Q.empty()){q=Q.front();Q.pop();if(map[q.x][q.y]==3) return q.step;if(q.time==1) continue;for(int i=0;i<4;i++){p.x=q.x+dx[i];p.y=q.y+dy[i];p.time=q.time-1;p.step=q.step+1;if(map[p.x][p.y]){if(map[p.x][p.y]==4){p.time=6;map[p.x][p.y]=1;}Q.push(p);}}}return -1;
}
int main()
{int N,x,y;;scanf("%d",&N);while(N--){scanf("%d%d",&n,&m);memset(map,0,sizeof(map));for(int i=1;i<=n;i++){for(int j=1;j<=m;j++){scanf("%d",&map[i][j]);if(map[i][j]==2){x=i;y=j;}}}printf("%d\n",bfs(x,y));}
}

nyoj-483--Nightmare--BFS+允许回头相关推荐

Nightmare Ⅱ(BFS)
题目连接: Nightmare Ⅱ 题目: Last night, little erriyue had a horrible nightmare. He dreamed that he and hi ...
hdu - 1072 Nightmare(bfs)
http://acm.hdu.edu.cn/showproblem.php?pid=1072 遇到Bomb-Reset-Equipment的时候除了时间恢复之外,必须把这个点做标记不能再走,不然可能造 ...
NYOJ(21)，BFS，三个水杯
题目链接:http://acm.nyist.net/JudgeOnline/problem.php?pid=21 BFS判环,vis标记状态即可. #include <stdio.h> # ...
bottom sheets_Excel 2013中的SHEET和SHEETS函数
bottom sheets I've been experimenting with the new SHEET and SHEETS functions in Excel 2013, to see ...
Leetcode之跳跃游戏整理
1306. 跳跃游戏 III 题目: 这里有一个非负整数数组 arr,你最开始位于该数组的起始下标 start 处.当你位于下标 i 处时,你可以跳到 i + arr[i] 或者 i - arr[i] ...
HDU Problem - 3085 Nightmare Ⅱ（双向BFS）
题目链接 Problem Description Last night, little erriyue had a horrible nightmare. He dreamed that he and ...
G - Nightmare Ⅱ (双向BFS)
题目链接:SDTBU-ACM集训队暑期集训---第一讲 - Virtual Judge Last night, little erriyue had a horrible nightmare. He ...
专题训练二搜索进阶 HDU - 3085 Nightmare Ⅱ （双向BFS + 曼哈顿距离)
HDU - 3085 Nightmare Ⅱ (双向BFS + 曼哈顿距离) Problem Description Last night, little erriyue had a horrible ...
HDU 3085 Nightmare Ⅱ【BFS +曼哈顿距离+综合性较强】
Nightmare Ⅱ Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other) Total S ...
HDU3085 Nightmare Ⅱ —— 双向BFS + 曼哈顿距离
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3085 Nightmare Ⅱ Time Limit: 2000/1000 MS (Java/Other ...

nyoj-483--Nightmare--BFS+允许回头

nyoj-483--Nightmare--BFS+允许回头相关推荐

最新文章

热门文章