原題

題目描述

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 (Xi, Yi) (0 ≤ Xi ≤ 300; 0 ≤ Yi ≤ 300) at time Ti (0 ≤ Ti  ≤ 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.

牛去看流星雨，不料流星掉下來會砸毀上下左右中五個點。每個流星掉下的位置和時間都不同，求牛能否活命，如果能活命，最短的逃跑時間是多少？

輸入輸出格式

輸入格式：

* Line 1: A single integer: M

* Lines 2..M+1: Line i+1 contains three space-separated integers: Xi, Yi, and Ti

輸出格式：

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

輸入輸出樣例

輸入樣例#1： 

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

輸出樣例#1： 

5

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<string>
#include<cstring>
#include<iostream>
#define min(a,b) ((a)<(b)?(a):(b))
using namespace std;
struct Node
{
    int x,y;
    int t;
    Node() {x=y=t=0;}
}que[200000];
int m;
int Map[400][400];
bool u[400][400];
int f=0,r=1;
int dir[5][2]={{-1,0},{1,0},{0,1},{0,-1},{0,0}};
int main()
{
    scanf("%d",&m);
    memset(Map,-1,sizeof Map);
    for(int i=1;i<=m;i++)
    {
        int x,y,t;
        scanf("%d%d%d",&x,&y,&t);
        for(int k=0;k<5;k++)
        {
            int a=x+dir[k][0];
            int b=y+dir[k][1];
            if(a<0 || b<0) continue;
            if(Map[a][b]!=-1) Map[a][b]=min(Map[a][b],t);
            else Map[a][b]=t;
        }
    }
    que[r].t=0;
    que[r].x=0;
    que[r++].y=0;
    u[0][0]=1;
    while(r-f>1)
    {
        f++;
        for(int k=0;k<4;k++)
        {
            int a=que[f].x+dir[k][0];
            int b=que[f].y+dir[k][1];
            if(a<0 || b<0) continue;
            if(Map[a][b]==-1)
            {
                printf("%d",que[f].t+1);
                return 0;
            }
            if(u[a][b] || que[f].t+1>=Map[a][b]) continue;
            que[r].t=que[f].t+1;
            que[r].x=a;
            que[r++].y=b;
            u[a][b]=1;
        }
    }
    printf("-1");
    return 0;
}