P2895 [USACO08FEB]Meteor Shower S

传送门
陨落的点会有多个，记录最小值
走过的点不能二次走

bfs

#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
#define fi first
#define se second
using namespace std;
const int N = 310;
int m[N][N];
int f[N][N];
int v[N][N];
int x0,y0,t0;
typedef pair<int,int> pii;
queue <pii> q;
int dx[] = {0,0,1,0,-1};
int dy[] = {0,1,0,-1,0};
int n;
int flag = 0;
void bfs()
{
	q.push({0,0});
	
	v[0][0] = 1;
	
	while(q.size())
	{
		auto t = q.front();
		
		q.pop();
		
		int x = t.fi;
		int y = t.se;
		
		if(m[x][y] == -1)
		{
			flag = 1;
			cout<<f[x][y];
			return ;
		}
		
		for(int i = 1 ; i <= 4 ; i++ )
		{
			if(!f[x+dx[i]][y+dy[i]] && ((m[x+dx[i]][y+dy[i]] > f[x][y]+1) || m[x+dx[i]][y+dy[i]] == -1) && x+dx[i] >= 0 && y+dy[i] >= 0 ) 
		{ 
		    q.push({x+dx[i], y+dy[i]});
			f[x+dx[i]][y+dy[i]] = f[x][y] + 1;
			v[x+dx[i]][y+dy[i]] = 1;
		}
		}	
	}
	
}


int main()
{
	cin>>n;
	
	memset(m,-1,sizeof m);
	
	for(int i = 1 ; i <= n ; i++)
	{
		cin>>x0>>y0>>t0;
		
		for(int i = 0 ; i < 5 ; i++)
		{
		    if(x0+dx[i] >= 0 && y0+dy[i] >= 0 && (m[x0+dx[i]][y0+dy[i]] == -1 || m[x0+dx[i]][y0+dy[i]] > t0))
		    
             m[x0+dx[i]][y0+dy[i]]	= t0;
		}
		
	}
	
	bfs();
	
	if(!flag) cout<<-1;
	
	return 0;
	
}

dfs

#include<iostream>
#include<algorithm>
#include<cstring>

using namespace std;

const int N = 310;
int n;
int f[N][N];
int m[N][N];
int ans = 0x3f3f3f3f;

void dfs(int x , int y , int t)
{
	if(t >= f[x][y] || t >= ans || t >= m[x][y]) 
	return;
	
	f[x][y] = t;
	
	if(m[x][y] == 0x3f3f3f3f)
	{
		ans = min(ans,t);
	    return;
	}
	
	if(x-1>=0) dfs(x-1,y,t+1);
	if(y-1>=0) dfs(x,y-1,t+1);
    //if(x+1<=300)
    dfs(x+1,y,t+1);
	//if(y+1<=300)
	dfs(x,y+1,t+1); 
	
}



int main()
{
	cin>>n;
	
	memset(f,0x3f,sizeof f);
	memset(m,0x3f,sizeof m);
	
	int x0,y0,t;
	for(int i = 1 ; i<= n ; i++)
	{
		cin>>x0>>y0>>t;
	    m[x0][y0] = min(t,m[x0][y0]);
		if(x0 - 1 >= 0) m[x0-1][y0] = min(t,m[x0-1][y0]);
		if(y0 - 1 >= 0) m[x0][y0-1] = min(t,m[x0][y0-1]);
		m[x0+1][y0] = min(t,m[x0+1][y0]);
		m[x0][y0+1] = min(m[x0][y0+1],t);	
		
	}
	
	dfs(0,0,0);
	
	if(ans == 0x3f3f3f3f) cout<<-1;
	else
	cout<<ans;
	
	return 0;
	
	
}