poj 3669 meteor shower

#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
const int maxn = 305;
int visit[maxn][maxn];
int dx[5] = {0,0,1,0,-1};
int dy[5] = {0,1,0,-1,0};
struct node
{
int x,y;
int step;
};
queue<node>q;
node s;
int bfs(int x,int y)
{
if(visit[0][0] == 0)  return -1;///无法逃离
if(visit[0][0] == -1) return 0;  ///安全，无需逃离
    node now,next;
    s.x = x;
    s.y = y;
    s.step = 0;
q.push(s);
while(!q.empty())
{
now = q.front();
q.pop();
for(int i = 0;i < 5;i++)
{
next.x = now.x + dx[i];
next.y = now.y + dy[i];
next.step = now.step + 1;


if(next.x >= 0 && next.y >= 0 && next.y < maxn && next.x < maxn)
{
if(visit[next.x][next.y] == -1)
{
return next.step;
}
if(next.step < visit[next.x][next.y])
{
visit[next.x][next.y] = next.step;///记录最小的步数
q.push(next);
}
}
}
}
return -1;
}
int main()
{


int m;
    while(cin >> m)
{
        int x,y,t,xx,yy;
   memset(visit,-1,sizeof(visit));///起初 所有位置都是安全的
   for(int i = 0;i < m; i++)
   {
       cin >> x >> y >> t;
       for(int i=0; i<5;i++)
       {
           xx = x + dx[i];
           yy = y + dy[i];
           if(xx >= 0 && yy >= 0 && xx < maxn && yy < maxn)
{
           if(visit[xx][yy] == -1)
            visit[xx][yy] = t;
           else
            visit[xx][yy] = min(visit[xx][yy],t);///可能被击中多次我们需要记住第一次被击中的时间
}
       }
   }
   cout << bfs(0,0) << endl;


}
    return 0;
}

Bessie hears that an extraordinary meteor shower is coming; reports say that these meteors will crash into earth and destroy anything they hit. Anxious for her safety, she vows to find her way to a safe location (one that is never destroyed by a meteor) . She is currently grazing at the origin in the coordinate plane and wants to move to a new, safer location while avoiding being destroyed by meteors along her way.

The reports say that M meteors (1 ≤ M ≤ 50,000) will strike, with meteor i will striking point (X_i, Y_i) (0 ≤ X_i ≤ 300; 0 ≤ Y_i ≤ 300) at time T_i (0 ≤ T_i  ≤ 1,000). Each meteor destroys the point that it strikes and also the four rectilinearly adjacent lattice points.

Bessie leaves the origin at time 0 and can travel in the first quadrant and parallel to the axes at the rate of one distance unit per second to any of the (often 4) adjacent rectilinear points that are not yet destroyed by a meteor. She cannot be located on a point at any time greater than or equal to the time it is destroyed).

Determine the minimum time it takes Bessie to get to a safe place.

Input

* Line 1: A single integer: M
* Lines 2..M+1: Line i+1 contains three space-separated integers: X_i, Y_i, and T_i

Output

* Line 1: The minimum time it takes Bessie to get to a safe place or -1 if it is impossible.

Sample Input

4
0 0 2
2 1 2
1 1 2
0 3 5

Sample Output

5

</pre>