HDU 1072 BFS
标签： include
#include #include using namespace std; struct node { int x, y, time, step; }; int map[20][20]; int n, m, sx, sy, dx, dy; queue que; node now, next1; int dir[4][2] = {-1, 0, 1, 0, 0, -1, 0, 1};...i
标签： include
#include #include using namespace std; struct node { int x, y, time, step; }; int map[20][20]; int n, m, sx, sy, dx, dy; queue que; node now, next1; int dir[4][2] = {-1, 0, 1, 0, 0, -1, 0, 1};...i
点击打开题目链接 What Are You Talking About Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others) Total Submission(s): 9572 Accepted Submission(s): 3001
这道题判重方法比较特殊，因为一格可以反复的走，所以不能用bool判断，而是要根据炸弹剩余爆炸时间来判重，当走到一格的时候如果剩余时间小于等于之前在这个格子上的最大值，那么就不用把这个节点入队扩展状态了，...
代码：
Nightmare Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6968 Accepted Submission(s): 3344 Problem Description ...Ignatius had a n
题目链接：ｃｌｉｃｋ～ 题目解析：
Nightmare Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9944 Accepted Submission(s): 4838 Problem Description Ignatius had a n
对于状态的处理有点难想。。。 View Code 1 /* 2 bfs 3 */ 4 #include<stdio.h> 5 #include<string.h> 6 #include<queue> 7 #include<stdlib.h>... ...
题目链接 Nightmare Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6225 Accepted Submission(s): 3051 Problem Description ...
地址：http://acm.hdu.edu.cn/showproblem.php?pid=1072 Nightmare Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5463 Accepted Submission
Nightmare Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2506 Accepted Submission(s): 1248 Problem Description ...Ignatius had a nig...
悲催用dfs时间效率那么差，用bfs貌似也行- -！ #include #include #include #include const int inf=1;...int n,m,map[10][10],sx,sy,ex,ey,time[10][10],dx[]={-1,1,0,0},dy[]={0,0,-1,1},ans[10][10],min;...
很简单的一题，由于个人的优先队列的定义不正确导致错了！！！ 其实这题不用自己定义的！！！ #include #include #include using namespace std; struct node { int x,y; int time,step;...
Nightmare Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5445 Accepted Submission(s): 2704 Problem Description Ignatiu
裸的bfs，感觉每个点可以走多次，于是用个三维数据记录了，具体没细想，早睡早起，要开始复习期末了 /* author:jxy lang:C/C++ university:China,Xidian University **If you need to reprint,please indicate ...
题目地址：http://acm.hdu.edu.cn/showproblem.php?pid=1072 zheti
Nightmare Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5226 Accepted Submission(s): 2601 Problem Description Ignatius had a night
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1072 Nightmare
// Time 0ms, Memory 356K#include #include #include using namespace std; int n,m,p[9][9],sx,sy,dx[]={0,1,0,-1},dy[]={1,0,-1,0}; struct point { int x,y,time,step;... point(int x=0,int y=0,int time=
/* 题意： 2为起点，3为终点，开始时间为6，没走一步减1； 遇到4时重新计时，可重复走。 解题：就是普通的广搜，唯一不同的是路可重复走，将标记是否走过的mark数组，标记为走过一次加1，每一个位子最多可走8次...
Nightmare Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5647Accepted Submission(s): 2808 Problem Description Ignatius had a nightmare...
http://acm.hdu.edu.cn/showproblem.php?pid=1072 Nightmare Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5438Accepted Submissi...
Nightmare Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5664Accepted Submission(s): 2819 Problem Description Ignatius had a nightmare...
之前的BFS都是需要一个标记数组，但这个题不一样，因为可能一个格子不止走一次。 那么我们就要寻找新的入队条件：left比上次经过的时候大才入队(left表示上次经过该点时剩余的时间)。 为什么呢？...
http://acm.hdu.edu.cn/showproblem.php?pid=1072 Nightmare Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3828 Accepted Submission(s):
对于这道题目和以往的BFS是不同的 题意：尅你一个map[n][m]; 0: 表示是墙; 1：表示是路 2：表示出发点： 3：表示结束点： 思路： 对与以往的广搜，我们都是要标记的，就是不能走以前走过的路，但是这道题是不同的，...