POJ 3669 Meteor Shower

Description

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.

  一般难度的BFS，题意就是流星会砸人，砸到的地方还有持续范围伤害，主角要满血通关。

  做一下预处理就好了。

#include <cstdio>
#include <algorithm>
#include <queue>
#include <cstring>
using namespace std;

#define INT_MAX 1 << 30  
#define MAX 400  
typedef long long ll;  
int n;  
struct node{  
    int x;  
    int y;  
    int t;  
}s,current;  
queue<node>q;
int map[MAX][MAX];
int dir[5][2] = {{0,0},{0,1},{0,-1},{1,0},{-1,0}};

int BFS()
{  
    if(map[0][0] == 0)  return -1;
    if(map[0][0] == -1) return 0;
    s.x = s.y = s.t = 0;
    q.push(s);
    while (!q.empty()){  
        current = q.front();  
        q.pop();  
        for (int i = 0; i < 5; i += 1){
            s.x = current.x+dir[i][0];  
            s.y = current.y+dir[i][1];  
            s.t = current.t+1;  
            if(s.x < 0||s.x > MAX||s.y < 0||s.y > MAX)  continue;  
            if(map[s.x][s.y] == -1) return s.t;  
            if(s.t >= map[s.x][s.y])  continue;  
            map[s.x][s.y] = s.t;  
            q.push(s);
        } 
    } 
    return -1;
}

void INIT()  
{  
    memset(map,-1,sizeof(map));  
    scanf("%d", &n);  
    while(n--){  
        int x,y,t;  
        scanf("%d%d%d",&x,&y,&t);  
        for (int i = 0; i < 5; i += 1){
            int x1 = x+dir[i][0];  
            int y1 = y+dir[i][1];  
            if(x1 < 0||x1 >= MAX||y1 < 0||y1 >= MAX)  continue;  
            if(map[x1][y1] == -1)	map[x1][y1] = t;  
            else	map[x1][y1] = min(map[x1][y1],t);  
        }  
    }  
}  

int main()  
{  
    INIT();  
    printf("%d\n", BFS());  
    return 0;  
}