写的DFS、连样例都过不了。

调了半天BUG了做不出来、帮下呀

#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e4+10;
int broke[310][310];        //broke[i][j] = i代表需要在i之前到达才可以(i都不行)
bool vis[310][310];
int ans = 1e9;
int dir[4][2] = {
    {-1,0},
    {1,0},
    {0,-1},
    {0,1}
};

bool inside(int x,int y) {
    if(x < 0 || y < 0) return false;
    return  true;
}

void dfs(int x,int y,int time) {
    if(time >= ans || broke[x][y] <= time) return;
    if(broke[x][y] == 1e9) {
        ans = min(ans,time);
        return;
    }

    vis[x][y] = true;       //防止重复访问，环的情况
    for(int k = 0;k < 4;k++) {
        int newx = x + dir[k][0];
        int newy = y + dir[k][1];
        if(inside(newx,newy) && !vis[newx][newy] && broke[newx][newy] > time) {
            dfs(newx,newy,time+1);
        }
    }
}

int main() {
    int n;cin>>n;
    int t,x,y;
    fill(broke[0],broke[0]+310*310,1e9);        //默认都可达
    broke[0][0] = 1;
    for(int i = 1;i <= n;i++) {
        cin>>t>>x>>y;
        broke[x][y] = min(broke[x][y],t);       //点燃中间（需要存储时间最小的）
        if(inside(x+1,y)) {     //点燃四周
            broke[x+1][y] = min(broke[x+1][y],t);
        }
        if(inside(x-1,y)) {
            broke[x-1][y] = min(broke[x-1][y],t);
        }
        if(inside(x,y-1)) {
            broke[x][y-1] = min(broke[x][y-1],t);
        }
        if(inside(x,y+1)) {
            broke[x][y+1] = min(broke[x][y+1],t);
        }
    }
    dfs(0,0,0);
    cout<<ans;
    return 0;
}